./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c --full-output -ea --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 03d7b7b3
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ab4ce27c037a23a1acb050e4e5e47861985f2a45717e88488eff45dc32b3cf64
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-03d7b7b
[2022-02-20 18:27:56,962 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-02-20 18:27:56,964 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-02-20 18:27:56,989 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-02-20 18:27:56,990 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-02-20 18:27:56,991 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-02-20 18:27:56,992 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-02-20 18:27:56,994 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-02-20 18:27:56,996 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-02-20 18:27:56,996 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-02-20 18:27:56,997 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-02-20 18:27:56,998 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-02-20 18:27:56,999 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-02-20 18:27:57,000 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-02-20 18:27:57,000 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-02-20 18:27:57,001 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-02-20 18:27:57,002 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-02-20 18:27:57,003 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-02-20 18:27:57,004 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-02-20 18:27:57,006 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-02-20 18:27:57,007 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-02-20 18:27:57,013 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-02-20 18:27:57,014 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-02-20 18:27:57,016 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-02-20 18:27:57,018 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-02-20 18:27:57,020 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-02-20 18:27:57,020 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-02-20 18:27:57,021 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-02-20 18:27:57,021 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-02-20 18:27:57,022 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-02-20 18:27:57,022 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-02-20 18:27:57,023 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-02-20 18:27:57,024 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-02-20 18:27:57,024 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-02-20 18:27:57,025 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-02-20 18:27:57,025 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-02-20 18:27:57,026 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-02-20 18:27:57,026 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-02-20 18:27:57,027 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-02-20 18:27:57,027 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-02-20 18:27:57,028 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-02-20 18:27:57,031 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2022-02-20 18:27:57,055 INFO L113 SettingsManager]: Loading preferences was successful
[2022-02-20 18:27:57,055 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-02-20 18:27:57,055 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2022-02-20 18:27:57,056 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2022-02-20 18:27:57,057 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-02-20 18:27:57,057 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-02-20 18:27:57,057 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-02-20 18:27:57,058 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2022-02-20 18:27:57,058 INFO L138 SettingsManager]: * Use SBE=true
[2022-02-20 18:27:57,058 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-02-20 18:27:57,059 INFO L138 SettingsManager]: * sizeof long=4
[2022-02-20 18:27:57,059 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-02-20 18:27:57,059 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-02-20 18:27:57,059 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-02-20 18:27:57,060 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-02-20 18:27:57,060 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-02-20 18:27:57,060 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-02-20 18:27:57,060 INFO L138 SettingsManager]: * sizeof long double=12
[2022-02-20 18:27:57,060 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-02-20 18:27:57,060 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-02-20 18:27:57,061 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-02-20 18:27:57,061 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-02-20 18:27:57,061 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-02-20 18:27:57,061 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-02-20 18:27:57,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-02-20 18:27:57,062 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-02-20 18:27:57,062 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2022-02-20 18:27:57,062 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-02-20 18:27:57,062 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2022-02-20 18:27:57,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2022-02-20 18:27:57,063 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF
[2022-02-20 18:27:57,063 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2022-02-20 18:27:57,063 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-02-20 18:27:57,063 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 -> ab4ce27c037a23a1acb050e4e5e47861985f2a45717e88488eff45dc32b3cf64
[2022-02-20 18:27:57,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-02-20 18:27:57,285 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-02-20 18:27:57,287 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-02-20 18:27:57,289 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-02-20 18:27:57,290 INFO L275 PluginConnector]: CDTParser initialized
[2022-02-20 18:27:57,291 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c
[2022-02-20 18:27:57,351 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bb06b5cb/c8f384b3f0a94beb8f231e3bc12e1320/FLAG400fbbc99
[2022-02-20 18:27:57,770 INFO L306 CDTParser]: Found 1 translation units.
[2022-02-20 18:27:57,772 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c
[2022-02-20 18:27:57,785 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bb06b5cb/c8f384b3f0a94beb8f231e3bc12e1320/FLAG400fbbc99
[2022-02-20 18:27:58,151 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bb06b5cb/c8f384b3f0a94beb8f231e3bc12e1320
[2022-02-20 18:27:58,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-02-20 18:27:58,155 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2022-02-20 18:27:58,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-02-20 18:27:58,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-02-20 18:27:58,161 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-02-20 18:27:58,161 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:27:58" (1/1) ...
[2022-02-20 18:27:58,162 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@123e06df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:58, skipping insertion in model container
[2022-02-20 18:27:58,162 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:27:58" (1/1) ...
[2022-02-20 18:27:58,168 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-02-20 18:27:58,193 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-02-20 18:27:58,382 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c[12667,12680]
[2022-02-20 18:27:58,385 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-02-20 18:27:58,393 INFO L203 MainTranslator]: Completed pre-run
[2022-02-20 18:27:58,439 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c[12667,12680]
[2022-02-20 18:27:58,440 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-02-20 18:27:58,453 INFO L208 MainTranslator]: Completed translation
[2022-02-20 18:27:58,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:58 WrapperNode
[2022-02-20 18:27:58,454 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-02-20 18:27:58,455 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-02-20 18:27:58,455 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-02-20 18:27:58,455 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2022-02-20 18:27:58,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:58" (1/1) ...
[2022-02-20 18:27:58,477 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:58" (1/1) ...
[2022-02-20 18:27:58,541 INFO L137 Inliner]: procedures = 25, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 382
[2022-02-20 18:27:58,542 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-02-20 18:27:58,543 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-02-20 18:27:58,543 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-02-20 18:27:58,543 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-02-20 18:27:58,550 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:58" (1/1) ...
[2022-02-20 18:27:58,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:58" (1/1) ...
[2022-02-20 18:27:58,564 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:58" (1/1) ...
[2022-02-20 18:27:58,567 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:58" (1/1) ...
[2022-02-20 18:27:58,574 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:58" (1/1) ...
[2022-02-20 18:27:58,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:58" (1/1) ...
[2022-02-20 18:27:58,588 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:58" (1/1) ...
[2022-02-20 18:27:58,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-02-20 18:27:58,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-02-20 18:27:58,593 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-02-20 18:27:58,593 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-02-20 18:27:58,594 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:58" (1/1) ...
[2022-02-20 18:27:58,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-02-20 18:27:58,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-20 18:27:58,634 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-02-20 18:27:58,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-02-20 18:27:58,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-02-20 18:27:58,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-02-20 18:27:58,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-02-20 18:27:58,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-02-20 18:27:58,790 INFO L234 CfgBuilder]: Building ICFG
[2022-02-20 18:27:58,793 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-02-20 18:27:59,303 INFO L275 CfgBuilder]: Performing block encoding
[2022-02-20 18:27:59,311 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-02-20 18:27:59,311 INFO L299 CfgBuilder]: Removed 1 assume(true) statements.
[2022-02-20 18:27:59,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:27:59 BoogieIcfgContainer
[2022-02-20 18:27:59,313 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-02-20 18:27:59,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-02-20 18:27:59,315 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-02-20 18:27:59,317 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-02-20 18:27:59,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:27:58" (1/3) ...
[2022-02-20 18:27:59,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3479bf52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:27:59, skipping insertion in model container
[2022-02-20 18:27:59,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:58" (2/3) ...
[2022-02-20 18:27:59,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3479bf52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:27:59, skipping insertion in model container
[2022-02-20 18:27:59,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:27:59" (3/3) ...
[2022-02-20 18:27:59,320 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c
[2022-02-20 18:27:59,324 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-02-20 18:27:59,324 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-02-20 18:27:59,361 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-02-20 18:27:59,366 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR
[2022-02-20 18:27:59,367 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-02-20 18:27:59,384 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 119 states have (on average 1.7058823529411764) internal successors, (203), 120 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:27:59,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2022-02-20 18:27:59,390 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 18:27:59,391 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-20 18:27:59,391 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 18:27:59,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 18:27:59,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1732857806, now seen corresponding path program 1 times
[2022-02-20 18:27:59,404 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 18:27:59,404 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454668752]
[2022-02-20 18:27:59,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 18:27:59,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 18:27:59,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 18:27:59,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {124#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(49, 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;~alive1~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;~alive2~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;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0; {124#true} is VALID
[2022-02-20 18:27:59,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {124#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~alive1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~alive2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~send3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~alive3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~alive4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~id5~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~st5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~send5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~mode5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~alive5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {124#true} is VALID
[2022-02-20 18:27:59,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {124#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {124#true} is VALID
[2022-02-20 18:27:59,609 INFO L290 TraceCheckUtils]: 3: Hoare triple {124#true} init_#res#1 := init_~tmp~0#1; {124#true} is VALID
[2022-02-20 18:27:59,609 INFO L290 TraceCheckUtils]: 4: Hoare triple {124#true} main_#t~ret39#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret39#1 && main_#t~ret39#1 <= 2147483647;main_~i2~0#1 := main_#t~ret39#1;havoc main_#t~ret39#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {124#true} is VALID
[2022-02-20 18:27:59,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {124#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {125#false} is VALID
[2022-02-20 18:27:59,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {125#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {125#false} is VALID
[2022-02-20 18:27:59,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {125#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {125#false} is VALID
[2022-02-20 18:27:59,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {125#false} assume !(0 != ~mode1~0 % 256); {125#false} is VALID
[2022-02-20 18:27:59,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {125#false} assume !(0 != ~alive1~0 % 256); {125#false} is VALID
[2022-02-20 18:27:59,617 INFO L290 TraceCheckUtils]: 10: Hoare triple {125#false} ~mode1~0 := 1; {125#false} is VALID
[2022-02-20 18:27:59,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {125#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {125#false} is VALID
[2022-02-20 18:27:59,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {125#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {125#false} is VALID
[2022-02-20 18:27:59,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {125#false} assume !(node2_~m2~0#1 != ~nomsg~0); {125#false} is VALID
[2022-02-20 18:27:59,618 INFO L290 TraceCheckUtils]: 14: Hoare triple {125#false} ~mode2~0 := 0; {125#false} is VALID
[2022-02-20 18:27:59,619 INFO L290 TraceCheckUtils]: 15: Hoare triple {125#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {125#false} is VALID
[2022-02-20 18:27:59,619 INFO L290 TraceCheckUtils]: 16: Hoare triple {125#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {125#false} is VALID
[2022-02-20 18:27:59,619 INFO L290 TraceCheckUtils]: 17: Hoare triple {125#false} assume !(node3_~m3~0#1 != ~nomsg~0); {125#false} is VALID
[2022-02-20 18:27:59,620 INFO L290 TraceCheckUtils]: 18: Hoare triple {125#false} ~mode3~0 := 0; {125#false} is VALID
[2022-02-20 18:27:59,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {125#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {125#false} is VALID
[2022-02-20 18:27:59,621 INFO L290 TraceCheckUtils]: 20: Hoare triple {125#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {125#false} is VALID
[2022-02-20 18:27:59,622 INFO L290 TraceCheckUtils]: 21: Hoare triple {125#false} assume !(node4_~m4~0#1 != ~nomsg~0); {125#false} is VALID
[2022-02-20 18:27:59,623 INFO L290 TraceCheckUtils]: 22: Hoare triple {125#false} ~mode4~0 := 0; {125#false} is VALID
[2022-02-20 18:27:59,623 INFO L290 TraceCheckUtils]: 23: Hoare triple {125#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {125#false} is VALID
[2022-02-20 18:27:59,623 INFO L290 TraceCheckUtils]: 24: Hoare triple {125#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {125#false} is VALID
[2022-02-20 18:27:59,623 INFO L290 TraceCheckUtils]: 25: Hoare triple {125#false} assume !(node5_~m5~0#1 != ~nomsg~0); {125#false} is VALID
[2022-02-20 18:27:59,624 INFO L290 TraceCheckUtils]: 26: Hoare triple {125#false} ~mode5~0 := 0; {125#false} is VALID
[2022-02-20 18:27:59,624 INFO L290 TraceCheckUtils]: 27: Hoare triple {125#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {125#false} is VALID
[2022-02-20 18:27:59,624 INFO L290 TraceCheckUtils]: 28: Hoare triple {125#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {125#false} is VALID
[2022-02-20 18:27:59,625 INFO L290 TraceCheckUtils]: 29: Hoare triple {125#false} check_#res#1 := check_~tmp~1#1; {125#false} is VALID
[2022-02-20 18:27:59,625 INFO L290 TraceCheckUtils]: 30: Hoare triple {125#false} main_#t~ret40#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~c1~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {125#false} is VALID
[2022-02-20 18:27:59,625 INFO L290 TraceCheckUtils]: 31: Hoare triple {125#false} assume 0 == assert_~arg#1 % 256; {125#false} is VALID
[2022-02-20 18:27:59,625 INFO L290 TraceCheckUtils]: 32: Hoare triple {125#false} assume !false; {125#false} is VALID
[2022-02-20 18:27:59,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-20 18:27:59,627 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 18:27:59,628 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454668752]
[2022-02-20 18:27:59,629 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454668752] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 18:27:59,629 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 18:27:59,629 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-02-20 18:27:59,632 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502395254]
[2022-02-20 18:27:59,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 18:27:59,640 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33
[2022-02-20 18:27:59,644 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 18:27:59,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:27:59,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:27:59,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2022-02-20 18:27:59,703 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 18:27:59,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2022-02-20 18:27:59,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2022-02-20 18:27:59,729 INFO L87 Difference]: Start difference. First operand has 121 states, 119 states have (on average 1.7058823529411764) internal successors, (203), 120 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:27:59,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:27:59,885 INFO L93 Difference]: Finished difference Result 201 states and 333 transitions.
[2022-02-20 18:27:59,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-02-20 18:27:59,886 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33
[2022-02-20 18:27:59,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 18:27:59,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:27:59,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 333 transitions.
[2022-02-20 18:27:59,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:27:59,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 333 transitions.
[2022-02-20 18:27:59,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 333 transitions.
[2022-02-20 18:28:00,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 333 edges. 333 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:28:00,250 INFO L225 Difference]: With dead ends: 201
[2022-02-20 18:28:00,250 INFO L226 Difference]: Without dead ends: 117
[2022-02-20 18:28:00,254 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2022-02-20 18:28:00,258 INFO L933 BasicCegarLoop]: 196 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, 196 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-02-20 18:28:00,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-02-20 18:28:00,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states.
[2022-02-20 18:28:00,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117.
[2022-02-20 18:28:00,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 18:28:00,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 117 states, 116 states have (on average 1.6896551724137931) internal successors, (196), 116 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:00,290 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 117 states, 116 states have (on average 1.6896551724137931) internal successors, (196), 116 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:00,291 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 117 states, 116 states have (on average 1.6896551724137931) internal successors, (196), 116 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:00,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:28:00,297 INFO L93 Difference]: Finished difference Result 117 states and 196 transitions.
[2022-02-20 18:28:00,298 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 196 transitions.
[2022-02-20 18:28:00,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 18:28:00,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 18:28:00,299 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 116 states have (on average 1.6896551724137931) internal successors, (196), 116 states have internal predecessors, (196), 0 states have call successors, (0), 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 117 states.
[2022-02-20 18:28:00,300 INFO L87 Difference]: Start difference. First operand has 117 states, 116 states have (on average 1.6896551724137931) internal successors, (196), 116 states have internal predecessors, (196), 0 states have call successors, (0), 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 117 states.
[2022-02-20 18:28:00,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:28:00,306 INFO L93 Difference]: Finished difference Result 117 states and 196 transitions.
[2022-02-20 18:28:00,306 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 196 transitions.
[2022-02-20 18:28:00,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 18:28:00,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 18:28:00,307 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-02-20 18:28:00,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 18:28:00,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.6896551724137931) internal successors, (196), 116 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:00,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 196 transitions.
[2022-02-20 18:28:00,314 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 196 transitions. Word has length 33
[2022-02-20 18:28:00,314 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-20 18:28:00,314 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 196 transitions.
[2022-02-20 18:28:00,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:00,315 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 196 transitions.
[2022-02-20 18:28:00,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2022-02-20 18:28:00,316 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 18:28:00,316 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-20 18:28:00,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-02-20 18:28:00,317 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 18:28:00,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 18:28:00,318 INFO L85 PathProgramCache]: Analyzing trace with hash 2052636400, now seen corresponding path program 1 times
[2022-02-20 18:28:00,318 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 18:28:00,318 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267479052]
[2022-02-20 18:28:00,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 18:28:00,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 18:28:00,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 18:28:00,413 INFO L290 TraceCheckUtils]: 0: Hoare triple {704#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(49, 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;~alive1~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;~alive2~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;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0; {704#true} is VALID
[2022-02-20 18:28:00,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {704#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~alive1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~alive2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~send3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~alive3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~alive4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~id5~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~st5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~send5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~mode5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~alive5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {704#true} is VALID
[2022-02-20 18:28:00,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {704#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {706#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID
[2022-02-20 18:28:00,414 INFO L290 TraceCheckUtils]: 3: Hoare triple {706#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {707#(= |ULTIMATE.start_init_#res#1| 0)} is VALID
[2022-02-20 18:28:00,415 INFO L290 TraceCheckUtils]: 4: Hoare triple {707#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret39#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret39#1 && main_#t~ret39#1 <= 2147483647;main_~i2~0#1 := main_#t~ret39#1;havoc main_#t~ret39#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {708#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID
[2022-02-20 18:28:00,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {708#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {705#false} is VALID
[2022-02-20 18:28:00,416 INFO L290 TraceCheckUtils]: 6: Hoare triple {705#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {705#false} is VALID
[2022-02-20 18:28:00,416 INFO L290 TraceCheckUtils]: 7: Hoare triple {705#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {705#false} is VALID
[2022-02-20 18:28:00,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {705#false} assume !(0 != ~mode1~0 % 256); {705#false} is VALID
[2022-02-20 18:28:00,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {705#false} assume !(0 != ~alive1~0 % 256); {705#false} is VALID
[2022-02-20 18:28:00,417 INFO L290 TraceCheckUtils]: 10: Hoare triple {705#false} ~mode1~0 := 1; {705#false} is VALID
[2022-02-20 18:28:00,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {705#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {705#false} is VALID
[2022-02-20 18:28:00,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {705#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {705#false} is VALID
[2022-02-20 18:28:00,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {705#false} assume !(node2_~m2~0#1 != ~nomsg~0); {705#false} is VALID
[2022-02-20 18:28:00,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {705#false} ~mode2~0 := 0; {705#false} is VALID
[2022-02-20 18:28:00,418 INFO L290 TraceCheckUtils]: 15: Hoare triple {705#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {705#false} is VALID
[2022-02-20 18:28:00,421 INFO L290 TraceCheckUtils]: 16: Hoare triple {705#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {705#false} is VALID
[2022-02-20 18:28:00,422 INFO L290 TraceCheckUtils]: 17: Hoare triple {705#false} assume !(node3_~m3~0#1 != ~nomsg~0); {705#false} is VALID
[2022-02-20 18:28:00,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {705#false} ~mode3~0 := 0; {705#false} is VALID
[2022-02-20 18:28:00,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {705#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {705#false} is VALID
[2022-02-20 18:28:00,424 INFO L290 TraceCheckUtils]: 20: Hoare triple {705#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {705#false} is VALID
[2022-02-20 18:28:00,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {705#false} assume !(node4_~m4~0#1 != ~nomsg~0); {705#false} is VALID
[2022-02-20 18:28:00,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {705#false} ~mode4~0 := 0; {705#false} is VALID
[2022-02-20 18:28:00,424 INFO L290 TraceCheckUtils]: 23: Hoare triple {705#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {705#false} is VALID
[2022-02-20 18:28:00,425 INFO L290 TraceCheckUtils]: 24: Hoare triple {705#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {705#false} is VALID
[2022-02-20 18:28:00,425 INFO L290 TraceCheckUtils]: 25: Hoare triple {705#false} assume !(node5_~m5~0#1 != ~nomsg~0); {705#false} is VALID
[2022-02-20 18:28:00,426 INFO L290 TraceCheckUtils]: 26: Hoare triple {705#false} ~mode5~0 := 0; {705#false} is VALID
[2022-02-20 18:28:00,426 INFO L290 TraceCheckUtils]: 27: Hoare triple {705#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {705#false} is VALID
[2022-02-20 18:28:00,426 INFO L290 TraceCheckUtils]: 28: Hoare triple {705#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {705#false} is VALID
[2022-02-20 18:28:00,426 INFO L290 TraceCheckUtils]: 29: Hoare triple {705#false} check_#res#1 := check_~tmp~1#1; {705#false} is VALID
[2022-02-20 18:28:00,427 INFO L290 TraceCheckUtils]: 30: Hoare triple {705#false} main_#t~ret40#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~c1~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {705#false} is VALID
[2022-02-20 18:28:00,427 INFO L290 TraceCheckUtils]: 31: Hoare triple {705#false} assume 0 == assert_~arg#1 % 256; {705#false} is VALID
[2022-02-20 18:28:00,427 INFO L290 TraceCheckUtils]: 32: Hoare triple {705#false} assume !false; {705#false} is VALID
[2022-02-20 18:28:00,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-20 18:28:00,428 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 18:28:00,428 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267479052]
[2022-02-20 18:28:00,429 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267479052] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 18:28:00,429 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 18:28:00,429 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-02-20 18:28:00,429 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534861927]
[2022-02-20 18:28:00,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 18:28:00,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33
[2022-02-20 18:28:00,432 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 18:28:00,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:00,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:28:00,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-02-20 18:28:00,466 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 18:28:00,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-02-20 18:28:00,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-02-20 18:28:00,467 INFO L87 Difference]: Start difference. First operand 117 states and 196 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:00,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:28:00,869 INFO L93 Difference]: Finished difference Result 200 states and 326 transitions.
[2022-02-20 18:28:00,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-02-20 18:28:00,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33
[2022-02-20 18:28:00,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 18:28:00,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:00,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 326 transitions.
[2022-02-20 18:28:00,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:00,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 326 transitions.
[2022-02-20 18:28:00,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 326 transitions.
[2022-02-20 18:28:01,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 326 edges. 326 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:28:01,103 INFO L225 Difference]: With dead ends: 200
[2022-02-20 18:28:01,103 INFO L226 Difference]: Without dead ends: 117
[2022-02-20 18:28:01,104 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2022-02-20 18:28:01,105 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 3 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-02-20 18:28:01,105 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 741 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-02-20 18:28:01,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states.
[2022-02-20 18:28:01,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117.
[2022-02-20 18:28:01,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 18:28:01,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 117 states, 116 states have (on average 1.4137931034482758) internal successors, (164), 116 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:01,113 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 117 states, 116 states have (on average 1.4137931034482758) internal successors, (164), 116 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:01,113 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 117 states, 116 states have (on average 1.4137931034482758) internal successors, (164), 116 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:01,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:28:01,117 INFO L93 Difference]: Finished difference Result 117 states and 164 transitions.
[2022-02-20 18:28:01,117 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 164 transitions.
[2022-02-20 18:28:01,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 18:28:01,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 18:28:01,118 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 116 states have (on average 1.4137931034482758) internal successors, (164), 116 states have internal predecessors, (164), 0 states have call successors, (0), 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 117 states.
[2022-02-20 18:28:01,119 INFO L87 Difference]: Start difference. First operand has 117 states, 116 states have (on average 1.4137931034482758) internal successors, (164), 116 states have internal predecessors, (164), 0 states have call successors, (0), 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 117 states.
[2022-02-20 18:28:01,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:28:01,122 INFO L93 Difference]: Finished difference Result 117 states and 164 transitions.
[2022-02-20 18:28:01,122 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 164 transitions.
[2022-02-20 18:28:01,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 18:28:01,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 18:28:01,123 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-02-20 18:28:01,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 18:28:01,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.4137931034482758) internal successors, (164), 116 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:01,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 164 transitions.
[2022-02-20 18:28:01,127 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 164 transitions. Word has length 33
[2022-02-20 18:28:01,128 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-20 18:28:01,128 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 164 transitions.
[2022-02-20 18:28:01,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:01,128 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 164 transitions.
[2022-02-20 18:28:01,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2022-02-20 18:28:01,130 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 18:28:01,130 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-20 18:28:01,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-02-20 18:28:01,130 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 18:28:01,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 18:28:01,131 INFO L85 PathProgramCache]: Analyzing trace with hash 148306117, now seen corresponding path program 1 times
[2022-02-20 18:28:01,131 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 18:28:01,132 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694026907]
[2022-02-20 18:28:01,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 18:28:01,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 18:28:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 18:28:01,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {1290#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(49, 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;~alive1~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;~alive2~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;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0; {1290#true} is VALID
[2022-02-20 18:28:01,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {1290#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~alive1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~alive2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~send3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~alive3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~alive4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~id5~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~st5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~send5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~mode5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~alive5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1290#true} is VALID
[2022-02-20 18:28:01,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {1290#true} assume 0 == ~r1~0 % 256; {1290#true} is VALID
[2022-02-20 18:28:01,272 INFO L290 TraceCheckUtils]: 3: Hoare triple {1290#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {1290#true} is VALID
[2022-02-20 18:28:01,272 INFO L290 TraceCheckUtils]: 4: Hoare triple {1290#true} assume ~id1~0 >= 0; {1290#true} is VALID
[2022-02-20 18:28:01,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {1290#true} assume 0 == ~st1~0; {1290#true} is VALID
[2022-02-20 18:28:01,273 INFO L290 TraceCheckUtils]: 6: Hoare triple {1290#true} assume ~send1~0 == ~id1~0; {1290#true} is VALID
[2022-02-20 18:28:01,277 INFO L290 TraceCheckUtils]: 7: Hoare triple {1290#true} assume 0 == ~mode1~0 % 256; {1290#true} is VALID
[2022-02-20 18:28:01,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {1290#true} assume ~id2~0 >= 0; {1290#true} is VALID
[2022-02-20 18:28:01,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {1290#true} assume 0 == ~st2~0; {1290#true} is VALID
[2022-02-20 18:28:01,279 INFO L290 TraceCheckUtils]: 10: Hoare triple {1290#true} assume ~send2~0 == ~id2~0; {1290#true} is VALID
[2022-02-20 18:28:01,279 INFO L290 TraceCheckUtils]: 11: Hoare triple {1290#true} assume 0 == ~mode2~0 % 256; {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:28:01,280 INFO L290 TraceCheckUtils]: 12: Hoare triple {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:28:01,280 INFO L290 TraceCheckUtils]: 13: Hoare triple {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:28:01,281 INFO L290 TraceCheckUtils]: 14: Hoare triple {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:28:01,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:28:01,282 INFO L290 TraceCheckUtils]: 16: Hoare triple {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:28:01,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:28:01,283 INFO L290 TraceCheckUtils]: 18: Hoare triple {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:28:01,284 INFO L290 TraceCheckUtils]: 19: Hoare triple {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:28:01,284 INFO L290 TraceCheckUtils]: 20: Hoare triple {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:28:01,285 INFO L290 TraceCheckUtils]: 21: Hoare triple {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:28:01,285 INFO L290 TraceCheckUtils]: 22: Hoare triple {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:28:01,286 INFO L290 TraceCheckUtils]: 23: Hoare triple {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:28:01,287 INFO L290 TraceCheckUtils]: 24: Hoare triple {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:28:01,288 INFO L290 TraceCheckUtils]: 25: Hoare triple {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:28:01,288 INFO L290 TraceCheckUtils]: 26: Hoare triple {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:28:01,289 INFO L290 TraceCheckUtils]: 27: Hoare triple {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:28:01,289 INFO L290 TraceCheckUtils]: 28: Hoare triple {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:28:01,290 INFO L290 TraceCheckUtils]: 29: Hoare triple {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:28:01,290 INFO L290 TraceCheckUtils]: 30: Hoare triple {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:28:01,291 INFO L290 TraceCheckUtils]: 31: Hoare triple {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:28:01,292 INFO L290 TraceCheckUtils]: 32: Hoare triple {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:28:01,292 INFO L290 TraceCheckUtils]: 33: Hoare triple {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:28:01,293 INFO L290 TraceCheckUtils]: 34: Hoare triple {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:28:01,293 INFO L290 TraceCheckUtils]: 35: Hoare triple {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret39#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret39#1 && main_#t~ret39#1 <= 2147483647;main_~i2~0#1 := main_#t~ret39#1;havoc main_#t~ret39#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:28:01,294 INFO L290 TraceCheckUtils]: 36: Hoare triple {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:28:01,295 INFO L290 TraceCheckUtils]: 37: Hoare triple {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:28:01,295 INFO L290 TraceCheckUtils]: 38: Hoare triple {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:28:01,296 INFO L290 TraceCheckUtils]: 39: Hoare triple {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:28:01,298 INFO L290 TraceCheckUtils]: 40: Hoare triple {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~alive1~0 % 256); {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:28:01,299 INFO L290 TraceCheckUtils]: 41: Hoare triple {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:28:01,299 INFO L290 TraceCheckUtils]: 42: Hoare triple {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1292#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID
[2022-02-20 18:28:01,300 INFO L290 TraceCheckUtils]: 43: Hoare triple {1292#(= (+ (* (- 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; {1291#false} is VALID
[2022-02-20 18:28:01,300 INFO L290 TraceCheckUtils]: 44: Hoare triple {1291#false} assume !(node2_~m2~0#1 != ~nomsg~0); {1291#false} is VALID
[2022-02-20 18:28:01,300 INFO L290 TraceCheckUtils]: 45: Hoare triple {1291#false} ~mode2~0 := 0; {1291#false} is VALID
[2022-02-20 18:28:01,300 INFO L290 TraceCheckUtils]: 46: Hoare triple {1291#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1291#false} is VALID
[2022-02-20 18:28:01,301 INFO L290 TraceCheckUtils]: 47: Hoare triple {1291#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1291#false} is VALID
[2022-02-20 18:28:01,301 INFO L290 TraceCheckUtils]: 48: Hoare triple {1291#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1291#false} is VALID
[2022-02-20 18:28:01,301 INFO L290 TraceCheckUtils]: 49: Hoare triple {1291#false} ~mode3~0 := 0; {1291#false} is VALID
[2022-02-20 18:28:01,301 INFO L290 TraceCheckUtils]: 50: Hoare triple {1291#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1291#false} is VALID
[2022-02-20 18:28:01,301 INFO L290 TraceCheckUtils]: 51: Hoare triple {1291#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1291#false} is VALID
[2022-02-20 18:28:01,302 INFO L290 TraceCheckUtils]: 52: Hoare triple {1291#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1291#false} is VALID
[2022-02-20 18:28:01,302 INFO L290 TraceCheckUtils]: 53: Hoare triple {1291#false} ~mode4~0 := 0; {1291#false} is VALID
[2022-02-20 18:28:01,302 INFO L290 TraceCheckUtils]: 54: Hoare triple {1291#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {1291#false} is VALID
[2022-02-20 18:28:01,302 INFO L290 TraceCheckUtils]: 55: Hoare triple {1291#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1291#false} is VALID
[2022-02-20 18:28:01,302 INFO L290 TraceCheckUtils]: 56: Hoare triple {1291#false} assume !(node5_~m5~0#1 != ~nomsg~0); {1291#false} is VALID
[2022-02-20 18:28:01,303 INFO L290 TraceCheckUtils]: 57: Hoare triple {1291#false} ~mode5~0 := 0; {1291#false} is VALID
[2022-02-20 18:28:01,303 INFO L290 TraceCheckUtils]: 58: Hoare triple {1291#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1291#false} is VALID
[2022-02-20 18:28:01,303 INFO L290 TraceCheckUtils]: 59: Hoare triple {1291#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {1291#false} is VALID
[2022-02-20 18:28:01,303 INFO L290 TraceCheckUtils]: 60: Hoare triple {1291#false} check_#res#1 := check_~tmp~1#1; {1291#false} is VALID
[2022-02-20 18:28:01,303 INFO L290 TraceCheckUtils]: 61: Hoare triple {1291#false} main_#t~ret40#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~c1~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1291#false} is VALID
[2022-02-20 18:28:01,304 INFO L290 TraceCheckUtils]: 62: Hoare triple {1291#false} assume 0 == assert_~arg#1 % 256; {1291#false} is VALID
[2022-02-20 18:28:01,304 INFO L290 TraceCheckUtils]: 63: Hoare triple {1291#false} assume !false; {1291#false} is VALID
[2022-02-20 18:28:01,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-20 18:28:01,305 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 18:28:01,305 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694026907]
[2022-02-20 18:28:01,305 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694026907] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 18:28:01,305 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 18:28:01,305 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-02-20 18:28:01,306 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052141919]
[2022-02-20 18:28:01,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 18:28:01,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64
[2022-02-20 18:28:01,307 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 18:28:01,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:01,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:28:01,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-02-20 18:28:01,355 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 18:28:01,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-02-20 18:28:01,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-20 18:28:01,356 INFO L87 Difference]: Start difference. First operand 117 states and 164 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:01,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:28:01,602 INFO L93 Difference]: Finished difference Result 263 states and 396 transitions.
[2022-02-20 18:28:01,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-20 18:28:01,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64
[2022-02-20 18:28:01,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 18:28:01,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:01,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions.
[2022-02-20 18:28:01,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:01,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions.
[2022-02-20 18:28:01,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 396 transitions.
[2022-02-20 18:28:01,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 396 edges. 396 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:28:01,893 INFO L225 Difference]: With dead ends: 263
[2022-02-20 18:28:01,893 INFO L226 Difference]: Without dead ends: 184
[2022-02-20 18:28:01,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-20 18:28:01,895 INFO L933 BasicCegarLoop]: 245 mSDtfsCounter, 110 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-02-20 18:28:01,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 366 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-02-20 18:28:01,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states.
[2022-02-20 18:28:01,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182.
[2022-02-20 18:28:01,905 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 18:28:01,906 INFO L82 GeneralOperation]: Start isEquivalent. First operand 184 states. Second operand has 182 states, 181 states have (on average 1.4806629834254144) internal successors, (268), 181 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:01,906 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand has 182 states, 181 states have (on average 1.4806629834254144) internal successors, (268), 181 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:01,907 INFO L87 Difference]: Start difference. First operand 184 states. Second operand has 182 states, 181 states have (on average 1.4806629834254144) internal successors, (268), 181 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:01,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:28:01,911 INFO L93 Difference]: Finished difference Result 184 states and 269 transitions.
[2022-02-20 18:28:01,911 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 269 transitions.
[2022-02-20 18:28:01,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 18:28:01,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 18:28:01,913 INFO L74 IsIncluded]: Start isIncluded. First operand has 182 states, 181 states have (on average 1.4806629834254144) internal successors, (268), 181 states have internal predecessors, (268), 0 states have call successors, (0), 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 184 states.
[2022-02-20 18:28:01,913 INFO L87 Difference]: Start difference. First operand has 182 states, 181 states have (on average 1.4806629834254144) internal successors, (268), 181 states have internal predecessors, (268), 0 states have call successors, (0), 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 184 states.
[2022-02-20 18:28:01,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:28:01,918 INFO L93 Difference]: Finished difference Result 184 states and 269 transitions.
[2022-02-20 18:28:01,918 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 269 transitions.
[2022-02-20 18:28:01,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 18:28:01,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 18:28:01,919 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-02-20 18:28:01,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 18:28:01,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 1.4806629834254144) internal successors, (268), 181 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:01,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 268 transitions.
[2022-02-20 18:28:01,924 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 268 transitions. Word has length 64
[2022-02-20 18:28:01,924 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-20 18:28:01,924 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 268 transitions.
[2022-02-20 18:28:01,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:01,925 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 268 transitions.
[2022-02-20 18:28:01,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2022-02-20 18:28:01,926 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 18:28:01,926 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-20 18:28:01,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-02-20 18:28:01,927 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 18:28:01,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 18:28:01,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1747202786, now seen corresponding path program 1 times
[2022-02-20 18:28:01,927 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 18:28:01,928 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144534324]
[2022-02-20 18:28:01,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 18:28:01,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 18:28:01,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 18:28:02,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {2145#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(49, 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;~alive1~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;~alive2~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;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0; {2145#true} is VALID
[2022-02-20 18:28:02,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {2145#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~alive1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~alive2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~send3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~alive3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~alive4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~id5~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~st5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~send5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~mode5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~alive5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {2145#true} is VALID
[2022-02-20 18:28:02,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {2145#true} assume 0 == ~r1~0 % 256; {2145#true} is VALID
[2022-02-20 18:28:02,004 INFO L290 TraceCheckUtils]: 3: Hoare triple {2145#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {2145#true} is VALID
[2022-02-20 18:28:02,005 INFO L290 TraceCheckUtils]: 4: Hoare triple {2145#true} assume ~id1~0 >= 0; {2145#true} is VALID
[2022-02-20 18:28:02,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {2145#true} assume 0 == ~st1~0; {2145#true} is VALID
[2022-02-20 18:28:02,005 INFO L290 TraceCheckUtils]: 6: Hoare triple {2145#true} assume ~send1~0 == ~id1~0; {2145#true} is VALID
[2022-02-20 18:28:02,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {2145#true} assume 0 == ~mode1~0 % 256; {2145#true} is VALID
[2022-02-20 18:28:02,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {2145#true} assume ~id2~0 >= 0; {2145#true} is VALID
[2022-02-20 18:28:02,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {2145#true} assume 0 == ~st2~0; {2145#true} is VALID
[2022-02-20 18:28:02,005 INFO L290 TraceCheckUtils]: 10: Hoare triple {2145#true} assume ~send2~0 == ~id2~0; {2145#true} is VALID
[2022-02-20 18:28:02,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {2145#true} assume 0 == ~mode2~0 % 256; {2145#true} is VALID
[2022-02-20 18:28:02,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {2145#true} assume ~id3~0 >= 0; {2145#true} is VALID
[2022-02-20 18:28:02,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {2145#true} assume 0 == ~st3~0; {2145#true} is VALID
[2022-02-20 18:28:02,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {2145#true} assume ~send3~0 == ~id3~0; {2145#true} is VALID
[2022-02-20 18:28:02,007 INFO L290 TraceCheckUtils]: 15: Hoare triple {2145#true} assume 0 == ~mode3~0 % 256; {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:28:02,008 INFO L290 TraceCheckUtils]: 16: Hoare triple {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:28:02,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:28:02,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:28:02,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:28:02,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:28:02,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:28:02,011 INFO L290 TraceCheckUtils]: 22: Hoare triple {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:28:02,012 INFO L290 TraceCheckUtils]: 23: Hoare triple {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:28:02,012 INFO L290 TraceCheckUtils]: 24: Hoare triple {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:28:02,013 INFO L290 TraceCheckUtils]: 25: Hoare triple {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:28:02,013 INFO L290 TraceCheckUtils]: 26: Hoare triple {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:28:02,014 INFO L290 TraceCheckUtils]: 27: Hoare triple {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:28:02,014 INFO L290 TraceCheckUtils]: 28: Hoare triple {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:28:02,015 INFO L290 TraceCheckUtils]: 29: Hoare triple {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:28:02,015 INFO L290 TraceCheckUtils]: 30: Hoare triple {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:28:02,016 INFO L290 TraceCheckUtils]: 31: Hoare triple {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:28:02,016 INFO L290 TraceCheckUtils]: 32: Hoare triple {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:28:02,017 INFO L290 TraceCheckUtils]: 33: Hoare triple {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:28:02,017 INFO L290 TraceCheckUtils]: 34: Hoare triple {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:28:02,018 INFO L290 TraceCheckUtils]: 35: Hoare triple {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_#t~ret39#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret39#1 && main_#t~ret39#1 <= 2147483647;main_~i2~0#1 := main_#t~ret39#1;havoc main_#t~ret39#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:28:02,018 INFO L290 TraceCheckUtils]: 36: Hoare triple {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:28:02,019 INFO L290 TraceCheckUtils]: 37: Hoare triple {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:28:02,019 INFO L290 TraceCheckUtils]: 38: Hoare triple {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:28:02,020 INFO L290 TraceCheckUtils]: 39: Hoare triple {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:28:02,020 INFO L290 TraceCheckUtils]: 40: Hoare triple {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~alive1~0 % 256); {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:28:02,021 INFO L290 TraceCheckUtils]: 41: Hoare triple {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:28:02,021 INFO L290 TraceCheckUtils]: 42: Hoare triple {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:28:02,021 INFO L290 TraceCheckUtils]: 43: Hoare triple {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:28:02,022 INFO L290 TraceCheckUtils]: 44: Hoare triple {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~alive2~0 % 256); {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:28:02,022 INFO L290 TraceCheckUtils]: 45: Hoare triple {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~id2~0); {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:28:02,023 INFO L290 TraceCheckUtils]: 46: Hoare triple {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:28:02,023 INFO L290 TraceCheckUtils]: 47: Hoare triple {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {2147#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID
[2022-02-20 18:28:02,024 INFO L290 TraceCheckUtils]: 48: Hoare triple {2147#(= (+ (* (- 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; {2146#false} is VALID
[2022-02-20 18:28:02,024 INFO L290 TraceCheckUtils]: 49: Hoare triple {2146#false} assume !(node3_~m3~0#1 != ~nomsg~0); {2146#false} is VALID
[2022-02-20 18:28:02,024 INFO L290 TraceCheckUtils]: 50: Hoare triple {2146#false} ~mode3~0 := 0; {2146#false} is VALID
[2022-02-20 18:28:02,025 INFO L290 TraceCheckUtils]: 51: Hoare triple {2146#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {2146#false} is VALID
[2022-02-20 18:28:02,025 INFO L290 TraceCheckUtils]: 52: Hoare triple {2146#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2146#false} is VALID
[2022-02-20 18:28:02,025 INFO L290 TraceCheckUtils]: 53: Hoare triple {2146#false} assume !(node4_~m4~0#1 != ~nomsg~0); {2146#false} is VALID
[2022-02-20 18:28:02,025 INFO L290 TraceCheckUtils]: 54: Hoare triple {2146#false} ~mode4~0 := 0; {2146#false} is VALID
[2022-02-20 18:28:02,025 INFO L290 TraceCheckUtils]: 55: Hoare triple {2146#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {2146#false} is VALID
[2022-02-20 18:28:02,026 INFO L290 TraceCheckUtils]: 56: Hoare triple {2146#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {2146#false} is VALID
[2022-02-20 18:28:02,026 INFO L290 TraceCheckUtils]: 57: Hoare triple {2146#false} assume !(node5_~m5~0#1 != ~nomsg~0); {2146#false} is VALID
[2022-02-20 18:28:02,026 INFO L290 TraceCheckUtils]: 58: Hoare triple {2146#false} ~mode5~0 := 0; {2146#false} is VALID
[2022-02-20 18:28:02,026 INFO L290 TraceCheckUtils]: 59: Hoare triple {2146#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {2146#false} is VALID
[2022-02-20 18:28:02,026 INFO L290 TraceCheckUtils]: 60: Hoare triple {2146#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {2146#false} is VALID
[2022-02-20 18:28:02,026 INFO L290 TraceCheckUtils]: 61: Hoare triple {2146#false} check_#res#1 := check_~tmp~1#1; {2146#false} is VALID
[2022-02-20 18:28:02,027 INFO L290 TraceCheckUtils]: 62: Hoare triple {2146#false} main_#t~ret40#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~c1~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {2146#false} is VALID
[2022-02-20 18:28:02,027 INFO L290 TraceCheckUtils]: 63: Hoare triple {2146#false} assume 0 == assert_~arg#1 % 256; {2146#false} is VALID
[2022-02-20 18:28:02,027 INFO L290 TraceCheckUtils]: 64: Hoare triple {2146#false} assume !false; {2146#false} is VALID
[2022-02-20 18:28:02,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-20 18:28:02,028 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 18:28:02,028 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144534324]
[2022-02-20 18:28:02,028 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144534324] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 18:28:02,028 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 18:28:02,029 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-02-20 18:28:02,029 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866174128]
[2022-02-20 18:28:02,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 18:28:02,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65
[2022-02-20 18:28:02,030 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 18:28:02,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:02,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:28:02,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-02-20 18:28:02,076 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 18:28:02,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-02-20 18:28:02,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-20 18:28:02,077 INFO L87 Difference]: Start difference. First operand 182 states and 268 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:02,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:28:02,307 INFO L93 Difference]: Finished difference Result 446 states and 688 transitions.
[2022-02-20 18:28:02,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-20 18:28:02,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65
[2022-02-20 18:28:02,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 18:28:02,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:02,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions.
[2022-02-20 18:28:02,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:02,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions.
[2022-02-20 18:28:02,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 396 transitions.
[2022-02-20 18:28:02,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 396 edges. 396 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:28:02,607 INFO L225 Difference]: With dead ends: 446
[2022-02-20 18:28:02,607 INFO L226 Difference]: Without dead ends: 302
[2022-02-20 18:28:02,608 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-20 18:28:02,609 INFO L933 BasicCegarLoop]: 232 mSDtfsCounter, 105 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-02-20 18:28:02,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 357 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-02-20 18:28:02,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states.
[2022-02-20 18:28:02,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300.
[2022-02-20 18:28:02,623 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 18:28:02,624 INFO L82 GeneralOperation]: Start isEquivalent. First operand 302 states. Second operand has 300 states, 299 states have (on average 1.5217391304347827) internal successors, (455), 299 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:02,624 INFO L74 IsIncluded]: Start isIncluded. First operand 302 states. Second operand has 300 states, 299 states have (on average 1.5217391304347827) internal successors, (455), 299 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:02,625 INFO L87 Difference]: Start difference. First operand 302 states. Second operand has 300 states, 299 states have (on average 1.5217391304347827) internal successors, (455), 299 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:02,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:28:02,633 INFO L93 Difference]: Finished difference Result 302 states and 456 transitions.
[2022-02-20 18:28:02,633 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 456 transitions.
[2022-02-20 18:28:02,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 18:28:02,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 18:28:02,635 INFO L74 IsIncluded]: Start isIncluded. First operand has 300 states, 299 states have (on average 1.5217391304347827) internal successors, (455), 299 states have internal predecessors, (455), 0 states have call successors, (0), 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 302 states.
[2022-02-20 18:28:02,636 INFO L87 Difference]: Start difference. First operand has 300 states, 299 states have (on average 1.5217391304347827) internal successors, (455), 299 states have internal predecessors, (455), 0 states have call successors, (0), 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 302 states.
[2022-02-20 18:28:02,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:28:02,644 INFO L93 Difference]: Finished difference Result 302 states and 456 transitions.
[2022-02-20 18:28:02,644 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 456 transitions.
[2022-02-20 18:28:02,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 18:28:02,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 18:28:02,645 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-02-20 18:28:02,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 18:28:02,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 1.5217391304347827) internal successors, (455), 299 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:02,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 455 transitions.
[2022-02-20 18:28:02,655 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 455 transitions. Word has length 65
[2022-02-20 18:28:02,655 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-20 18:28:02,655 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 455 transitions.
[2022-02-20 18:28:02,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:02,655 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 455 transitions.
[2022-02-20 18:28:02,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2022-02-20 18:28:02,656 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 18:28:02,656 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-20 18:28:02,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2022-02-20 18:28:02,657 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 18:28:02,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 18:28:02,657 INFO L85 PathProgramCache]: Analyzing trace with hash 378408053, now seen corresponding path program 1 times
[2022-02-20 18:28:02,657 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 18:28:02,658 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260872217]
[2022-02-20 18:28:02,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 18:28:02,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 18:28:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 18:28:02,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {3572#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(49, 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;~alive1~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;~alive2~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;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0; {3572#true} is VALID
[2022-02-20 18:28:02,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {3572#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~alive1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~alive2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~send3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~alive3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~alive4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~id5~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~st5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~send5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~mode5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~alive5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {3572#true} is VALID
[2022-02-20 18:28:02,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {3572#true} assume 0 == ~r1~0 % 256; {3572#true} is VALID
[2022-02-20 18:28:02,736 INFO L290 TraceCheckUtils]: 3: Hoare triple {3572#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {3572#true} is VALID
[2022-02-20 18:28:02,736 INFO L290 TraceCheckUtils]: 4: Hoare triple {3572#true} assume ~id1~0 >= 0; {3572#true} is VALID
[2022-02-20 18:28:02,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {3572#true} assume 0 == ~st1~0; {3572#true} is VALID
[2022-02-20 18:28:02,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {3572#true} assume ~send1~0 == ~id1~0; {3572#true} is VALID
[2022-02-20 18:28:02,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {3572#true} assume 0 == ~mode1~0 % 256; {3572#true} is VALID
[2022-02-20 18:28:02,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {3572#true} assume ~id2~0 >= 0; {3572#true} is VALID
[2022-02-20 18:28:02,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {3572#true} assume 0 == ~st2~0; {3572#true} is VALID
[2022-02-20 18:28:02,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {3572#true} assume ~send2~0 == ~id2~0; {3572#true} is VALID
[2022-02-20 18:28:02,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {3572#true} assume 0 == ~mode2~0 % 256; {3572#true} is VALID
[2022-02-20 18:28:02,737 INFO L290 TraceCheckUtils]: 12: Hoare triple {3572#true} assume ~id3~0 >= 0; {3572#true} is VALID
[2022-02-20 18:28:02,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {3572#true} assume 0 == ~st3~0; {3572#true} is VALID
[2022-02-20 18:28:02,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {3572#true} assume ~send3~0 == ~id3~0; {3572#true} is VALID
[2022-02-20 18:28:02,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {3572#true} assume 0 == ~mode3~0 % 256; {3572#true} is VALID
[2022-02-20 18:28:02,738 INFO L290 TraceCheckUtils]: 16: Hoare triple {3572#true} assume ~id4~0 >= 0; {3572#true} is VALID
[2022-02-20 18:28:02,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {3572#true} assume 0 == ~st4~0; {3572#true} is VALID
[2022-02-20 18:28:02,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {3572#true} assume ~send4~0 == ~id4~0; {3572#true} is VALID
[2022-02-20 18:28:02,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {3572#true} assume 0 == ~mode4~0 % 256; {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 18:28:02,739 INFO L290 TraceCheckUtils]: 20: Hoare triple {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 18:28:02,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 18:28:02,740 INFO L290 TraceCheckUtils]: 22: Hoare triple {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 18:28:02,740 INFO L290 TraceCheckUtils]: 23: Hoare triple {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 18:28:02,741 INFO L290 TraceCheckUtils]: 24: Hoare triple {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 18:28:02,741 INFO L290 TraceCheckUtils]: 25: Hoare triple {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 18:28:02,742 INFO L290 TraceCheckUtils]: 26: Hoare triple {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 18:28:02,743 INFO L290 TraceCheckUtils]: 27: Hoare triple {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 18:28:02,743 INFO L290 TraceCheckUtils]: 28: Hoare triple {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 18:28:02,744 INFO L290 TraceCheckUtils]: 29: Hoare triple {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 18:28:02,744 INFO L290 TraceCheckUtils]: 30: Hoare triple {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 18:28:02,745 INFO L290 TraceCheckUtils]: 31: Hoare triple {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 18:28:02,745 INFO L290 TraceCheckUtils]: 32: Hoare triple {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 18:28:02,746 INFO L290 TraceCheckUtils]: 33: Hoare triple {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 18:28:02,746 INFO L290 TraceCheckUtils]: 34: Hoare triple {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 18:28:02,747 INFO L290 TraceCheckUtils]: 35: Hoare triple {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_#t~ret39#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret39#1 && main_#t~ret39#1 <= 2147483647;main_~i2~0#1 := main_#t~ret39#1;havoc main_#t~ret39#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 18:28:02,747 INFO L290 TraceCheckUtils]: 36: Hoare triple {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 18:28:02,748 INFO L290 TraceCheckUtils]: 37: Hoare triple {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 18:28:02,748 INFO L290 TraceCheckUtils]: 38: Hoare triple {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 18:28:02,749 INFO L290 TraceCheckUtils]: 39: Hoare triple {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 18:28:02,749 INFO L290 TraceCheckUtils]: 40: Hoare triple {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~alive1~0 % 256); {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 18:28:02,749 INFO L290 TraceCheckUtils]: 41: Hoare triple {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode1~0 := 1; {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 18:28:02,750 INFO L290 TraceCheckUtils]: 42: Hoare triple {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 18:28:02,750 INFO L290 TraceCheckUtils]: 43: Hoare triple {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 18:28:02,751 INFO L290 TraceCheckUtils]: 44: Hoare triple {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~alive2~0 % 256); {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 18:28:02,751 INFO L290 TraceCheckUtils]: 45: Hoare triple {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send2~0 != ~id2~0); {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 18:28:02,752 INFO L290 TraceCheckUtils]: 46: Hoare triple {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode2~0 := 1; {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 18:28:02,752 INFO L290 TraceCheckUtils]: 47: Hoare triple {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 18:28:02,753 INFO L290 TraceCheckUtils]: 48: Hoare triple {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 18:28:02,753 INFO L290 TraceCheckUtils]: 49: Hoare triple {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~alive3~0 % 256); {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 18:28:02,754 INFO L290 TraceCheckUtils]: 50: Hoare triple {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~id3~0); {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 18:28:02,754 INFO L290 TraceCheckUtils]: 51: Hoare triple {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode3~0 := 1; {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 18:28:02,755 INFO L290 TraceCheckUtils]: 52: Hoare triple {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID
[2022-02-20 18:28:02,755 INFO L290 TraceCheckUtils]: 53: Hoare triple {3574#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {3573#false} is VALID
[2022-02-20 18:28:02,755 INFO L290 TraceCheckUtils]: 54: Hoare triple {3573#false} assume !(node4_~m4~0#1 != ~nomsg~0); {3573#false} is VALID
[2022-02-20 18:28:02,756 INFO L290 TraceCheckUtils]: 55: Hoare triple {3573#false} ~mode4~0 := 0; {3573#false} is VALID
[2022-02-20 18:28:02,756 INFO L290 TraceCheckUtils]: 56: Hoare triple {3573#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {3573#false} is VALID
[2022-02-20 18:28:02,756 INFO L290 TraceCheckUtils]: 57: Hoare triple {3573#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {3573#false} is VALID
[2022-02-20 18:28:02,756 INFO L290 TraceCheckUtils]: 58: Hoare triple {3573#false} assume !(node5_~m5~0#1 != ~nomsg~0); {3573#false} is VALID
[2022-02-20 18:28:02,756 INFO L290 TraceCheckUtils]: 59: Hoare triple {3573#false} ~mode5~0 := 0; {3573#false} is VALID
[2022-02-20 18:28:02,756 INFO L290 TraceCheckUtils]: 60: Hoare triple {3573#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {3573#false} is VALID
[2022-02-20 18:28:02,757 INFO L290 TraceCheckUtils]: 61: Hoare triple {3573#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {3573#false} is VALID
[2022-02-20 18:28:02,757 INFO L290 TraceCheckUtils]: 62: Hoare triple {3573#false} check_#res#1 := check_~tmp~1#1; {3573#false} is VALID
[2022-02-20 18:28:02,757 INFO L290 TraceCheckUtils]: 63: Hoare triple {3573#false} main_#t~ret40#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~c1~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {3573#false} is VALID
[2022-02-20 18:28:02,757 INFO L290 TraceCheckUtils]: 64: Hoare triple {3573#false} assume 0 == assert_~arg#1 % 256; {3573#false} is VALID
[2022-02-20 18:28:02,757 INFO L290 TraceCheckUtils]: 65: Hoare triple {3573#false} assume !false; {3573#false} is VALID
[2022-02-20 18:28:02,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-20 18:28:02,758 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 18:28:02,758 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260872217]
[2022-02-20 18:28:02,758 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260872217] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 18:28:02,758 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 18:28:02,759 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-02-20 18:28:02,759 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511331530]
[2022-02-20 18:28:02,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 18:28:02,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66
[2022-02-20 18:28:02,760 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 18:28:02,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:02,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:28:02,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-02-20 18:28:02,810 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 18:28:02,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-02-20 18:28:02,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-20 18:28:02,811 INFO L87 Difference]: Start difference. First operand 300 states and 455 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:03,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:28:03,074 INFO L93 Difference]: Finished difference Result 776 states and 1209 transitions.
[2022-02-20 18:28:03,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-20 18:28:03,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66
[2022-02-20 18:28:03,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 18:28:03,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:03,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions.
[2022-02-20 18:28:03,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:03,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions.
[2022-02-20 18:28:03,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 396 transitions.
[2022-02-20 18:28:03,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 396 edges. 396 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:28:03,374 INFO L225 Difference]: With dead ends: 776
[2022-02-20 18:28:03,375 INFO L226 Difference]: Without dead ends: 514
[2022-02-20 18:28:03,375 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-20 18:28:03,376 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 100 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-02-20 18:28:03,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 348 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-02-20 18:28:03,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states.
[2022-02-20 18:28:03,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 512.
[2022-02-20 18:28:03,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 18:28:03,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 514 states. Second operand has 512 states, 511 states have (on average 1.5401174168297456) internal successors, (787), 511 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:03,396 INFO L74 IsIncluded]: Start isIncluded. First operand 514 states. Second operand has 512 states, 511 states have (on average 1.5401174168297456) internal successors, (787), 511 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:03,397 INFO L87 Difference]: Start difference. First operand 514 states. Second operand has 512 states, 511 states have (on average 1.5401174168297456) internal successors, (787), 511 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:03,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:28:03,412 INFO L93 Difference]: Finished difference Result 514 states and 788 transitions.
[2022-02-20 18:28:03,412 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 788 transitions.
[2022-02-20 18:28:03,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 18:28:03,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 18:28:03,414 INFO L74 IsIncluded]: Start isIncluded. First operand has 512 states, 511 states have (on average 1.5401174168297456) internal successors, (787), 511 states have internal predecessors, (787), 0 states have call successors, (0), 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 514 states.
[2022-02-20 18:28:03,415 INFO L87 Difference]: Start difference. First operand has 512 states, 511 states have (on average 1.5401174168297456) internal successors, (787), 511 states have internal predecessors, (787), 0 states have call successors, (0), 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 514 states.
[2022-02-20 18:28:03,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:28:03,430 INFO L93 Difference]: Finished difference Result 514 states and 788 transitions.
[2022-02-20 18:28:03,430 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 788 transitions.
[2022-02-20 18:28:03,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 18:28:03,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 18:28:03,431 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-02-20 18:28:03,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 18:28:03,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 511 states have (on average 1.5401174168297456) internal successors, (787), 511 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:03,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 787 transitions.
[2022-02-20 18:28:03,448 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 787 transitions. Word has length 66
[2022-02-20 18:28:03,448 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-20 18:28:03,448 INFO L470 AbstractCegarLoop]: Abstraction has 512 states and 787 transitions.
[2022-02-20 18:28:03,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:03,448 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 787 transitions.
[2022-02-20 18:28:03,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2022-02-20 18:28:03,449 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 18:28:03,449 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-20 18:28:03,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2022-02-20 18:28:03,450 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 18:28:03,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 18:28:03,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1350891378, now seen corresponding path program 1 times
[2022-02-20 18:28:03,450 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 18:28:03,450 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440060404]
[2022-02-20 18:28:03,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 18:28:03,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 18:28:03,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 18:28:03,522 INFO L290 TraceCheckUtils]: 0: Hoare triple {6035#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(49, 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;~alive1~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;~alive2~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;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0; {6035#true} is VALID
[2022-02-20 18:28:03,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {6035#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~alive1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~alive2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~send3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~alive3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~alive4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~id5~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~st5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~send5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~mode5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~alive5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {6035#true} is VALID
[2022-02-20 18:28:03,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {6035#true} assume 0 == ~r1~0 % 256; {6035#true} is VALID
[2022-02-20 18:28:03,523 INFO L290 TraceCheckUtils]: 3: Hoare triple {6035#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {6035#true} is VALID
[2022-02-20 18:28:03,523 INFO L290 TraceCheckUtils]: 4: Hoare triple {6035#true} assume ~id1~0 >= 0; {6035#true} is VALID
[2022-02-20 18:28:03,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {6035#true} assume 0 == ~st1~0; {6035#true} is VALID
[2022-02-20 18:28:03,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {6035#true} assume ~send1~0 == ~id1~0; {6035#true} is VALID
[2022-02-20 18:28:03,523 INFO L290 TraceCheckUtils]: 7: Hoare triple {6035#true} assume 0 == ~mode1~0 % 256; {6035#true} is VALID
[2022-02-20 18:28:03,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {6035#true} assume ~id2~0 >= 0; {6035#true} is VALID
[2022-02-20 18:28:03,524 INFO L290 TraceCheckUtils]: 9: Hoare triple {6035#true} assume 0 == ~st2~0; {6035#true} is VALID
[2022-02-20 18:28:03,524 INFO L290 TraceCheckUtils]: 10: Hoare triple {6035#true} assume ~send2~0 == ~id2~0; {6035#true} is VALID
[2022-02-20 18:28:03,524 INFO L290 TraceCheckUtils]: 11: Hoare triple {6035#true} assume 0 == ~mode2~0 % 256; {6035#true} is VALID
[2022-02-20 18:28:03,524 INFO L290 TraceCheckUtils]: 12: Hoare triple {6035#true} assume ~id3~0 >= 0; {6035#true} is VALID
[2022-02-20 18:28:03,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {6035#true} assume 0 == ~st3~0; {6035#true} is VALID
[2022-02-20 18:28:03,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {6035#true} assume ~send3~0 == ~id3~0; {6035#true} is VALID
[2022-02-20 18:28:03,525 INFO L290 TraceCheckUtils]: 15: Hoare triple {6035#true} assume 0 == ~mode3~0 % 256; {6035#true} is VALID
[2022-02-20 18:28:03,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {6035#true} assume ~id4~0 >= 0; {6035#true} is VALID
[2022-02-20 18:28:03,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {6035#true} assume 0 == ~st4~0; {6035#true} is VALID
[2022-02-20 18:28:03,525 INFO L290 TraceCheckUtils]: 18: Hoare triple {6035#true} assume ~send4~0 == ~id4~0; {6035#true} is VALID
[2022-02-20 18:28:03,525 INFO L290 TraceCheckUtils]: 19: Hoare triple {6035#true} assume 0 == ~mode4~0 % 256; {6035#true} is VALID
[2022-02-20 18:28:03,525 INFO L290 TraceCheckUtils]: 20: Hoare triple {6035#true} assume ~id5~0 >= 0; {6035#true} is VALID
[2022-02-20 18:28:03,525 INFO L290 TraceCheckUtils]: 21: Hoare triple {6035#true} assume 0 == ~st5~0; {6035#true} is VALID
[2022-02-20 18:28:03,526 INFO L290 TraceCheckUtils]: 22: Hoare triple {6035#true} assume ~send5~0 == ~id5~0; {6035#true} is VALID
[2022-02-20 18:28:03,526 INFO L290 TraceCheckUtils]: 23: Hoare triple {6035#true} assume 0 == ~mode5~0 % 256; {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 18:28:03,527 INFO L290 TraceCheckUtils]: 24: Hoare triple {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 18:28:03,527 INFO L290 TraceCheckUtils]: 25: Hoare triple {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 18:28:03,528 INFO L290 TraceCheckUtils]: 26: Hoare triple {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 18:28:03,528 INFO L290 TraceCheckUtils]: 27: Hoare triple {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 18:28:03,529 INFO L290 TraceCheckUtils]: 28: Hoare triple {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 18:28:03,529 INFO L290 TraceCheckUtils]: 29: Hoare triple {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 18:28:03,529 INFO L290 TraceCheckUtils]: 30: Hoare triple {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 18:28:03,530 INFO L290 TraceCheckUtils]: 31: Hoare triple {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 18:28:03,530 INFO L290 TraceCheckUtils]: 32: Hoare triple {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 18:28:03,531 INFO L290 TraceCheckUtils]: 33: Hoare triple {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 18:28:03,531 INFO L290 TraceCheckUtils]: 34: Hoare triple {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 18:28:03,532 INFO L290 TraceCheckUtils]: 35: Hoare triple {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main_#t~ret39#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret39#1 && main_#t~ret39#1 <= 2147483647;main_~i2~0#1 := main_#t~ret39#1;havoc main_#t~ret39#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 18:28:03,532 INFO L290 TraceCheckUtils]: 36: Hoare triple {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 18:28:03,533 INFO L290 TraceCheckUtils]: 37: Hoare triple {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 18:28:03,533 INFO L290 TraceCheckUtils]: 38: Hoare triple {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 18:28:03,534 INFO L290 TraceCheckUtils]: 39: Hoare triple {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 18:28:03,534 INFO L290 TraceCheckUtils]: 40: Hoare triple {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~alive1~0 % 256); {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 18:28:03,535 INFO L290 TraceCheckUtils]: 41: Hoare triple {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode1~0 := 1; {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 18:28:03,535 INFO L290 TraceCheckUtils]: 42: Hoare triple {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 18:28:03,535 INFO L290 TraceCheckUtils]: 43: Hoare triple {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 18:28:03,536 INFO L290 TraceCheckUtils]: 44: Hoare triple {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~alive2~0 % 256); {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 18:28:03,536 INFO L290 TraceCheckUtils]: 45: Hoare triple {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send2~0 != ~id2~0); {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 18:28:03,537 INFO L290 TraceCheckUtils]: 46: Hoare triple {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode2~0 := 1; {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 18:28:03,537 INFO L290 TraceCheckUtils]: 47: Hoare triple {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 18:28:03,538 INFO L290 TraceCheckUtils]: 48: Hoare triple {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 18:28:03,538 INFO L290 TraceCheckUtils]: 49: Hoare triple {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~alive3~0 % 256); {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 18:28:03,539 INFO L290 TraceCheckUtils]: 50: Hoare triple {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send3~0 != ~id3~0); {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 18:28:03,539 INFO L290 TraceCheckUtils]: 51: Hoare triple {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode3~0 := 1; {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 18:28:03,539 INFO L290 TraceCheckUtils]: 52: Hoare triple {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 18:28:03,540 INFO L290 TraceCheckUtils]: 53: Hoare triple {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 18:28:03,540 INFO L290 TraceCheckUtils]: 54: Hoare triple {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~alive4~0 % 256); {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 18:28:03,541 INFO L290 TraceCheckUtils]: 55: Hoare triple {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send4~0 != ~id4~0); {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 18:28:03,541 INFO L290 TraceCheckUtils]: 56: Hoare triple {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode4~0 := 1; {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 18:28:03,542 INFO L290 TraceCheckUtils]: 57: Hoare triple {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID
[2022-02-20 18:28:03,542 INFO L290 TraceCheckUtils]: 58: Hoare triple {6037#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {6036#false} is VALID
[2022-02-20 18:28:03,542 INFO L290 TraceCheckUtils]: 59: Hoare triple {6036#false} assume !(node5_~m5~0#1 != ~nomsg~0); {6036#false} is VALID
[2022-02-20 18:28:03,543 INFO L290 TraceCheckUtils]: 60: Hoare triple {6036#false} ~mode5~0 := 0; {6036#false} is VALID
[2022-02-20 18:28:03,543 INFO L290 TraceCheckUtils]: 61: Hoare triple {6036#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {6036#false} is VALID
[2022-02-20 18:28:03,543 INFO L290 TraceCheckUtils]: 62: Hoare triple {6036#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {6036#false} is VALID
[2022-02-20 18:28:03,543 INFO L290 TraceCheckUtils]: 63: Hoare triple {6036#false} check_#res#1 := check_~tmp~1#1; {6036#false} is VALID
[2022-02-20 18:28:03,543 INFO L290 TraceCheckUtils]: 64: Hoare triple {6036#false} main_#t~ret40#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~c1~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {6036#false} is VALID
[2022-02-20 18:28:03,543 INFO L290 TraceCheckUtils]: 65: Hoare triple {6036#false} assume 0 == assert_~arg#1 % 256; {6036#false} is VALID
[2022-02-20 18:28:03,544 INFO L290 TraceCheckUtils]: 66: Hoare triple {6036#false} assume !false; {6036#false} is VALID
[2022-02-20 18:28:03,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-20 18:28:03,544 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 18:28:03,544 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440060404]
[2022-02-20 18:28:03,545 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440060404] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 18:28:03,545 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 18:28:03,545 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-02-20 18:28:03,545 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42961700]
[2022-02-20 18:28:03,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 18:28:03,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67
[2022-02-20 18:28:03,546 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 18:28:03,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:03,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:28:03,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-02-20 18:28:03,602 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 18:28:03,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-02-20 18:28:03,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-20 18:28:03,603 INFO L87 Difference]: Start difference. First operand 512 states and 787 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:03,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:28:03,892 INFO L93 Difference]: Finished difference Result 1364 states and 2125 transitions.
[2022-02-20 18:28:03,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-02-20 18:28:03,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67
[2022-02-20 18:28:03,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 18:28:03,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:03,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions.
[2022-02-20 18:28:03,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:03,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions.
[2022-02-20 18:28:03,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 396 transitions.
[2022-02-20 18:28:04,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 396 edges. 396 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:28:04,218 INFO L225 Difference]: With dead ends: 1364
[2022-02-20 18:28:04,218 INFO L226 Difference]: Without dead ends: 890
[2022-02-20 18:28:04,219 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-20 18:28:04,220 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 95 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-02-20 18:28:04,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 339 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-02-20 18:28:04,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states.
[2022-02-20 18:28:04,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 888.
[2022-02-20 18:28:04,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 18:28:04,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 890 states. Second operand has 888 states, 887 states have (on average 1.5411499436302143) internal successors, (1367), 887 states have internal predecessors, (1367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:04,250 INFO L74 IsIncluded]: Start isIncluded. First operand 890 states. Second operand has 888 states, 887 states have (on average 1.5411499436302143) internal successors, (1367), 887 states have internal predecessors, (1367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:04,259 INFO L87 Difference]: Start difference. First operand 890 states. Second operand has 888 states, 887 states have (on average 1.5411499436302143) internal successors, (1367), 887 states have internal predecessors, (1367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:04,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:28:04,297 INFO L93 Difference]: Finished difference Result 890 states and 1368 transitions.
[2022-02-20 18:28:04,298 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1368 transitions.
[2022-02-20 18:28:04,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 18:28:04,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 18:28:04,301 INFO L74 IsIncluded]: Start isIncluded. First operand has 888 states, 887 states have (on average 1.5411499436302143) internal successors, (1367), 887 states have internal predecessors, (1367), 0 states have call successors, (0), 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 890 states.
[2022-02-20 18:28:04,303 INFO L87 Difference]: Start difference. First operand has 888 states, 887 states have (on average 1.5411499436302143) internal successors, (1367), 887 states have internal predecessors, (1367), 0 states have call successors, (0), 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 890 states.
[2022-02-20 18:28:04,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:28:04,342 INFO L93 Difference]: Finished difference Result 890 states and 1368 transitions.
[2022-02-20 18:28:04,342 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1368 transitions.
[2022-02-20 18:28:04,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 18:28:04,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 18:28:04,344 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-02-20 18:28:04,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 18:28:04,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 887 states have (on average 1.5411499436302143) internal successors, (1367), 887 states have internal predecessors, (1367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:04,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1367 transitions.
[2022-02-20 18:28:04,388 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1367 transitions. Word has length 67
[2022-02-20 18:28:04,388 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-20 18:28:04,388 INFO L470 AbstractCegarLoop]: Abstraction has 888 states and 1367 transitions.
[2022-02-20 18:28:04,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:04,389 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1367 transitions.
[2022-02-20 18:28:04,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2022-02-20 18:28:04,389 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 18:28:04,389 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-20 18:28:04,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2022-02-20 18:28:04,390 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 18:28:04,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 18:28:04,390 INFO L85 PathProgramCache]: Analyzing trace with hash 644065317, now seen corresponding path program 1 times
[2022-02-20 18:28:04,391 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 18:28:04,391 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468798265]
[2022-02-20 18:28:04,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 18:28:04,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 18:28:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 18:28:04,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {10354#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(49, 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;~alive1~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;~alive2~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;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0; {10354#true} is VALID
[2022-02-20 18:28:04,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {10354#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~alive1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~alive2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~send3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~alive3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~alive4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~id5~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~st5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~send5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~mode5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~alive5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {10354#true} is VALID
[2022-02-20 18:28:04,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {10354#true} assume 0 == ~r1~0 % 256; {10354#true} is VALID
[2022-02-20 18:28:04,477 INFO L290 TraceCheckUtils]: 3: Hoare triple {10354#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {10354#true} is VALID
[2022-02-20 18:28:04,477 INFO L290 TraceCheckUtils]: 4: Hoare triple {10354#true} assume ~id1~0 >= 0; {10354#true} is VALID
[2022-02-20 18:28:04,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {10354#true} assume 0 == ~st1~0; {10356#(<= ~st1~0 0)} is VALID
[2022-02-20 18:28:04,478 INFO L290 TraceCheckUtils]: 6: Hoare triple {10356#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {10356#(<= ~st1~0 0)} is VALID
[2022-02-20 18:28:04,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {10356#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {10356#(<= ~st1~0 0)} is VALID
[2022-02-20 18:28:04,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {10356#(<= ~st1~0 0)} assume ~id2~0 >= 0; {10356#(<= ~st1~0 0)} is VALID
[2022-02-20 18:28:04,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {10356#(<= ~st1~0 0)} assume 0 == ~st2~0; {10357#(<= (+ ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,480 INFO L290 TraceCheckUtils]: 10: Hoare triple {10357#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {10357#(<= (+ ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,480 INFO L290 TraceCheckUtils]: 11: Hoare triple {10357#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {10357#(<= (+ ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {10357#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {10357#(<= (+ ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {10357#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {10358#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {10358#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {10358#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {10358#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {10358#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {10358#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {10358#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {10358#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {10359#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,483 INFO L290 TraceCheckUtils]: 18: Hoare triple {10359#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {10359#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,483 INFO L290 TraceCheckUtils]: 19: Hoare triple {10359#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {10359#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {10359#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {10359#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,484 INFO L290 TraceCheckUtils]: 21: Hoare triple {10359#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,484 INFO L290 TraceCheckUtils]: 22: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,485 INFO L290 TraceCheckUtils]: 23: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,485 INFO L290 TraceCheckUtils]: 24: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,486 INFO L290 TraceCheckUtils]: 25: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,486 INFO L290 TraceCheckUtils]: 26: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,487 INFO L290 TraceCheckUtils]: 27: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,487 INFO L290 TraceCheckUtils]: 28: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,488 INFO L290 TraceCheckUtils]: 29: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,488 INFO L290 TraceCheckUtils]: 30: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,488 INFO L290 TraceCheckUtils]: 31: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,489 INFO L290 TraceCheckUtils]: 32: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,489 INFO L290 TraceCheckUtils]: 33: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,490 INFO L290 TraceCheckUtils]: 34: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,490 INFO L290 TraceCheckUtils]: 35: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main_#t~ret39#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret39#1 && main_#t~ret39#1 <= 2147483647;main_~i2~0#1 := main_#t~ret39#1;havoc main_#t~ret39#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,490 INFO L290 TraceCheckUtils]: 36: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,491 INFO L290 TraceCheckUtils]: 37: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,491 INFO L290 TraceCheckUtils]: 38: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,496 INFO L290 TraceCheckUtils]: 39: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,497 INFO L290 TraceCheckUtils]: 40: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive1~0 % 256); {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,498 INFO L290 TraceCheckUtils]: 41: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,499 INFO L290 TraceCheckUtils]: 42: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,501 INFO L290 TraceCheckUtils]: 43: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,503 INFO L290 TraceCheckUtils]: 44: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive2~0 % 256); {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,503 INFO L290 TraceCheckUtils]: 45: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,504 INFO L290 TraceCheckUtils]: 46: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,505 INFO L290 TraceCheckUtils]: 47: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,505 INFO L290 TraceCheckUtils]: 48: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,506 INFO L290 TraceCheckUtils]: 49: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive3~0 % 256); {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,507 INFO L290 TraceCheckUtils]: 50: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,507 INFO L290 TraceCheckUtils]: 51: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,508 INFO L290 TraceCheckUtils]: 52: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,511 INFO L290 TraceCheckUtils]: 53: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,512 INFO L290 TraceCheckUtils]: 54: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive4~0 % 256); {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,513 INFO L290 TraceCheckUtils]: 55: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~id4~0); {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,515 INFO L290 TraceCheckUtils]: 56: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode4~0 := 1; {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,515 INFO L290 TraceCheckUtils]: 57: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,516 INFO L290 TraceCheckUtils]: 58: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode5~0 % 256); {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,516 INFO L290 TraceCheckUtils]: 59: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive5~0 % 256); {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,516 INFO L290 TraceCheckUtils]: 60: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send5~0 != ~id5~0); {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,517 INFO L290 TraceCheckUtils]: 61: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode5~0 := 1; {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,517 INFO L290 TraceCheckUtils]: 62: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID
[2022-02-20 18:28:04,518 INFO L290 TraceCheckUtils]: 63: Hoare triple {10360#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {10355#false} is VALID
[2022-02-20 18:28:04,518 INFO L290 TraceCheckUtils]: 64: Hoare triple {10355#false} check_#res#1 := check_~tmp~1#1; {10355#false} is VALID
[2022-02-20 18:28:04,518 INFO L290 TraceCheckUtils]: 65: Hoare triple {10355#false} main_#t~ret40#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~c1~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {10355#false} is VALID
[2022-02-20 18:28:04,518 INFO L290 TraceCheckUtils]: 66: Hoare triple {10355#false} assume 0 == assert_~arg#1 % 256; {10355#false} is VALID
[2022-02-20 18:28:04,518 INFO L290 TraceCheckUtils]: 67: Hoare triple {10355#false} assume !false; {10355#false} is VALID
[2022-02-20 18:28:04,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-20 18:28:04,521 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 18:28:04,521 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468798265]
[2022-02-20 18:28:04,521 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468798265] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 18:28:04,522 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 18:28:04,522 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-02-20 18:28:04,522 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758639575]
[2022-02-20 18:28:04,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 18:28:04,522 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 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 68
[2022-02-20 18:28:04,523 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 18:28:04,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:04,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:28:04,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-02-20 18:28:04,571 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 18:28:04,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-02-20 18:28:04,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2022-02-20 18:28:04,571 INFO L87 Difference]: Start difference. First operand 888 states and 1367 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:08,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:28:08,192 INFO L93 Difference]: Finished difference Result 5988 states and 9341 transitions.
[2022-02-20 18:28:08,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2022-02-20 18:28:08,192 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 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 68
[2022-02-20 18:28:08,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 18:28:08,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:08,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 920 transitions.
[2022-02-20 18:28:08,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:08,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 920 transitions.
[2022-02-20 18:28:08,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 920 transitions.
[2022-02-20 18:28:08,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 920 edges. 920 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:28:09,618 INFO L225 Difference]: With dead ends: 5988
[2022-02-20 18:28:09,618 INFO L226 Difference]: Without dead ends: 5138
[2022-02-20 18:28:09,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110
[2022-02-20 18:28:09,620 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 1193 mSDsluCounter, 1654 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1193 SdHoareTripleChecker+Valid, 1816 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-20 18:28:09,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1193 Valid, 1816 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-20 18:28:09,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5138 states.
[2022-02-20 18:28:10,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5138 to 1736.
[2022-02-20 18:28:10,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 18:28:10,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5138 states. Second operand has 1736 states, 1735 states have (on average 1.534870317002882) internal successors, (2663), 1735 states have internal predecessors, (2663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:10,196 INFO L74 IsIncluded]: Start isIncluded. First operand 5138 states. Second operand has 1736 states, 1735 states have (on average 1.534870317002882) internal successors, (2663), 1735 states have internal predecessors, (2663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:10,199 INFO L87 Difference]: Start difference. First operand 5138 states. Second operand has 1736 states, 1735 states have (on average 1.534870317002882) internal successors, (2663), 1735 states have internal predecessors, (2663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:11,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:28:11,060 INFO L93 Difference]: Finished difference Result 5138 states and 7980 transitions.
[2022-02-20 18:28:11,060 INFO L276 IsEmpty]: Start isEmpty. Operand 5138 states and 7980 transitions.
[2022-02-20 18:28:11,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 18:28:11,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 18:28:11,076 INFO L74 IsIncluded]: Start isIncluded. First operand has 1736 states, 1735 states have (on average 1.534870317002882) internal successors, (2663), 1735 states have internal predecessors, (2663), 0 states have call successors, (0), 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 5138 states.
[2022-02-20 18:28:11,079 INFO L87 Difference]: Start difference. First operand has 1736 states, 1735 states have (on average 1.534870317002882) internal successors, (2663), 1735 states have internal predecessors, (2663), 0 states have call successors, (0), 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 5138 states.
[2022-02-20 18:28:11,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:28:11,780 INFO L93 Difference]: Finished difference Result 5138 states and 7980 transitions.
[2022-02-20 18:28:11,780 INFO L276 IsEmpty]: Start isEmpty. Operand 5138 states and 7980 transitions.
[2022-02-20 18:28:11,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 18:28:11,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 18:28:11,786 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-02-20 18:28:11,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 18:28:11,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1736 states, 1735 states have (on average 1.534870317002882) internal successors, (2663), 1735 states have internal predecessors, (2663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:11,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 2663 transitions.
[2022-02-20 18:28:11,878 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 2663 transitions. Word has length 68
[2022-02-20 18:28:11,879 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-20 18:28:11,879 INFO L470 AbstractCegarLoop]: Abstraction has 1736 states and 2663 transitions.
[2022-02-20 18:28:11,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:11,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2663 transitions.
[2022-02-20 18:28:11,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70
[2022-02-20 18:28:11,880 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 18:28:11,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-20 18:28:11,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2022-02-20 18:28:11,880 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 18:28:11,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 18:28:11,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1892134872, now seen corresponding path program 1 times
[2022-02-20 18:28:11,881 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 18:28:11,881 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389682264]
[2022-02-20 18:28:11,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 18:28:11,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 18:28:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 18:28:12,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {29382#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(49, 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;~alive1~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;~alive2~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;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0; {29382#true} is VALID
[2022-02-20 18:28:12,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {29382#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~alive1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~alive2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~send3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~alive3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~alive4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~id5~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~st5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~send5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~mode5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~alive5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {29382#true} is VALID
[2022-02-20 18:28:12,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {29382#true} assume 0 == ~r1~0 % 256; {29382#true} is VALID
[2022-02-20 18:28:12,028 INFO L290 TraceCheckUtils]: 3: Hoare triple {29382#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID
[2022-02-20 18:28:12,029 INFO L290 TraceCheckUtils]: 4: Hoare triple {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 >= 0; {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID
[2022-02-20 18:28:12,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st1~0; {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID
[2022-02-20 18:28:12,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send1~0 == ~id1~0; {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID
[2022-02-20 18:28:12,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode1~0 % 256; {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID
[2022-02-20 18:28:12,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 >= 0; {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID
[2022-02-20 18:28:12,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st2~0; {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID
[2022-02-20 18:28:12,033 INFO L290 TraceCheckUtils]: 10: Hoare triple {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send2~0 == ~id2~0; {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID
[2022-02-20 18:28:12,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode2~0 % 256; {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID
[2022-02-20 18:28:12,035 INFO L290 TraceCheckUtils]: 12: Hoare triple {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 >= 0; {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID
[2022-02-20 18:28:12,035 INFO L290 TraceCheckUtils]: 13: Hoare triple {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st3~0; {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID
[2022-02-20 18:28:12,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send3~0 == ~id3~0; {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID
[2022-02-20 18:28:12,036 INFO L290 TraceCheckUtils]: 15: Hoare triple {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode3~0 % 256; {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID
[2022-02-20 18:28:12,037 INFO L290 TraceCheckUtils]: 16: Hoare triple {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id4~0 >= 0; {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID
[2022-02-20 18:28:12,038 INFO L290 TraceCheckUtils]: 17: Hoare triple {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st4~0; {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID
[2022-02-20 18:28:12,038 INFO L290 TraceCheckUtils]: 18: Hoare triple {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send4~0 == ~id4~0; {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID
[2022-02-20 18:28:12,039 INFO L290 TraceCheckUtils]: 19: Hoare triple {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode4~0 % 256; {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID
[2022-02-20 18:28:12,039 INFO L290 TraceCheckUtils]: 20: Hoare triple {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id5~0 >= 0; {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID
[2022-02-20 18:28:12,040 INFO L290 TraceCheckUtils]: 21: Hoare triple {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~st5~0; {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID
[2022-02-20 18:28:12,041 INFO L290 TraceCheckUtils]: 22: Hoare triple {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~send5~0 == ~id5~0; {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID
[2022-02-20 18:28:12,041 INFO L290 TraceCheckUtils]: 23: Hoare triple {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume 0 == ~mode5~0 % 256; {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID
[2022-02-20 18:28:12,042 INFO L290 TraceCheckUtils]: 24: Hoare triple {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id2~0; {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID
[2022-02-20 18:28:12,042 INFO L290 TraceCheckUtils]: 25: Hoare triple {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id3~0; {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID
[2022-02-20 18:28:12,043 INFO L290 TraceCheckUtils]: 26: Hoare triple {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id4~0; {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID
[2022-02-20 18:28:12,044 INFO L290 TraceCheckUtils]: 27: Hoare triple {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id1~0 != ~id5~0; {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID
[2022-02-20 18:28:12,044 INFO L290 TraceCheckUtils]: 28: Hoare triple {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id3~0; {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID
[2022-02-20 18:28:12,045 INFO L290 TraceCheckUtils]: 29: Hoare triple {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id4~0; {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID
[2022-02-20 18:28:12,045 INFO L290 TraceCheckUtils]: 30: Hoare triple {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id2~0 != ~id5~0; {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID
[2022-02-20 18:28:12,046 INFO L290 TraceCheckUtils]: 31: Hoare triple {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 != ~id4~0; {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID
[2022-02-20 18:28:12,046 INFO L290 TraceCheckUtils]: 32: Hoare triple {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id3~0 != ~id5~0; {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID
[2022-02-20 18:28:12,047 INFO L290 TraceCheckUtils]: 33: Hoare triple {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID
[2022-02-20 18:28:12,048 INFO L290 TraceCheckUtils]: 34: Hoare triple {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} init_#res#1 := init_~tmp~0#1; {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID
[2022-02-20 18:28:12,048 INFO L290 TraceCheckUtils]: 35: Hoare triple {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} main_#t~ret39#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret39#1 && main_#t~ret39#1 <= 2147483647;main_~i2~0#1 := main_#t~ret39#1;havoc main_#t~ret39#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID
[2022-02-20 18:28:12,050 INFO L290 TraceCheckUtils]: 36: Hoare triple {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !(0 == assume_abort_if_not_~cond#1); {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID
[2022-02-20 18:28:12,050 INFO L290 TraceCheckUtils]: 37: Hoare triple {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID
[2022-02-20 18:28:12,051 INFO L290 TraceCheckUtils]: 38: Hoare triple {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID
[2022-02-20 18:28:12,052 INFO L290 TraceCheckUtils]: 39: Hoare triple {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !(0 != ~mode1~0 % 256); {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} is VALID
[2022-02-20 18:28:12,053 INFO L290 TraceCheckUtils]: 40: Hoare triple {29384#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} assume !(0 != ~alive1~0 % 256); {29385#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} is VALID
[2022-02-20 18:28:12,053 INFO L290 TraceCheckUtils]: 41: Hoare triple {29385#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} ~mode1~0 := 1; {29385#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} is VALID
[2022-02-20 18:28:12,054 INFO L290 TraceCheckUtils]: 42: Hoare triple {29385#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {29385#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} is VALID
[2022-02-20 18:28:12,054 INFO L290 TraceCheckUtils]: 43: Hoare triple {29385#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} assume !(0 != ~mode2~0 % 256); {29385#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} is VALID
[2022-02-20 18:28:12,055 INFO L290 TraceCheckUtils]: 44: Hoare triple {29385#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} assume !(0 != ~alive2~0 % 256); {29386#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} is VALID
[2022-02-20 18:28:12,056 INFO L290 TraceCheckUtils]: 45: Hoare triple {29386#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} assume !(~send2~0 != ~id2~0); {29386#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} is VALID
[2022-02-20 18:28:12,056 INFO L290 TraceCheckUtils]: 46: Hoare triple {29386#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} ~mode2~0 := 1; {29386#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} is VALID
[2022-02-20 18:28:12,057 INFO L290 TraceCheckUtils]: 47: Hoare triple {29386#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {29386#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} is VALID
[2022-02-20 18:28:12,057 INFO L290 TraceCheckUtils]: 48: Hoare triple {29386#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} assume !(0 != ~mode3~0 % 256); {29386#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} is VALID
[2022-02-20 18:28:12,058 INFO L290 TraceCheckUtils]: 49: Hoare triple {29386#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} assume !(0 != ~alive3~0 % 256); {29387#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID
[2022-02-20 18:28:12,059 INFO L290 TraceCheckUtils]: 50: Hoare triple {29387#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} assume !(~send3~0 != ~id3~0); {29387#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID
[2022-02-20 18:28:12,059 INFO L290 TraceCheckUtils]: 51: Hoare triple {29387#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} ~mode3~0 := 1; {29387#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID
[2022-02-20 18:28:12,059 INFO L290 TraceCheckUtils]: 52: Hoare triple {29387#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {29387#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID
[2022-02-20 18:28:12,060 INFO L290 TraceCheckUtils]: 53: Hoare triple {29387#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} assume !(0 != ~mode4~0 % 256); {29387#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID
[2022-02-20 18:28:12,061 INFO L290 TraceCheckUtils]: 54: Hoare triple {29387#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} assume !(0 != ~alive4~0 % 256); {29388#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID
[2022-02-20 18:28:12,061 INFO L290 TraceCheckUtils]: 55: Hoare triple {29388#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} assume !(~send4~0 != ~id4~0); {29388#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID
[2022-02-20 18:28:12,061 INFO L290 TraceCheckUtils]: 56: Hoare triple {29388#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} ~mode4~0 := 1; {29388#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID
[2022-02-20 18:28:12,062 INFO L290 TraceCheckUtils]: 57: Hoare triple {29388#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {29388#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID
[2022-02-20 18:28:12,062 INFO L290 TraceCheckUtils]: 58: Hoare triple {29388#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} assume !(0 != ~mode5~0 % 256); {29388#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID
[2022-02-20 18:28:12,063 INFO L290 TraceCheckUtils]: 59: Hoare triple {29388#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} assume !(0 != ~alive5~0 % 256); {29383#false} is VALID
[2022-02-20 18:28:12,063 INFO L290 TraceCheckUtils]: 60: Hoare triple {29383#false} assume !(~send5~0 != ~id5~0); {29383#false} is VALID
[2022-02-20 18:28:12,063 INFO L290 TraceCheckUtils]: 61: Hoare triple {29383#false} ~mode5~0 := 1; {29383#false} is VALID
[2022-02-20 18:28:12,063 INFO L290 TraceCheckUtils]: 62: Hoare triple {29383#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {29383#false} is VALID
[2022-02-20 18:28:12,063 INFO L290 TraceCheckUtils]: 63: Hoare triple {29383#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {29383#false} is VALID
[2022-02-20 18:28:12,063 INFO L290 TraceCheckUtils]: 64: Hoare triple {29383#false} assume ~r1~0 % 256 < 5;check_~tmp~1#1 := 1; {29383#false} is VALID
[2022-02-20 18:28:12,064 INFO L290 TraceCheckUtils]: 65: Hoare triple {29383#false} check_#res#1 := check_~tmp~1#1; {29383#false} is VALID
[2022-02-20 18:28:12,064 INFO L290 TraceCheckUtils]: 66: Hoare triple {29383#false} main_#t~ret40#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~c1~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {29383#false} is VALID
[2022-02-20 18:28:12,064 INFO L290 TraceCheckUtils]: 67: Hoare triple {29383#false} assume 0 == assert_~arg#1 % 256; {29383#false} is VALID
[2022-02-20 18:28:12,064 INFO L290 TraceCheckUtils]: 68: Hoare triple {29383#false} assume !false; {29383#false} is VALID
[2022-02-20 18:28:12,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-20 18:28:12,065 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 18:28:12,065 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389682264]
[2022-02-20 18:28:12,065 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389682264] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 18:28:12,065 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 18:28:12,065 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-02-20 18:28:12,066 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789756882]
[2022-02-20 18:28:12,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 18:28:12,066 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 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 69
[2022-02-20 18:28:12,067 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 18:28:12,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:12,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:28:12,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-02-20 18:28:12,145 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 18:28:12,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-02-20 18:28:12,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2022-02-20 18:28:12,146 INFO L87 Difference]: Start difference. First operand 1736 states and 2663 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:18,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:28:18,738 INFO L93 Difference]: Finished difference Result 9394 states and 14348 transitions.
[2022-02-20 18:28:18,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2022-02-20 18:28:18,739 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 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 69
[2022-02-20 18:28:18,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 18:28:18,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:18,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 704 transitions.
[2022-02-20 18:28:18,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:18,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 704 transitions.
[2022-02-20 18:28:18,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 704 transitions.
[2022-02-20 18:28:19,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 704 edges. 704 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:28:21,102 INFO L225 Difference]: With dead ends: 9394
[2022-02-20 18:28:21,102 INFO L226 Difference]: Without dead ends: 7696
[2022-02-20 18:28:21,105 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2022-02-20 18:28:21,105 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 827 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-02-20 18:28:21,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [827 Valid, 739 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-02-20 18:28:21,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7696 states.
[2022-02-20 18:28:24,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7696 to 7688.
[2022-02-20 18:28:24,180 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 18:28:24,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7696 states. Second operand has 7688 states, 7687 states have (on average 1.5203590477429427) internal successors, (11687), 7687 states have internal predecessors, (11687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:24,204 INFO L74 IsIncluded]: Start isIncluded. First operand 7696 states. Second operand has 7688 states, 7687 states have (on average 1.5203590477429427) internal successors, (11687), 7687 states have internal predecessors, (11687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:24,214 INFO L87 Difference]: Start difference. First operand 7696 states. Second operand has 7688 states, 7687 states have (on average 1.5203590477429427) internal successors, (11687), 7687 states have internal predecessors, (11687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:25,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:28:25,878 INFO L93 Difference]: Finished difference Result 7696 states and 11691 transitions.
[2022-02-20 18:28:25,878 INFO L276 IsEmpty]: Start isEmpty. Operand 7696 states and 11691 transitions.
[2022-02-20 18:28:25,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 18:28:25,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 18:28:25,898 INFO L74 IsIncluded]: Start isIncluded. First operand has 7688 states, 7687 states have (on average 1.5203590477429427) internal successors, (11687), 7687 states have internal predecessors, (11687), 0 states have call successors, (0), 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 7696 states.
[2022-02-20 18:28:25,911 INFO L87 Difference]: Start difference. First operand has 7688 states, 7687 states have (on average 1.5203590477429427) internal successors, (11687), 7687 states have internal predecessors, (11687), 0 states have call successors, (0), 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 7696 states.
[2022-02-20 18:28:27,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:28:27,415 INFO L93 Difference]: Finished difference Result 7696 states and 11691 transitions.
[2022-02-20 18:28:27,415 INFO L276 IsEmpty]: Start isEmpty. Operand 7696 states and 11691 transitions.
[2022-02-20 18:28:27,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-20 18:28:27,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-02-20 18:28:27,422 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-02-20 18:28:27,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-20 18:28:27,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7688 states, 7687 states have (on average 1.5203590477429427) internal successors, (11687), 7687 states have internal predecessors, (11687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:29,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7688 states to 7688 states and 11687 transitions.
[2022-02-20 18:28:29,240 INFO L78 Accepts]: Start accepts. Automaton has 7688 states and 11687 transitions. Word has length 69
[2022-02-20 18:28:29,240 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-02-20 18:28:29,240 INFO L470 AbstractCegarLoop]: Abstraction has 7688 states and 11687 transitions.
[2022-02-20 18:28:29,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:29,241 INFO L276 IsEmpty]: Start isEmpty. Operand 7688 states and 11687 transitions.
[2022-02-20 18:28:29,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71
[2022-02-20 18:28:29,241 INFO L506 BasicCegarLoop]: Found error trace
[2022-02-20 18:28:29,241 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-02-20 18:28:29,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2022-02-20 18:28:29,242 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-02-20 18:28:29,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-02-20 18:28:29,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1491011308, now seen corresponding path program 1 times
[2022-02-20 18:28:29,242 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-20 18:28:29,242 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839397142]
[2022-02-20 18:28:29,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-20 18:28:29,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-20 18:28:29,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-20 18:28:29,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {64331#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(49, 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;~alive1~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;~alive2~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;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0; {64331#true} is VALID
[2022-02-20 18:28:29,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {64331#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~alive1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~alive2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~send3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~alive3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~alive4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~id5~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~st5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~send5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~mode5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~alive5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {64331#true} is VALID
[2022-02-20 18:28:29,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {64331#true} assume 0 == ~r1~0 % 256; {64331#true} is VALID
[2022-02-20 18:28:29,333 INFO L290 TraceCheckUtils]: 3: Hoare triple {64331#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {64331#true} is VALID
[2022-02-20 18:28:29,333 INFO L290 TraceCheckUtils]: 4: Hoare triple {64331#true} assume ~id1~0 >= 0; {64331#true} is VALID
[2022-02-20 18:28:29,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {64331#true} assume 0 == ~st1~0; {64331#true} is VALID
[2022-02-20 18:28:29,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {64331#true} assume ~send1~0 == ~id1~0; {64331#true} is VALID
[2022-02-20 18:28:29,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {64331#true} assume 0 == ~mode1~0 % 256; {64331#true} is VALID
[2022-02-20 18:28:29,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {64331#true} assume ~id2~0 >= 0; {64331#true} is VALID
[2022-02-20 18:28:29,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {64331#true} assume 0 == ~st2~0; {64331#true} is VALID
[2022-02-20 18:28:29,334 INFO L290 TraceCheckUtils]: 10: Hoare triple {64331#true} assume ~send2~0 == ~id2~0; {64331#true} is VALID
[2022-02-20 18:28:29,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {64331#true} assume 0 == ~mode2~0 % 256; {64331#true} is VALID
[2022-02-20 18:28:29,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {64331#true} assume ~id3~0 >= 0; {64331#true} is VALID
[2022-02-20 18:28:29,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {64331#true} assume 0 == ~st3~0; {64331#true} is VALID
[2022-02-20 18:28:29,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {64331#true} assume ~send3~0 == ~id3~0; {64331#true} is VALID
[2022-02-20 18:28:29,335 INFO L290 TraceCheckUtils]: 15: Hoare triple {64331#true} assume 0 == ~mode3~0 % 256; {64331#true} is VALID
[2022-02-20 18:28:29,335 INFO L290 TraceCheckUtils]: 16: Hoare triple {64331#true} assume ~id4~0 >= 0; {64331#true} is VALID
[2022-02-20 18:28:29,335 INFO L290 TraceCheckUtils]: 17: Hoare triple {64331#true} assume 0 == ~st4~0; {64331#true} is VALID
[2022-02-20 18:28:29,335 INFO L290 TraceCheckUtils]: 18: Hoare triple {64331#true} assume ~send4~0 == ~id4~0; {64331#true} is VALID
[2022-02-20 18:28:29,336 INFO L290 TraceCheckUtils]: 19: Hoare triple {64331#true} assume 0 == ~mode4~0 % 256; {64331#true} is VALID
[2022-02-20 18:28:29,336 INFO L290 TraceCheckUtils]: 20: Hoare triple {64331#true} assume ~id5~0 >= 0; {64331#true} is VALID
[2022-02-20 18:28:29,336 INFO L290 TraceCheckUtils]: 21: Hoare triple {64331#true} assume 0 == ~st5~0; {64331#true} is VALID
[2022-02-20 18:28:29,336 INFO L290 TraceCheckUtils]: 22: Hoare triple {64331#true} assume ~send5~0 == ~id5~0; {64331#true} is VALID
[2022-02-20 18:28:29,336 INFO L290 TraceCheckUtils]: 23: Hoare triple {64331#true} assume 0 == ~mode5~0 % 256; {64331#true} is VALID
[2022-02-20 18:28:29,336 INFO L290 TraceCheckUtils]: 24: Hoare triple {64331#true} assume ~id1~0 != ~id2~0; {64331#true} is VALID
[2022-02-20 18:28:29,336 INFO L290 TraceCheckUtils]: 25: Hoare triple {64331#true} assume ~id1~0 != ~id3~0; {64331#true} is VALID
[2022-02-20 18:28:29,337 INFO L290 TraceCheckUtils]: 26: Hoare triple {64331#true} assume ~id1~0 != ~id4~0; {64331#true} is VALID
[2022-02-20 18:28:29,337 INFO L290 TraceCheckUtils]: 27: Hoare triple {64331#true} assume ~id1~0 != ~id5~0; {64331#true} is VALID
[2022-02-20 18:28:29,337 INFO L290 TraceCheckUtils]: 28: Hoare triple {64331#true} assume ~id2~0 != ~id3~0; {64331#true} is VALID
[2022-02-20 18:28:29,337 INFO L290 TraceCheckUtils]: 29: Hoare triple {64331#true} assume ~id2~0 != ~id4~0; {64331#true} is VALID
[2022-02-20 18:28:29,337 INFO L290 TraceCheckUtils]: 30: Hoare triple {64331#true} assume ~id2~0 != ~id5~0; {64331#true} is VALID
[2022-02-20 18:28:29,337 INFO L290 TraceCheckUtils]: 31: Hoare triple {64331#true} assume ~id3~0 != ~id4~0; {64331#true} is VALID
[2022-02-20 18:28:29,337 INFO L290 TraceCheckUtils]: 32: Hoare triple {64331#true} assume ~id3~0 != ~id5~0; {64331#true} is VALID
[2022-02-20 18:28:29,338 INFO L290 TraceCheckUtils]: 33: Hoare triple {64331#true} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {64331#true} is VALID
[2022-02-20 18:28:29,338 INFO L290 TraceCheckUtils]: 34: Hoare triple {64331#true} init_#res#1 := init_~tmp~0#1; {64331#true} is VALID
[2022-02-20 18:28:29,338 INFO L290 TraceCheckUtils]: 35: Hoare triple {64331#true} main_#t~ret39#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret39#1 && main_#t~ret39#1 <= 2147483647;main_~i2~0#1 := main_#t~ret39#1;havoc main_#t~ret39#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {64331#true} is VALID
[2022-02-20 18:28:29,338 INFO L290 TraceCheckUtils]: 36: Hoare triple {64331#true} assume !(0 == assume_abort_if_not_~cond#1); {64331#true} is VALID
[2022-02-20 18:28:29,338 INFO L290 TraceCheckUtils]: 37: Hoare triple {64331#true} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {64331#true} is VALID
[2022-02-20 18:28:29,338 INFO L290 TraceCheckUtils]: 38: Hoare triple {64331#true} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {64331#true} is VALID
[2022-02-20 18:28:29,338 INFO L290 TraceCheckUtils]: 39: Hoare triple {64331#true} assume !(0 != ~mode1~0 % 256); {64331#true} is VALID
[2022-02-20 18:28:29,338 INFO L290 TraceCheckUtils]: 40: Hoare triple {64331#true} assume !(0 != ~alive1~0 % 256); {64331#true} is VALID
[2022-02-20 18:28:29,339 INFO L290 TraceCheckUtils]: 41: Hoare triple {64331#true} ~mode1~0 := 1; {64331#true} is VALID
[2022-02-20 18:28:29,339 INFO L290 TraceCheckUtils]: 42: Hoare triple {64331#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {64331#true} is VALID
[2022-02-20 18:28:29,339 INFO L290 TraceCheckUtils]: 43: Hoare triple {64331#true} assume !(0 != ~mode2~0 % 256); {64331#true} is VALID
[2022-02-20 18:28:29,339 INFO L290 TraceCheckUtils]: 44: Hoare triple {64331#true} assume !(0 != ~alive2~0 % 256); {64331#true} is VALID
[2022-02-20 18:28:29,339 INFO L290 TraceCheckUtils]: 45: Hoare triple {64331#true} assume !(~send2~0 != ~id2~0); {64331#true} is VALID
[2022-02-20 18:28:29,339 INFO L290 TraceCheckUtils]: 46: Hoare triple {64331#true} ~mode2~0 := 1; {64331#true} is VALID
[2022-02-20 18:28:29,339 INFO L290 TraceCheckUtils]: 47: Hoare triple {64331#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {64331#true} is VALID
[2022-02-20 18:28:29,340 INFO L290 TraceCheckUtils]: 48: Hoare triple {64331#true} assume !(0 != ~mode3~0 % 256); {64331#true} is VALID
[2022-02-20 18:28:29,340 INFO L290 TraceCheckUtils]: 49: Hoare triple {64331#true} assume 0 != ~alive3~0 % 256; {64331#true} is VALID
[2022-02-20 18:28:29,340 INFO L290 TraceCheckUtils]: 50: Hoare triple {64331#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {64331#true} is VALID
[2022-02-20 18:28:29,340 INFO L290 TraceCheckUtils]: 51: Hoare triple {64331#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; {64331#true} is VALID
[2022-02-20 18:28:29,340 INFO L290 TraceCheckUtils]: 52: Hoare triple {64331#true} ~mode3~0 := 1; {64331#true} is VALID
[2022-02-20 18:28:29,340 INFO L290 TraceCheckUtils]: 53: Hoare triple {64331#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {64331#true} is VALID
[2022-02-20 18:28:29,341 INFO L290 TraceCheckUtils]: 54: Hoare triple {64331#true} assume !(0 != ~mode4~0 % 256); {64331#true} is VALID
[2022-02-20 18:28:29,341 INFO L290 TraceCheckUtils]: 55: Hoare triple {64331#true} assume !(0 != ~alive4~0 % 256); {64331#true} is VALID
[2022-02-20 18:28:29,341 INFO L290 TraceCheckUtils]: 56: Hoare triple {64331#true} assume !(~send4~0 != ~id4~0); {64331#true} is VALID
[2022-02-20 18:28:29,341 INFO L290 TraceCheckUtils]: 57: Hoare triple {64331#true} ~mode4~0 := 1; {64331#true} is VALID
[2022-02-20 18:28:29,341 INFO L290 TraceCheckUtils]: 58: Hoare triple {64331#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {64331#true} is VALID
[2022-02-20 18:28:29,341 INFO L290 TraceCheckUtils]: 59: Hoare triple {64331#true} assume !(0 != ~mode5~0 % 256); {64331#true} is VALID
[2022-02-20 18:28:29,341 INFO L290 TraceCheckUtils]: 60: Hoare triple {64331#true} assume !(0 != ~alive5~0 % 256); {64331#true} is VALID
[2022-02-20 18:28:29,341 INFO L290 TraceCheckUtils]: 61: Hoare triple {64331#true} assume !(~send5~0 != ~id5~0); {64331#true} is VALID
[2022-02-20 18:28:29,342 INFO L290 TraceCheckUtils]: 62: Hoare triple {64331#true} ~mode5~0 := 1; {64331#true} is VALID
[2022-02-20 18:28:29,342 INFO L290 TraceCheckUtils]: 63: Hoare triple {64331#true} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {64331#true} is VALID
[2022-02-20 18:28:29,342 INFO L290 TraceCheckUtils]: 64: Hoare triple {64331#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {64331#true} is VALID
[2022-02-20 18:28:29,342 INFO L290 TraceCheckUtils]: 65: Hoare triple {64331#true} assume ~r1~0 % 256 < 5;check_~tmp~1#1 := 1; {64333#(= |ULTIMATE.start_check_~tmp~1#1| 1)} is VALID
[2022-02-20 18:28:29,343 INFO L290 TraceCheckUtils]: 66: Hoare triple {64333#(= |ULTIMATE.start_check_~tmp~1#1| 1)} check_#res#1 := check_~tmp~1#1; {64334#(= 1 |ULTIMATE.start_check_#res#1|)} is VALID
[2022-02-20 18:28:29,343 INFO L290 TraceCheckUtils]: 67: Hoare triple {64334#(= 1 |ULTIMATE.start_check_#res#1|)} main_#t~ret40#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~c1~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {64335#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} is VALID
[2022-02-20 18:28:29,344 INFO L290 TraceCheckUtils]: 68: Hoare triple {64335#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} assume 0 == assert_~arg#1 % 256; {64332#false} is VALID
[2022-02-20 18:28:29,344 INFO L290 TraceCheckUtils]: 69: Hoare triple {64332#false} assume !false; {64332#false} is VALID
[2022-02-20 18:28:29,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-02-20 18:28:29,344 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-20 18:28:29,345 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839397142]
[2022-02-20 18:28:29,345 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839397142] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-20 18:28:29,345 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-20 18:28:29,345 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-02-20 18:28:29,345 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144429595]
[2022-02-20 18:28:29,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-20 18:28:29,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 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 70
[2022-02-20 18:28:29,346 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-02-20 18:28:29,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:29,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:28:29,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-02-20 18:28:29,391 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-20 18:28:29,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-02-20 18:28:29,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-02-20 18:28:29,391 INFO L87 Difference]: Start difference. First operand 7688 states and 11687 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:45,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-20 18:28:45,555 INFO L93 Difference]: Finished difference Result 15978 states and 23976 transitions.
[2022-02-20 18:28:45,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2022-02-20 18:28:45,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 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 70
[2022-02-20 18:28:45,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-02-20 18:28:45,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:45,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 294 transitions.
[2022-02-20 18:28:45,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:45,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 294 transitions.
[2022-02-20 18:28:45,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 294 transitions.
[2022-02-20 18:28:45,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 294 edges. 294 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-02-20 18:28:53,359 INFO L225 Difference]: With dead ends: 15978
[2022-02-20 18:28:53,359 INFO L226 Difference]: Without dead ends: 15976
[2022-02-20 18:28:53,361 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2022-02-20 18:28:53,362 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 357 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-02-20 18:28:53,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [357 Valid, 729 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-02-20 18:28:53,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15976 states.
[2022-02-20 18:28:57,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15976 to 8168.
[2022-02-20 18:28:57,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-20 18:28:57,987 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15976 states. Second operand has 8168 states, 8167 states have (on average 1.4897759275131628) internal successors, (12167), 8167 states have internal predecessors, (12167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:57,997 INFO L74 IsIncluded]: Start isIncluded. First operand 15976 states. Second operand has 8168 states, 8167 states have (on average 1.4897759275131628) internal successors, (12167), 8167 states have internal predecessors, (12167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-20 18:28:58,005 INFO L87 Difference]: Start difference. First operand 15976 states. Second operand has 8168 states, 8167 states have (on average 1.4897759275131628) internal successors, (12167), 8167 states have internal predecessors, (12167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)