./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.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.1.ufo.BOUNDED-10.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 2d5a83ebadca07865f87524ca234843199e1b35abf1f6d3ef3a25954ede1db9e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:27:42,263 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:27:42,265 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:27:42,287 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:27:42,288 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:27:42,289 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:27:42,290 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:27:42,291 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:27:42,293 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:27:42,294 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:27:42,295 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:27:42,296 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:27:42,296 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:27:42,297 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:27:42,298 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:27:42,299 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:27:42,300 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:27:42,301 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:27:42,302 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:27:42,304 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:27:42,305 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:27:42,306 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:27:42,307 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:27:42,308 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:27:42,310 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:27:42,310 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:27:42,310 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:27:42,311 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:27:42,312 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:27:42,312 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:27:42,313 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:27:42,313 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:27:42,314 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:27:42,315 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:27:42,316 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:27:42,316 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:27:42,317 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:27:42,317 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:27:42,317 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:27:42,318 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:27:42,318 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:27:42,319 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:42,335 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:27:42,335 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:27:42,335 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:27:42,336 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:27:42,336 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:27:42,337 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:27:42,337 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:27:42,338 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:27:42,338 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:27:42,338 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:27:42,338 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:27:42,339 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:27:42,339 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:27:42,339 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:27:42,339 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:27:42,340 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:27:42,340 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:27:42,340 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:27:42,340 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:27:42,341 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:27:42,341 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:27:42,341 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:27:42,341 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:27:42,342 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:27:42,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:27:42,342 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:27:42,342 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:27:42,343 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:27:42,343 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:27:42,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:27:42,343 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:27:42,344 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:27:42,344 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:27:42,344 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 -> 2d5a83ebadca07865f87524ca234843199e1b35abf1f6d3ef3a25954ede1db9e [2022-02-20 18:27:42,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:27:42,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:27:42,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:27:42,563 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:27:42,566 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:27:42,567 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.1.ufo.BOUNDED-10.pals.c [2022-02-20 18:27:42,633 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b0acdeff/6b59b6697d1d428baa3431b4774183fd/FLAGcf4b62c6b [2022-02-20 18:27:43,027 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:27:43,029 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c [2022-02-20 18:27:43,044 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b0acdeff/6b59b6697d1d428baa3431b4774183fd/FLAGcf4b62c6b [2022-02-20 18:27:43,052 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b0acdeff/6b59b6697d1d428baa3431b4774183fd [2022-02-20 18:27:43,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:27:43,061 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:27:43,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:27:43,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:27:43,066 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:27:43,067 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:27:43" (1/1) ... [2022-02-20 18:27:43,069 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca21b19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:43, skipping insertion in model container [2022-02-20 18:27:43,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:27:43" (1/1) ... [2022-02-20 18:27:43,075 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:27:43,098 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:27:43,363 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.1.ufo.BOUNDED-10.pals.c[12792,12805] [2022-02-20 18:27:43,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:27:43,377 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:27:43,444 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.1.ufo.BOUNDED-10.pals.c[12792,12805] [2022-02-20 18:27:43,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:27:43,459 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:27:43,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:43 WrapperNode [2022-02-20 18:27:43,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:27:43,461 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:27:43,461 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:27:43,461 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:27:43,467 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:43" (1/1) ... [2022-02-20 18:27:43,489 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:43" (1/1) ... [2022-02-20 18:27:43,528 INFO L137 Inliner]: procedures = 24, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 391 [2022-02-20 18:27:43,529 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:27:43,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:27:43,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:27:43,530 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:27:43,537 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:43" (1/1) ... [2022-02-20 18:27:43,538 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:43" (1/1) ... [2022-02-20 18:27:43,541 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:43" (1/1) ... [2022-02-20 18:27:43,552 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:43" (1/1) ... [2022-02-20 18:27:43,559 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:43" (1/1) ... [2022-02-20 18:27:43,565 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:43" (1/1) ... [2022-02-20 18:27:43,568 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:43" (1/1) ... [2022-02-20 18:27:43,571 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:27:43,572 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:27:43,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:27:43,572 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:27:43,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:43" (1/1) ... [2022-02-20 18:27:43,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:27:43,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:27:43,620 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:43,622 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:43,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:27:43,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:27:43,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:27:43,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:27:43,792 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:27:43,794 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:27:44,316 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:27:44,323 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:27:44,323 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:27:44,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:27:44 BoogieIcfgContainer [2022-02-20 18:27:44,325 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:27:44,326 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:27:44,326 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:27:44,329 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:27:44,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:27:43" (1/3) ... [2022-02-20 18:27:44,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21034893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:27:44, skipping insertion in model container [2022-02-20 18:27:44,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:43" (2/3) ... [2022-02-20 18:27:44,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21034893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:27:44, skipping insertion in model container [2022-02-20 18:27:44,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:27:44" (3/3) ... [2022-02-20 18:27:44,332 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c [2022-02-20 18:27:44,336 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:27:44,336 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:27:44,373 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:27:44,379 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:44,379 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:27:44,395 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 120 states have (on average 1.7083333333333333) internal successors, (205), 121 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have 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:44,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 18:27:44,401 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:44,402 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:44,403 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:44,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:44,407 INFO L85 PathProgramCache]: Analyzing trace with hash 563549969, now seen corresponding path program 1 times [2022-02-20 18:27:44,414 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:44,415 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846716181] [2022-02-20 18:27:44,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:44,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:44,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {125#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(50, 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; {125#true} is VALID [2022-02-20 18:27:44,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {125#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~r1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~st4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~send4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~id5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~st5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~send5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~alive5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {125#true} is VALID [2022-02-20 18:27:44,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {125#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {125#true} is VALID [2022-02-20 18:27:44,637 INFO L290 TraceCheckUtils]: 3: Hoare triple {125#true} init_#res#1 := init_~tmp~0#1; {125#true} is VALID [2022-02-20 18:27:44,637 INFO L290 TraceCheckUtils]: 4: Hoare triple {125#true} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; {125#true} is VALID [2022-02-20 18:27:44,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {125#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {126#false} is VALID [2022-02-20 18:27:44,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {126#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; {126#false} is VALID [2022-02-20 18:27:44,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {126#false} assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {126#false} is VALID [2022-02-20 18:27:44,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {126#false} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {126#false} is VALID [2022-02-20 18:27:44,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {126#false} assume !(node1_~m1~0#1 != ~nomsg~0); {126#false} is VALID [2022-02-20 18:27:44,639 INFO L290 TraceCheckUtils]: 10: Hoare triple {126#false} ~mode1~0 := 0; {126#false} is VALID [2022-02-20 18:27:44,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {126#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {126#false} is VALID [2022-02-20 18:27:44,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {126#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {126#false} is VALID [2022-02-20 18:27:44,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {126#false} assume !(node2_~m2~0#1 != ~nomsg~0); {126#false} is VALID [2022-02-20 18:27:44,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {126#false} ~mode2~0 := 0; {126#false} is VALID [2022-02-20 18:27:44,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {126#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {126#false} is VALID [2022-02-20 18:27:44,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {126#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {126#false} is VALID [2022-02-20 18:27:44,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {126#false} assume !(node3_~m3~0#1 != ~nomsg~0); {126#false} is VALID [2022-02-20 18:27:44,641 INFO L290 TraceCheckUtils]: 18: Hoare triple {126#false} ~mode3~0 := 0; {126#false} is VALID [2022-02-20 18:27:44,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {126#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {126#false} is VALID [2022-02-20 18:27:44,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {126#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {126#false} is VALID [2022-02-20 18:27:44,642 INFO L290 TraceCheckUtils]: 21: Hoare triple {126#false} assume !(node4_~m4~0#1 != ~nomsg~0); {126#false} is VALID [2022-02-20 18:27:44,642 INFO L290 TraceCheckUtils]: 22: Hoare triple {126#false} ~mode4~0 := 0; {126#false} is VALID [2022-02-20 18:27:44,642 INFO L290 TraceCheckUtils]: 23: Hoare triple {126#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {126#false} is VALID [2022-02-20 18:27:44,643 INFO L290 TraceCheckUtils]: 24: Hoare triple {126#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {126#false} is VALID [2022-02-20 18:27:44,643 INFO L290 TraceCheckUtils]: 25: Hoare triple {126#false} assume !(node5_~m5~0#1 != ~nomsg~0); {126#false} is VALID [2022-02-20 18:27:44,643 INFO L290 TraceCheckUtils]: 26: Hoare triple {126#false} ~mode5~0 := 0; {126#false} is VALID [2022-02-20 18:27:44,643 INFO L290 TraceCheckUtils]: 27: Hoare triple {126#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; {126#false} is VALID [2022-02-20 18:27:44,644 INFO L290 TraceCheckUtils]: 28: Hoare triple {126#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {126#false} is VALID [2022-02-20 18:27:44,644 INFO L290 TraceCheckUtils]: 29: Hoare triple {126#false} check_#res#1 := check_~tmp~1#1; {126#false} is VALID [2022-02-20 18:27:44,644 INFO L290 TraceCheckUtils]: 30: Hoare triple {126#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {126#false} is VALID [2022-02-20 18:27:44,645 INFO L290 TraceCheckUtils]: 31: Hoare triple {126#false} assume 0 == assert_~arg#1 % 256; {126#false} is VALID [2022-02-20 18:27:44,645 INFO L290 TraceCheckUtils]: 32: Hoare triple {126#false} assume !false; {126#false} is VALID [2022-02-20 18:27:44,646 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:44,646 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:44,647 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846716181] [2022-02-20 18:27:44,647 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846716181] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:44,647 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:44,648 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:27:44,649 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464958354] [2022-02-20 18:27:44,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:44,654 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:44,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:44,657 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:44,689 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:44,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:27:44,689 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:44,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:27:44,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:27:44,720 INFO L87 Difference]: Start difference. First operand has 122 states, 120 states have (on average 1.7083333333333333) internal successors, (205), 121 states have internal predecessors, (205), 0 states have call successors, (0), 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:44,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:44,887 INFO L93 Difference]: Finished difference Result 207 states and 340 transitions. [2022-02-20 18:27:44,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:27:44,888 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:44,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:44,889 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:44,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 340 transitions. [2022-02-20 18:27:44,899 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:44,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 340 transitions. [2022-02-20 18:27:44,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 340 transitions. [2022-02-20 18:27:45,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 340 edges. 340 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:45,218 INFO L225 Difference]: With dead ends: 207 [2022-02-20 18:27:45,219 INFO L226 Difference]: Without dead ends: 118 [2022-02-20 18:27:45,222 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:27:45,226 INFO L933 BasicCegarLoop]: 202 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, 202 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:27:45,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:45,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-02-20 18:27:45,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-02-20 18:27:45,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:45,258 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 118 states, 117 states have (on average 1.6923076923076923) internal successors, (198), 117 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have 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:45,259 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 118 states, 117 states have (on average 1.6923076923076923) internal successors, (198), 117 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have 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:45,260 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 118 states, 117 states have (on average 1.6923076923076923) internal successors, (198), 117 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have 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:45,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:45,266 INFO L93 Difference]: Finished difference Result 118 states and 198 transitions. [2022-02-20 18:27:45,266 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 198 transitions. [2022-02-20 18:27:45,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:45,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:45,268 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 117 states have (on average 1.6923076923076923) internal successors, (198), 117 states have internal predecessors, (198), 0 states have call successors, (0), 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 118 states. [2022-02-20 18:27:45,268 INFO L87 Difference]: Start difference. First operand has 118 states, 117 states have (on average 1.6923076923076923) internal successors, (198), 117 states have internal predecessors, (198), 0 states have call successors, (0), 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 118 states. [2022-02-20 18:27:45,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:45,274 INFO L93 Difference]: Finished difference Result 118 states and 198 transitions. [2022-02-20 18:27:45,274 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 198 transitions. [2022-02-20 18:27:45,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:45,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:45,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:45,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:45,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.6923076923076923) internal successors, (198), 117 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have 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:45,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 198 transitions. [2022-02-20 18:27:45,282 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 198 transitions. Word has length 33 [2022-02-20 18:27:45,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:45,283 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 198 transitions. [2022-02-20 18:27:45,283 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:27:45,283 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 198 transitions. [2022-02-20 18:27:45,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 18:27:45,285 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:45,285 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:45,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:27:45,285 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:45,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:45,286 INFO L85 PathProgramCache]: Analyzing trace with hash 54076879, now seen corresponding path program 1 times [2022-02-20 18:27:45,287 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:45,287 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25617905] [2022-02-20 18:27:45,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:45,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:45,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {715#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(50, 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; {715#true} is VALID [2022-02-20 18:27:45,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {715#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~r1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~st4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~send4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~id5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~st5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~send5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~alive5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {715#true} is VALID [2022-02-20 18:27:45,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {715#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {717#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 18:27:45,387 INFO L290 TraceCheckUtils]: 3: Hoare triple {717#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {718#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:27:45,388 INFO L290 TraceCheckUtils]: 4: Hoare triple {718#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; {719#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 18:27:45,388 INFO L290 TraceCheckUtils]: 5: Hoare triple {719#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {716#false} is VALID [2022-02-20 18:27:45,389 INFO L290 TraceCheckUtils]: 6: Hoare triple {716#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; {716#false} is VALID [2022-02-20 18:27:45,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {716#false} assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {716#false} is VALID [2022-02-20 18:27:45,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {716#false} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {716#false} is VALID [2022-02-20 18:27:45,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {716#false} assume !(node1_~m1~0#1 != ~nomsg~0); {716#false} is VALID [2022-02-20 18:27:45,390 INFO L290 TraceCheckUtils]: 10: Hoare triple {716#false} ~mode1~0 := 0; {716#false} is VALID [2022-02-20 18:27:45,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {716#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {716#false} is VALID [2022-02-20 18:27:45,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {716#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {716#false} is VALID [2022-02-20 18:27:45,391 INFO L290 TraceCheckUtils]: 13: Hoare triple {716#false} assume !(node2_~m2~0#1 != ~nomsg~0); {716#false} is VALID [2022-02-20 18:27:45,391 INFO L290 TraceCheckUtils]: 14: Hoare triple {716#false} ~mode2~0 := 0; {716#false} is VALID [2022-02-20 18:27:45,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {716#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {716#false} is VALID [2022-02-20 18:27:45,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {716#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {716#false} is VALID [2022-02-20 18:27:45,392 INFO L290 TraceCheckUtils]: 17: Hoare triple {716#false} assume !(node3_~m3~0#1 != ~nomsg~0); {716#false} is VALID [2022-02-20 18:27:45,392 INFO L290 TraceCheckUtils]: 18: Hoare triple {716#false} ~mode3~0 := 0; {716#false} is VALID [2022-02-20 18:27:45,392 INFO L290 TraceCheckUtils]: 19: Hoare triple {716#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {716#false} is VALID [2022-02-20 18:27:45,393 INFO L290 TraceCheckUtils]: 20: Hoare triple {716#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {716#false} is VALID [2022-02-20 18:27:45,393 INFO L290 TraceCheckUtils]: 21: Hoare triple {716#false} assume !(node4_~m4~0#1 != ~nomsg~0); {716#false} is VALID [2022-02-20 18:27:45,393 INFO L290 TraceCheckUtils]: 22: Hoare triple {716#false} ~mode4~0 := 0; {716#false} is VALID [2022-02-20 18:27:45,393 INFO L290 TraceCheckUtils]: 23: Hoare triple {716#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {716#false} is VALID [2022-02-20 18:27:45,394 INFO L290 TraceCheckUtils]: 24: Hoare triple {716#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {716#false} is VALID [2022-02-20 18:27:45,394 INFO L290 TraceCheckUtils]: 25: Hoare triple {716#false} assume !(node5_~m5~0#1 != ~nomsg~0); {716#false} is VALID [2022-02-20 18:27:45,394 INFO L290 TraceCheckUtils]: 26: Hoare triple {716#false} ~mode5~0 := 0; {716#false} is VALID [2022-02-20 18:27:45,394 INFO L290 TraceCheckUtils]: 27: Hoare triple {716#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; {716#false} is VALID [2022-02-20 18:27:45,395 INFO L290 TraceCheckUtils]: 28: Hoare triple {716#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {716#false} is VALID [2022-02-20 18:27:45,395 INFO L290 TraceCheckUtils]: 29: Hoare triple {716#false} check_#res#1 := check_~tmp~1#1; {716#false} is VALID [2022-02-20 18:27:45,395 INFO L290 TraceCheckUtils]: 30: Hoare triple {716#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {716#false} is VALID [2022-02-20 18:27:45,395 INFO L290 TraceCheckUtils]: 31: Hoare triple {716#false} assume 0 == assert_~arg#1 % 256; {716#false} is VALID [2022-02-20 18:27:45,396 INFO L290 TraceCheckUtils]: 32: Hoare triple {716#false} assume !false; {716#false} is VALID [2022-02-20 18:27:45,396 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:45,396 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:45,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25617905] [2022-02-20 18:27:45,397 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25617905] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:45,397 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:45,397 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:27:45,398 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877531044] [2022-02-20 18:27:45,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:45,399 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:27:45,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:45,400 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:27:45,424 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:45,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:27:45,424 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:45,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:27:45,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:27:45,426 INFO L87 Difference]: Start difference. First operand 118 states and 198 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:27:45,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:45,829 INFO L93 Difference]: Finished difference Result 202 states and 330 transitions. [2022-02-20 18:27:45,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:27:45,830 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:27:45,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:45,830 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:27:45,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 330 transitions. [2022-02-20 18:27:45,834 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:27:45,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 330 transitions. [2022-02-20 18:27:45,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 330 transitions. [2022-02-20 18:27:46,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 330 edges. 330 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:46,065 INFO L225 Difference]: With dead ends: 202 [2022-02-20 18:27:46,065 INFO L226 Difference]: Without dead ends: 118 [2022-02-20 18:27:46,066 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:27:46,067 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 3 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 749 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:27:46,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 749 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:46,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-02-20 18:27:46,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-02-20 18:27:46,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:46,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 118 states, 117 states have (on average 1.4188034188034189) internal successors, (166), 117 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have 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:46,075 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 118 states, 117 states have (on average 1.4188034188034189) internal successors, (166), 117 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have 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:46,075 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 118 states, 117 states have (on average 1.4188034188034189) internal successors, (166), 117 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have 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:46,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:46,079 INFO L93 Difference]: Finished difference Result 118 states and 166 transitions. [2022-02-20 18:27:46,079 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 166 transitions. [2022-02-20 18:27:46,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:46,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:46,081 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 117 states have (on average 1.4188034188034189) internal successors, (166), 117 states have internal predecessors, (166), 0 states have call successors, (0), 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 118 states. [2022-02-20 18:27:46,081 INFO L87 Difference]: Start difference. First operand has 118 states, 117 states have (on average 1.4188034188034189) internal successors, (166), 117 states have internal predecessors, (166), 0 states have call successors, (0), 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 118 states. [2022-02-20 18:27:46,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:46,085 INFO L93 Difference]: Finished difference Result 118 states and 166 transitions. [2022-02-20 18:27:46,085 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 166 transitions. [2022-02-20 18:27:46,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:46,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:46,086 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:46,086 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:46,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.4188034188034189) internal successors, (166), 117 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have 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:46,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 166 transitions. [2022-02-20 18:27:46,090 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 166 transitions. Word has length 33 [2022-02-20 18:27:46,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:46,090 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 166 transitions. [2022-02-20 18:27:46,091 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:27:46,091 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 166 transitions. [2022-02-20 18:27:46,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:27:46,092 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:46,092 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:27:46,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:27:46,093 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:46,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:46,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1850253404, now seen corresponding path program 1 times [2022-02-20 18:27:46,094 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:46,094 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483673698] [2022-02-20 18:27:46,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:46,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:46,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {1306#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(50, 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; {1306#true} is VALID [2022-02-20 18:27:46,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~r1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~st4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~send4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~id5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~st5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~send5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~alive5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1306#true} is VALID [2022-02-20 18:27:46,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} assume 0 == ~r1~0; {1306#true} is VALID [2022-02-20 18:27:46,225 INFO L290 TraceCheckUtils]: 3: Hoare triple {1306#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {1306#true} is VALID [2022-02-20 18:27:46,226 INFO L290 TraceCheckUtils]: 4: Hoare triple {1306#true} assume ~id1~0 >= 0; {1306#true} is VALID [2022-02-20 18:27:46,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {1306#true} assume 0 == ~st1~0; {1306#true} is VALID [2022-02-20 18:27:46,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {1306#true} assume ~send1~0 == ~id1~0; {1306#true} is VALID [2022-02-20 18:27:46,228 INFO L290 TraceCheckUtils]: 7: Hoare triple {1306#true} assume 0 == ~mode1~0 % 256; {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:46,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:46,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:46,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:46,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:46,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:46,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:46,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:46,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:46,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:46,233 INFO L290 TraceCheckUtils]: 17: Hoare triple {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:46,234 INFO L290 TraceCheckUtils]: 18: Hoare triple {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:46,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:46,235 INFO L290 TraceCheckUtils]: 20: Hoare triple {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:46,236 INFO L290 TraceCheckUtils]: 21: Hoare triple {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:46,236 INFO L290 TraceCheckUtils]: 22: Hoare triple {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:46,236 INFO L290 TraceCheckUtils]: 23: Hoare triple {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:46,237 INFO L290 TraceCheckUtils]: 24: Hoare triple {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:46,238 INFO L290 TraceCheckUtils]: 25: Hoare triple {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:46,238 INFO L290 TraceCheckUtils]: 26: Hoare triple {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:46,239 INFO L290 TraceCheckUtils]: 27: Hoare triple {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:46,239 INFO L290 TraceCheckUtils]: 28: Hoare triple {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:46,240 INFO L290 TraceCheckUtils]: 29: Hoare triple {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:46,240 INFO L290 TraceCheckUtils]: 30: Hoare triple {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:46,241 INFO L290 TraceCheckUtils]: 31: Hoare triple {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:46,241 INFO L290 TraceCheckUtils]: 32: Hoare triple {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:46,243 INFO L290 TraceCheckUtils]: 33: Hoare triple {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:46,244 INFO L290 TraceCheckUtils]: 34: Hoare triple {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:46,245 INFO L290 TraceCheckUtils]: 35: Hoare triple {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:46,245 INFO L290 TraceCheckUtils]: 36: Hoare triple {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:46,246 INFO L290 TraceCheckUtils]: 37: Hoare triple {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:46,246 INFO L290 TraceCheckUtils]: 38: Hoare triple {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:27:46,248 INFO L290 TraceCheckUtils]: 39: Hoare triple {1308#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1307#false} is VALID [2022-02-20 18:27:46,248 INFO L290 TraceCheckUtils]: 40: Hoare triple {1307#false} assume !(node1_~m1~0#1 != ~nomsg~0); {1307#false} is VALID [2022-02-20 18:27:46,250 INFO L290 TraceCheckUtils]: 41: Hoare triple {1307#false} ~mode1~0 := 0; {1307#false} is VALID [2022-02-20 18:27:46,251 INFO L290 TraceCheckUtils]: 42: Hoare triple {1307#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1307#false} is VALID [2022-02-20 18:27:46,251 INFO L290 TraceCheckUtils]: 43: Hoare triple {1307#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1307#false} is VALID [2022-02-20 18:27:46,251 INFO L290 TraceCheckUtils]: 44: Hoare triple {1307#false} assume !(node2_~m2~0#1 != ~nomsg~0); {1307#false} is VALID [2022-02-20 18:27:46,251 INFO L290 TraceCheckUtils]: 45: Hoare triple {1307#false} ~mode2~0 := 0; {1307#false} is VALID [2022-02-20 18:27:46,252 INFO L290 TraceCheckUtils]: 46: Hoare triple {1307#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1307#false} is VALID [2022-02-20 18:27:46,252 INFO L290 TraceCheckUtils]: 47: Hoare triple {1307#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1307#false} is VALID [2022-02-20 18:27:46,252 INFO L290 TraceCheckUtils]: 48: Hoare triple {1307#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1307#false} is VALID [2022-02-20 18:27:46,252 INFO L290 TraceCheckUtils]: 49: Hoare triple {1307#false} ~mode3~0 := 0; {1307#false} is VALID [2022-02-20 18:27:46,252 INFO L290 TraceCheckUtils]: 50: Hoare triple {1307#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1307#false} is VALID [2022-02-20 18:27:46,253 INFO L290 TraceCheckUtils]: 51: Hoare triple {1307#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1307#false} is VALID [2022-02-20 18:27:46,253 INFO L290 TraceCheckUtils]: 52: Hoare triple {1307#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1307#false} is VALID [2022-02-20 18:27:46,253 INFO L290 TraceCheckUtils]: 53: Hoare triple {1307#false} ~mode4~0 := 0; {1307#false} is VALID [2022-02-20 18:27:46,253 INFO L290 TraceCheckUtils]: 54: Hoare triple {1307#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {1307#false} is VALID [2022-02-20 18:27:46,253 INFO L290 TraceCheckUtils]: 55: Hoare triple {1307#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1307#false} is VALID [2022-02-20 18:27:46,254 INFO L290 TraceCheckUtils]: 56: Hoare triple {1307#false} assume !(node5_~m5~0#1 != ~nomsg~0); {1307#false} is VALID [2022-02-20 18:27:46,255 INFO L290 TraceCheckUtils]: 57: Hoare triple {1307#false} ~mode5~0 := 0; {1307#false} is VALID [2022-02-20 18:27:46,255 INFO L290 TraceCheckUtils]: 58: Hoare triple {1307#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; {1307#false} is VALID [2022-02-20 18:27:46,255 INFO L290 TraceCheckUtils]: 59: Hoare triple {1307#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {1307#false} is VALID [2022-02-20 18:27:46,255 INFO L290 TraceCheckUtils]: 60: Hoare triple {1307#false} check_#res#1 := check_~tmp~1#1; {1307#false} is VALID [2022-02-20 18:27:46,268 INFO L290 TraceCheckUtils]: 61: Hoare triple {1307#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {1307#false} is VALID [2022-02-20 18:27:46,268 INFO L290 TraceCheckUtils]: 62: Hoare triple {1307#false} assume 0 == assert_~arg#1 % 256; {1307#false} is VALID [2022-02-20 18:27:46,268 INFO L290 TraceCheckUtils]: 63: Hoare triple {1307#false} assume !false; {1307#false} is VALID [2022-02-20 18:27:46,269 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:46,269 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:46,270 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483673698] [2022-02-20 18:27:46,270 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483673698] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:46,270 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:46,270 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:27:46,270 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745718980] [2022-02-20 18:27:46,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:46,271 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:27:46,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:46,272 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:27:46,321 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:27:46,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:27:46,322 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:46,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:27:46,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:27:46,323 INFO L87 Difference]: Start difference. First operand 118 states and 166 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:27:46,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:46,557 INFO L93 Difference]: Finished difference Result 266 states and 402 transitions. [2022-02-20 18:27:46,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:27:46,557 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:27:46,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:46,558 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:27:46,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2022-02-20 18:27:46,562 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:27:46,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2022-02-20 18:27:46,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 402 transitions. [2022-02-20 18:27:46,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 402 edges. 402 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:46,872 INFO L225 Difference]: With dead ends: 266 [2022-02-20 18:27:46,872 INFO L226 Difference]: Without dead ends: 186 [2022-02-20 18:27:46,873 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:27:46,874 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 116 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 389 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:27:46,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 389 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:46,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-02-20 18:27:46,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2022-02-20 18:27:46,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:46,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 184 states, 183 states have (on average 1.4863387978142077) internal successors, (272), 183 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have 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:46,885 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 184 states, 183 states have (on average 1.4863387978142077) internal successors, (272), 183 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have 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:46,885 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 184 states, 183 states have (on average 1.4863387978142077) internal successors, (272), 183 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have 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:46,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:46,890 INFO L93 Difference]: Finished difference Result 186 states and 273 transitions. [2022-02-20 18:27:46,890 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 273 transitions. [2022-02-20 18:27:46,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:46,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:46,891 INFO L74 IsIncluded]: Start isIncluded. First operand has 184 states, 183 states have (on average 1.4863387978142077) internal successors, (272), 183 states have internal predecessors, (272), 0 states have call successors, (0), 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 186 states. [2022-02-20 18:27:46,892 INFO L87 Difference]: Start difference. First operand has 184 states, 183 states have (on average 1.4863387978142077) internal successors, (272), 183 states have internal predecessors, (272), 0 states have call successors, (0), 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 186 states. [2022-02-20 18:27:46,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:46,897 INFO L93 Difference]: Finished difference Result 186 states and 273 transitions. [2022-02-20 18:27:46,897 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 273 transitions. [2022-02-20 18:27:46,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:46,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:46,897 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:46,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:46,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 1.4863387978142077) internal successors, (272), 183 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have 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:46,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 272 transitions. [2022-02-20 18:27:46,903 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 272 transitions. Word has length 64 [2022-02-20 18:27:46,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:46,903 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 272 transitions. [2022-02-20 18:27:46,904 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:27:46,904 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 272 transitions. [2022-02-20 18:27:46,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:27:46,905 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:46,905 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:27:46,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:27:46,905 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:46,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:46,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1736606100, now seen corresponding path program 1 times [2022-02-20 18:27:46,906 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:46,906 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68066508] [2022-02-20 18:27:46,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:46,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:46,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {2170#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(50, 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; {2170#true} is VALID [2022-02-20 18:27:46,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {2170#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~r1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~st4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~send4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~id5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~st5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~send5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~alive5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {2170#true} is VALID [2022-02-20 18:27:46,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {2170#true} assume 0 == ~r1~0; {2170#true} is VALID [2022-02-20 18:27:46,991 INFO L290 TraceCheckUtils]: 3: Hoare triple {2170#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {2170#true} is VALID [2022-02-20 18:27:46,991 INFO L290 TraceCheckUtils]: 4: Hoare triple {2170#true} assume ~id1~0 >= 0; {2170#true} is VALID [2022-02-20 18:27:46,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {2170#true} assume 0 == ~st1~0; {2170#true} is VALID [2022-02-20 18:27:46,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {2170#true} assume ~send1~0 == ~id1~0; {2170#true} is VALID [2022-02-20 18:27:46,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {2170#true} assume 0 == ~mode1~0 % 256; {2170#true} is VALID [2022-02-20 18:27:46,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {2170#true} assume ~id2~0 >= 0; {2170#true} is VALID [2022-02-20 18:27:46,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {2170#true} assume 0 == ~st2~0; {2170#true} is VALID [2022-02-20 18:27:46,992 INFO L290 TraceCheckUtils]: 10: Hoare triple {2170#true} assume ~send2~0 == ~id2~0; {2170#true} is VALID [2022-02-20 18:27:46,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {2170#true} assume 0 == ~mode2~0 % 256; {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:46,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:46,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:46,994 INFO L290 TraceCheckUtils]: 14: Hoare triple {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:46,995 INFO L290 TraceCheckUtils]: 15: Hoare triple {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:46,995 INFO L290 TraceCheckUtils]: 16: Hoare triple {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:46,996 INFO L290 TraceCheckUtils]: 17: Hoare triple {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:46,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:46,997 INFO L290 TraceCheckUtils]: 19: Hoare triple {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:46,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:46,998 INFO L290 TraceCheckUtils]: 21: Hoare triple {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:46,998 INFO L290 TraceCheckUtils]: 22: Hoare triple {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:46,999 INFO L290 TraceCheckUtils]: 23: Hoare triple {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:46,999 INFO L290 TraceCheckUtils]: 24: Hoare triple {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:46,999 INFO L290 TraceCheckUtils]: 25: Hoare triple {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:47,000 INFO L290 TraceCheckUtils]: 26: Hoare triple {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:47,001 INFO L290 TraceCheckUtils]: 27: Hoare triple {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:47,001 INFO L290 TraceCheckUtils]: 28: Hoare triple {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:47,001 INFO L290 TraceCheckUtils]: 29: Hoare triple {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:47,002 INFO L290 TraceCheckUtils]: 30: Hoare triple {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:47,002 INFO L290 TraceCheckUtils]: 31: Hoare triple {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:47,003 INFO L290 TraceCheckUtils]: 32: Hoare triple {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:47,003 INFO L290 TraceCheckUtils]: 33: Hoare triple {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:47,004 INFO L290 TraceCheckUtils]: 34: Hoare triple {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:47,004 INFO L290 TraceCheckUtils]: 35: Hoare triple {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:47,005 INFO L290 TraceCheckUtils]: 36: Hoare triple {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:47,005 INFO L290 TraceCheckUtils]: 37: Hoare triple {2172#(= (+ (* (- 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; {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:47,006 INFO L290 TraceCheckUtils]: 38: Hoare triple {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:47,006 INFO L290 TraceCheckUtils]: 39: Hoare triple {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:47,007 INFO L290 TraceCheckUtils]: 40: Hoare triple {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~alive1~0 % 256); {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:47,007 INFO L290 TraceCheckUtils]: 41: Hoare triple {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(~send1~0 != ~id1~0); {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:47,008 INFO L290 TraceCheckUtils]: 42: Hoare triple {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:47,008 INFO L290 TraceCheckUtils]: 43: Hoare triple {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {2172#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:47,009 INFO L290 TraceCheckUtils]: 44: Hoare triple {2172#(= (+ (* (- 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; {2171#false} is VALID [2022-02-20 18:27:47,009 INFO L290 TraceCheckUtils]: 45: Hoare triple {2171#false} assume !(node2_~m2~0#1 != ~nomsg~0); {2171#false} is VALID [2022-02-20 18:27:47,009 INFO L290 TraceCheckUtils]: 46: Hoare triple {2171#false} ~mode2~0 := 0; {2171#false} is VALID [2022-02-20 18:27:47,010 INFO L290 TraceCheckUtils]: 47: Hoare triple {2171#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {2171#false} is VALID [2022-02-20 18:27:47,010 INFO L290 TraceCheckUtils]: 48: Hoare triple {2171#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2171#false} is VALID [2022-02-20 18:27:47,010 INFO L290 TraceCheckUtils]: 49: Hoare triple {2171#false} assume !(node3_~m3~0#1 != ~nomsg~0); {2171#false} is VALID [2022-02-20 18:27:47,010 INFO L290 TraceCheckUtils]: 50: Hoare triple {2171#false} ~mode3~0 := 0; {2171#false} is VALID [2022-02-20 18:27:47,010 INFO L290 TraceCheckUtils]: 51: Hoare triple {2171#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {2171#false} is VALID [2022-02-20 18:27:47,010 INFO L290 TraceCheckUtils]: 52: Hoare triple {2171#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2171#false} is VALID [2022-02-20 18:27:47,011 INFO L290 TraceCheckUtils]: 53: Hoare triple {2171#false} assume !(node4_~m4~0#1 != ~nomsg~0); {2171#false} is VALID [2022-02-20 18:27:47,011 INFO L290 TraceCheckUtils]: 54: Hoare triple {2171#false} ~mode4~0 := 0; {2171#false} is VALID [2022-02-20 18:27:47,011 INFO L290 TraceCheckUtils]: 55: Hoare triple {2171#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {2171#false} is VALID [2022-02-20 18:27:47,011 INFO L290 TraceCheckUtils]: 56: Hoare triple {2171#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {2171#false} is VALID [2022-02-20 18:27:47,011 INFO L290 TraceCheckUtils]: 57: Hoare triple {2171#false} assume !(node5_~m5~0#1 != ~nomsg~0); {2171#false} is VALID [2022-02-20 18:27:47,011 INFO L290 TraceCheckUtils]: 58: Hoare triple {2171#false} ~mode5~0 := 0; {2171#false} is VALID [2022-02-20 18:27:47,012 INFO L290 TraceCheckUtils]: 59: Hoare triple {2171#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; {2171#false} is VALID [2022-02-20 18:27:47,012 INFO L290 TraceCheckUtils]: 60: Hoare triple {2171#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {2171#false} is VALID [2022-02-20 18:27:47,012 INFO L290 TraceCheckUtils]: 61: Hoare triple {2171#false} check_#res#1 := check_~tmp~1#1; {2171#false} is VALID [2022-02-20 18:27:47,012 INFO L290 TraceCheckUtils]: 62: Hoare triple {2171#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {2171#false} is VALID [2022-02-20 18:27:47,012 INFO L290 TraceCheckUtils]: 63: Hoare triple {2171#false} assume 0 == assert_~arg#1 % 256; {2171#false} is VALID [2022-02-20 18:27:47,013 INFO L290 TraceCheckUtils]: 64: Hoare triple {2171#false} assume !false; {2171#false} is VALID [2022-02-20 18:27:47,013 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:47,013 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:47,014 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68066508] [2022-02-20 18:27:47,014 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68066508] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:47,014 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:47,014 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:27:47,014 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764885561] [2022-02-20 18:27:47,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:47,015 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:27:47,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:47,015 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:27:47,069 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:27:47,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:27:47,070 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:47,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:27:47,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:27:47,071 INFO L87 Difference]: Start difference. First operand 184 states and 272 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:27:47,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:47,312 INFO L93 Difference]: Finished difference Result 452 states and 700 transitions. [2022-02-20 18:27:47,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:27:47,312 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:27:47,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:47,313 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:27:47,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2022-02-20 18:27:47,316 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:27:47,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2022-02-20 18:27:47,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 402 transitions. [2022-02-20 18:27:47,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 402 edges. 402 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:47,633 INFO L225 Difference]: With dead ends: 452 [2022-02-20 18:27:47,633 INFO L226 Difference]: Without dead ends: 306 [2022-02-20 18:27:47,634 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:27:47,635 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 111 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 380 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:27:47,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 380 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:47,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-02-20 18:27:47,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2022-02-20 18:27:47,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:47,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 306 states. Second operand has 304 states, 303 states have (on average 1.528052805280528) internal successors, (463), 303 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have 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:47,651 INFO L74 IsIncluded]: Start isIncluded. First operand 306 states. Second operand has 304 states, 303 states have (on average 1.528052805280528) internal successors, (463), 303 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have 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:47,652 INFO L87 Difference]: Start difference. First operand 306 states. Second operand has 304 states, 303 states have (on average 1.528052805280528) internal successors, (463), 303 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have 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:47,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:47,661 INFO L93 Difference]: Finished difference Result 306 states and 464 transitions. [2022-02-20 18:27:47,661 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 464 transitions. [2022-02-20 18:27:47,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:47,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:47,662 INFO L74 IsIncluded]: Start isIncluded. First operand has 304 states, 303 states have (on average 1.528052805280528) internal successors, (463), 303 states have internal predecessors, (463), 0 states have call successors, (0), 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 306 states. [2022-02-20 18:27:47,663 INFO L87 Difference]: Start difference. First operand has 304 states, 303 states have (on average 1.528052805280528) internal successors, (463), 303 states have internal predecessors, (463), 0 states have call successors, (0), 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 306 states. [2022-02-20 18:27:47,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:47,672 INFO L93 Difference]: Finished difference Result 306 states and 464 transitions. [2022-02-20 18:27:47,672 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 464 transitions. [2022-02-20 18:27:47,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:47,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:47,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:47,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:47,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 1.528052805280528) internal successors, (463), 303 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have 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:47,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 463 transitions. [2022-02-20 18:27:47,682 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 463 transitions. Word has length 65 [2022-02-20 18:27:47,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:47,683 INFO L470 AbstractCegarLoop]: Abstraction has 304 states and 463 transitions. [2022-02-20 18:27:47,683 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:27:47,683 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 463 transitions. [2022-02-20 18:27:47,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:27:47,684 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:47,684 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:27:47,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:27:47,685 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:47,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:47,685 INFO L85 PathProgramCache]: Analyzing trace with hash 245456436, now seen corresponding path program 1 times [2022-02-20 18:27:47,685 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:47,686 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025137932] [2022-02-20 18:27:47,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:47,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:47,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:47,763 INFO L290 TraceCheckUtils]: 0: Hoare triple {3615#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(50, 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; {3615#true} is VALID [2022-02-20 18:27:47,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {3615#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~r1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~st4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~send4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~id5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~st5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~send5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~alive5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {3615#true} is VALID [2022-02-20 18:27:47,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {3615#true} assume 0 == ~r1~0; {3615#true} is VALID [2022-02-20 18:27:47,764 INFO L290 TraceCheckUtils]: 3: Hoare triple {3615#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {3615#true} is VALID [2022-02-20 18:27:47,764 INFO L290 TraceCheckUtils]: 4: Hoare triple {3615#true} assume ~id1~0 >= 0; {3615#true} is VALID [2022-02-20 18:27:47,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {3615#true} assume 0 == ~st1~0; {3615#true} is VALID [2022-02-20 18:27:47,764 INFO L290 TraceCheckUtils]: 6: Hoare triple {3615#true} assume ~send1~0 == ~id1~0; {3615#true} is VALID [2022-02-20 18:27:47,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {3615#true} assume 0 == ~mode1~0 % 256; {3615#true} is VALID [2022-02-20 18:27:47,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {3615#true} assume ~id2~0 >= 0; {3615#true} is VALID [2022-02-20 18:27:47,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {3615#true} assume 0 == ~st2~0; {3615#true} is VALID [2022-02-20 18:27:47,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {3615#true} assume ~send2~0 == ~id2~0; {3615#true} is VALID [2022-02-20 18:27:47,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {3615#true} assume 0 == ~mode2~0 % 256; {3615#true} is VALID [2022-02-20 18:27:47,765 INFO L290 TraceCheckUtils]: 12: Hoare triple {3615#true} assume ~id3~0 >= 0; {3615#true} is VALID [2022-02-20 18:27:47,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {3615#true} assume 0 == ~st3~0; {3615#true} is VALID [2022-02-20 18:27:47,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {3615#true} assume ~send3~0 == ~id3~0; {3615#true} is VALID [2022-02-20 18:27:47,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {3615#true} assume 0 == ~mode3~0 % 256; {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:47,767 INFO L290 TraceCheckUtils]: 16: Hoare triple {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:47,767 INFO L290 TraceCheckUtils]: 17: Hoare triple {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:47,768 INFO L290 TraceCheckUtils]: 18: Hoare triple {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:47,768 INFO L290 TraceCheckUtils]: 19: Hoare triple {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:47,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:47,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:47,769 INFO L290 TraceCheckUtils]: 22: Hoare triple {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:47,770 INFO L290 TraceCheckUtils]: 23: Hoare triple {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:47,770 INFO L290 TraceCheckUtils]: 24: Hoare triple {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:47,771 INFO L290 TraceCheckUtils]: 25: Hoare triple {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:47,771 INFO L290 TraceCheckUtils]: 26: Hoare triple {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:47,772 INFO L290 TraceCheckUtils]: 27: Hoare triple {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:47,772 INFO L290 TraceCheckUtils]: 28: Hoare triple {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:47,773 INFO L290 TraceCheckUtils]: 29: Hoare triple {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:47,773 INFO L290 TraceCheckUtils]: 30: Hoare triple {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:47,773 INFO L290 TraceCheckUtils]: 31: Hoare triple {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:47,774 INFO L290 TraceCheckUtils]: 32: Hoare triple {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:47,774 INFO L290 TraceCheckUtils]: 33: Hoare triple {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:47,775 INFO L290 TraceCheckUtils]: 34: Hoare triple {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:47,775 INFO L290 TraceCheckUtils]: 35: Hoare triple {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:47,776 INFO L290 TraceCheckUtils]: 36: Hoare triple {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:47,776 INFO L290 TraceCheckUtils]: 37: Hoare triple {3617#(= (+ (* (- 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; {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:47,777 INFO L290 TraceCheckUtils]: 38: Hoare triple {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:47,777 INFO L290 TraceCheckUtils]: 39: Hoare triple {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:47,778 INFO L290 TraceCheckUtils]: 40: Hoare triple {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~alive1~0 % 256); {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:47,778 INFO L290 TraceCheckUtils]: 41: Hoare triple {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send1~0 != ~id1~0); {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:47,778 INFO L290 TraceCheckUtils]: 42: Hoare triple {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:47,779 INFO L290 TraceCheckUtils]: 43: Hoare triple {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:47,779 INFO L290 TraceCheckUtils]: 44: Hoare triple {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:47,780 INFO L290 TraceCheckUtils]: 45: Hoare triple {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~alive2~0 % 256); {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:47,780 INFO L290 TraceCheckUtils]: 46: Hoare triple {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~id2~0); {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:47,781 INFO L290 TraceCheckUtils]: 47: Hoare triple {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:47,781 INFO L290 TraceCheckUtils]: 48: Hoare triple {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {3617#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:47,782 INFO L290 TraceCheckUtils]: 49: Hoare triple {3617#(= (+ (* (- 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; {3616#false} is VALID [2022-02-20 18:27:47,782 INFO L290 TraceCheckUtils]: 50: Hoare triple {3616#false} assume !(node3_~m3~0#1 != ~nomsg~0); {3616#false} is VALID [2022-02-20 18:27:47,782 INFO L290 TraceCheckUtils]: 51: Hoare triple {3616#false} ~mode3~0 := 0; {3616#false} is VALID [2022-02-20 18:27:47,782 INFO L290 TraceCheckUtils]: 52: Hoare triple {3616#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {3616#false} is VALID [2022-02-20 18:27:47,783 INFO L290 TraceCheckUtils]: 53: Hoare triple {3616#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {3616#false} is VALID [2022-02-20 18:27:47,783 INFO L290 TraceCheckUtils]: 54: Hoare triple {3616#false} assume !(node4_~m4~0#1 != ~nomsg~0); {3616#false} is VALID [2022-02-20 18:27:47,783 INFO L290 TraceCheckUtils]: 55: Hoare triple {3616#false} ~mode4~0 := 0; {3616#false} is VALID [2022-02-20 18:27:47,783 INFO L290 TraceCheckUtils]: 56: Hoare triple {3616#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {3616#false} is VALID [2022-02-20 18:27:47,783 INFO L290 TraceCheckUtils]: 57: Hoare triple {3616#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {3616#false} is VALID [2022-02-20 18:27:47,783 INFO L290 TraceCheckUtils]: 58: Hoare triple {3616#false} assume !(node5_~m5~0#1 != ~nomsg~0); {3616#false} is VALID [2022-02-20 18:27:47,784 INFO L290 TraceCheckUtils]: 59: Hoare triple {3616#false} ~mode5~0 := 0; {3616#false} is VALID [2022-02-20 18:27:47,784 INFO L290 TraceCheckUtils]: 60: Hoare triple {3616#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; {3616#false} is VALID [2022-02-20 18:27:47,784 INFO L290 TraceCheckUtils]: 61: Hoare triple {3616#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {3616#false} is VALID [2022-02-20 18:27:47,784 INFO L290 TraceCheckUtils]: 62: Hoare triple {3616#false} check_#res#1 := check_~tmp~1#1; {3616#false} is VALID [2022-02-20 18:27:47,784 INFO L290 TraceCheckUtils]: 63: Hoare triple {3616#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {3616#false} is VALID [2022-02-20 18:27:47,784 INFO L290 TraceCheckUtils]: 64: Hoare triple {3616#false} assume 0 == assert_~arg#1 % 256; {3616#false} is VALID [2022-02-20 18:27:47,785 INFO L290 TraceCheckUtils]: 65: Hoare triple {3616#false} assume !false; {3616#false} is VALID [2022-02-20 18:27:47,785 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:47,785 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:47,786 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025137932] [2022-02-20 18:27:47,786 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025137932] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:47,786 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:47,786 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:27:47,786 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577935429] [2022-02-20 18:27:47,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:47,787 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:27:47,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:47,787 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:27:47,841 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:27:47,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:27:47,842 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:47,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:27:47,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:27:47,843 INFO L87 Difference]: Start difference. First operand 304 states and 463 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:27:48,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:48,113 INFO L93 Difference]: Finished difference Result 788 states and 1233 transitions. [2022-02-20 18:27:48,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:27:48,114 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:27:48,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:48,114 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:27:48,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2022-02-20 18:27:48,117 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:27:48,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2022-02-20 18:27:48,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 402 transitions. [2022-02-20 18:27:48,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 402 edges. 402 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:48,400 INFO L225 Difference]: With dead ends: 788 [2022-02-20 18:27:48,400 INFO L226 Difference]: Without dead ends: 522 [2022-02-20 18:27:48,401 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:27:48,402 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 106 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 371 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:27:48,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 371 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:48,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2022-02-20 18:27:48,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 520. [2022-02-20 18:27:48,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:48,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 522 states. Second operand has 520 states, 519 states have (on average 1.5472061657032756) internal successors, (803), 519 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have 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:48,422 INFO L74 IsIncluded]: Start isIncluded. First operand 522 states. Second operand has 520 states, 519 states have (on average 1.5472061657032756) internal successors, (803), 519 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have 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:48,423 INFO L87 Difference]: Start difference. First operand 522 states. Second operand has 520 states, 519 states have (on average 1.5472061657032756) internal successors, (803), 519 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have 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:48,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:48,438 INFO L93 Difference]: Finished difference Result 522 states and 804 transitions. [2022-02-20 18:27:48,438 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 804 transitions. [2022-02-20 18:27:48,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:48,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:48,440 INFO L74 IsIncluded]: Start isIncluded. First operand has 520 states, 519 states have (on average 1.5472061657032756) internal successors, (803), 519 states have internal predecessors, (803), 0 states have call successors, (0), 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 522 states. [2022-02-20 18:27:48,441 INFO L87 Difference]: Start difference. First operand has 520 states, 519 states have (on average 1.5472061657032756) internal successors, (803), 519 states have internal predecessors, (803), 0 states have call successors, (0), 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 522 states. [2022-02-20 18:27:48,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:48,456 INFO L93 Difference]: Finished difference Result 522 states and 804 transitions. [2022-02-20 18:27:48,457 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 804 transitions. [2022-02-20 18:27:48,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:48,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:48,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:48,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:48,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 519 states have (on average 1.5472061657032756) internal successors, (803), 519 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have 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:48,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 803 transitions. [2022-02-20 18:27:48,475 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 803 transitions. Word has length 66 [2022-02-20 18:27:48,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:48,475 INFO L470 AbstractCegarLoop]: Abstraction has 520 states and 803 transitions. [2022-02-20 18:27:48,475 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:27:48,476 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 803 transitions. [2022-02-20 18:27:48,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:27:48,476 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:48,476 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:27:48,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:27:48,477 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:48,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:48,477 INFO L85 PathProgramCache]: Analyzing trace with hash 2021301796, now seen corresponding path program 1 times [2022-02-20 18:27:48,478 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:48,478 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20307236] [2022-02-20 18:27:48,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:48,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:48,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:48,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {6114#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(50, 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; {6114#true} is VALID [2022-02-20 18:27:48,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {6114#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~r1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~st4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~send4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~id5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~st5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~send5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~alive5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {6114#true} is VALID [2022-02-20 18:27:48,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {6114#true} assume 0 == ~r1~0; {6114#true} is VALID [2022-02-20 18:27:48,575 INFO L290 TraceCheckUtils]: 3: Hoare triple {6114#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {6114#true} is VALID [2022-02-20 18:27:48,575 INFO L290 TraceCheckUtils]: 4: Hoare triple {6114#true} assume ~id1~0 >= 0; {6114#true} is VALID [2022-02-20 18:27:48,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {6114#true} assume 0 == ~st1~0; {6114#true} is VALID [2022-02-20 18:27:48,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {6114#true} assume ~send1~0 == ~id1~0; {6114#true} is VALID [2022-02-20 18:27:48,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {6114#true} assume 0 == ~mode1~0 % 256; {6114#true} is VALID [2022-02-20 18:27:48,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {6114#true} assume ~id2~0 >= 0; {6114#true} is VALID [2022-02-20 18:27:48,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {6114#true} assume 0 == ~st2~0; {6114#true} is VALID [2022-02-20 18:27:48,576 INFO L290 TraceCheckUtils]: 10: Hoare triple {6114#true} assume ~send2~0 == ~id2~0; {6114#true} is VALID [2022-02-20 18:27:48,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {6114#true} assume 0 == ~mode2~0 % 256; {6114#true} is VALID [2022-02-20 18:27:48,577 INFO L290 TraceCheckUtils]: 12: Hoare triple {6114#true} assume ~id3~0 >= 0; {6114#true} is VALID [2022-02-20 18:27:48,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {6114#true} assume 0 == ~st3~0; {6114#true} is VALID [2022-02-20 18:27:48,577 INFO L290 TraceCheckUtils]: 14: Hoare triple {6114#true} assume ~send3~0 == ~id3~0; {6114#true} is VALID [2022-02-20 18:27:48,577 INFO L290 TraceCheckUtils]: 15: Hoare triple {6114#true} assume 0 == ~mode3~0 % 256; {6114#true} is VALID [2022-02-20 18:27:48,578 INFO L290 TraceCheckUtils]: 16: Hoare triple {6114#true} assume ~id4~0 >= 0; {6114#true} is VALID [2022-02-20 18:27:48,578 INFO L290 TraceCheckUtils]: 17: Hoare triple {6114#true} assume 0 == ~st4~0; {6114#true} is VALID [2022-02-20 18:27:48,580 INFO L290 TraceCheckUtils]: 18: Hoare triple {6114#true} assume ~send4~0 == ~id4~0; {6114#true} is VALID [2022-02-20 18:27:48,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {6114#true} assume 0 == ~mode4~0 % 256; {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:48,581 INFO L290 TraceCheckUtils]: 20: Hoare triple {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:48,581 INFO L290 TraceCheckUtils]: 21: Hoare triple {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:48,582 INFO L290 TraceCheckUtils]: 22: Hoare triple {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:48,582 INFO L290 TraceCheckUtils]: 23: Hoare triple {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:48,583 INFO L290 TraceCheckUtils]: 24: Hoare triple {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:48,583 INFO L290 TraceCheckUtils]: 25: Hoare triple {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:48,584 INFO L290 TraceCheckUtils]: 26: Hoare triple {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:48,584 INFO L290 TraceCheckUtils]: 27: Hoare triple {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:48,584 INFO L290 TraceCheckUtils]: 28: Hoare triple {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:48,585 INFO L290 TraceCheckUtils]: 29: Hoare triple {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:48,585 INFO L290 TraceCheckUtils]: 30: Hoare triple {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:48,586 INFO L290 TraceCheckUtils]: 31: Hoare triple {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:48,586 INFO L290 TraceCheckUtils]: 32: Hoare triple {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:48,587 INFO L290 TraceCheckUtils]: 33: Hoare triple {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:48,587 INFO L290 TraceCheckUtils]: 34: Hoare triple {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:48,588 INFO L290 TraceCheckUtils]: 35: Hoare triple {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:48,588 INFO L290 TraceCheckUtils]: 36: Hoare triple {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:48,588 INFO L290 TraceCheckUtils]: 37: Hoare triple {6116#(= (+ (* (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; {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:48,589 INFO L290 TraceCheckUtils]: 38: Hoare triple {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:48,589 INFO L290 TraceCheckUtils]: 39: Hoare triple {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:48,590 INFO L290 TraceCheckUtils]: 40: Hoare triple {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~alive1~0 % 256); {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:48,590 INFO L290 TraceCheckUtils]: 41: Hoare triple {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send1~0 != ~id1~0); {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:48,592 INFO L290 TraceCheckUtils]: 42: Hoare triple {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode1~0 := 1; {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:48,592 INFO L290 TraceCheckUtils]: 43: Hoare triple {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:48,593 INFO L290 TraceCheckUtils]: 44: Hoare triple {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:48,594 INFO L290 TraceCheckUtils]: 45: Hoare triple {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~alive2~0 % 256); {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:48,595 INFO L290 TraceCheckUtils]: 46: Hoare triple {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send2~0 != ~id2~0); {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:48,597 INFO L290 TraceCheckUtils]: 47: Hoare triple {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode2~0 := 1; {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:48,597 INFO L290 TraceCheckUtils]: 48: Hoare triple {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:48,600 INFO L290 TraceCheckUtils]: 49: Hoare triple {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:48,601 INFO L290 TraceCheckUtils]: 50: Hoare triple {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~alive3~0 % 256); {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:48,601 INFO L290 TraceCheckUtils]: 51: Hoare triple {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~id3~0); {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:48,602 INFO L290 TraceCheckUtils]: 52: Hoare triple {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode3~0 := 1; {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:48,603 INFO L290 TraceCheckUtils]: 53: Hoare triple {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {6116#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:48,603 INFO L290 TraceCheckUtils]: 54: Hoare triple {6116#(= (+ (* (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; {6115#false} is VALID [2022-02-20 18:27:48,603 INFO L290 TraceCheckUtils]: 55: Hoare triple {6115#false} assume !(node4_~m4~0#1 != ~nomsg~0); {6115#false} is VALID [2022-02-20 18:27:48,604 INFO L290 TraceCheckUtils]: 56: Hoare triple {6115#false} ~mode4~0 := 0; {6115#false} is VALID [2022-02-20 18:27:48,604 INFO L290 TraceCheckUtils]: 57: Hoare triple {6115#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {6115#false} is VALID [2022-02-20 18:27:48,604 INFO L290 TraceCheckUtils]: 58: Hoare triple {6115#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {6115#false} is VALID [2022-02-20 18:27:48,604 INFO L290 TraceCheckUtils]: 59: Hoare triple {6115#false} assume !(node5_~m5~0#1 != ~nomsg~0); {6115#false} is VALID [2022-02-20 18:27:48,604 INFO L290 TraceCheckUtils]: 60: Hoare triple {6115#false} ~mode5~0 := 0; {6115#false} is VALID [2022-02-20 18:27:48,604 INFO L290 TraceCheckUtils]: 61: Hoare triple {6115#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; {6115#false} is VALID [2022-02-20 18:27:48,605 INFO L290 TraceCheckUtils]: 62: Hoare triple {6115#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {6115#false} is VALID [2022-02-20 18:27:48,605 INFO L290 TraceCheckUtils]: 63: Hoare triple {6115#false} check_#res#1 := check_~tmp~1#1; {6115#false} is VALID [2022-02-20 18:27:48,605 INFO L290 TraceCheckUtils]: 64: Hoare triple {6115#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {6115#false} is VALID [2022-02-20 18:27:48,605 INFO L290 TraceCheckUtils]: 65: Hoare triple {6115#false} assume 0 == assert_~arg#1 % 256; {6115#false} is VALID [2022-02-20 18:27:48,605 INFO L290 TraceCheckUtils]: 66: Hoare triple {6115#false} assume !false; {6115#false} is VALID [2022-02-20 18:27:48,606 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:48,606 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:48,607 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20307236] [2022-02-20 18:27:48,607 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20307236] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:48,607 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:48,607 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:27:48,607 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500837233] [2022-02-20 18:27:48,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:48,608 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:27:48,608 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:48,609 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:27:48,659 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:27:48,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:27:48,660 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:48,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:27:48,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:27:48,661 INFO L87 Difference]: Start difference. First operand 520 states and 803 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:27:48,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:48,994 INFO L93 Difference]: Finished difference Result 1388 states and 2173 transitions. [2022-02-20 18:27:48,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:27:48,995 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:27:48,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:48,995 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:27:48,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2022-02-20 18:27:48,998 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:27:49,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2022-02-20 18:27:49,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 402 transitions. [2022-02-20 18:27:49,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 402 edges. 402 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:49,323 INFO L225 Difference]: With dead ends: 1388 [2022-02-20 18:27:49,324 INFO L226 Difference]: Without dead ends: 906 [2022-02-20 18:27:49,324 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:27:49,325 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 101 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 362 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:27:49,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 362 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:49,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2022-02-20 18:27:49,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 904. [2022-02-20 18:27:49,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:49,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 906 states. Second operand has 904 states, 903 states have (on average 1.5492801771871538) internal successors, (1399), 903 states have internal predecessors, (1399), 0 states have call successors, (0), 0 states have 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:49,353 INFO L74 IsIncluded]: Start isIncluded. First operand 906 states. Second operand has 904 states, 903 states have (on average 1.5492801771871538) internal successors, (1399), 903 states have internal predecessors, (1399), 0 states have call successors, (0), 0 states have 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:49,354 INFO L87 Difference]: Start difference. First operand 906 states. Second operand has 904 states, 903 states have (on average 1.5492801771871538) internal successors, (1399), 903 states have internal predecessors, (1399), 0 states have call successors, (0), 0 states have 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:49,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:49,392 INFO L93 Difference]: Finished difference Result 906 states and 1400 transitions. [2022-02-20 18:27:49,393 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1400 transitions. [2022-02-20 18:27:49,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:49,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:49,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 904 states, 903 states have (on average 1.5492801771871538) internal successors, (1399), 903 states have internal predecessors, (1399), 0 states have call successors, (0), 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 906 states. [2022-02-20 18:27:49,397 INFO L87 Difference]: Start difference. First operand has 904 states, 903 states have (on average 1.5492801771871538) internal successors, (1399), 903 states have internal predecessors, (1399), 0 states have call successors, (0), 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 906 states. [2022-02-20 18:27:49,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:49,436 INFO L93 Difference]: Finished difference Result 906 states and 1400 transitions. [2022-02-20 18:27:49,436 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1400 transitions. [2022-02-20 18:27:49,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:49,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:49,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:49,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:49,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 903 states have (on average 1.5492801771871538) internal successors, (1399), 903 states have internal predecessors, (1399), 0 states have call successors, (0), 0 states have 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:49,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1399 transitions. [2022-02-20 18:27:49,494 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1399 transitions. Word has length 67 [2022-02-20 18:27:49,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:49,495 INFO L470 AbstractCegarLoop]: Abstraction has 904 states and 1399 transitions. [2022-02-20 18:27:49,495 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:27:49,495 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1399 transitions. [2022-02-20 18:27:49,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 18:27:49,496 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:49,496 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:27:49,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:27:49,496 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:49,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:49,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1960792892, now seen corresponding path program 1 times [2022-02-20 18:27:49,497 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:49,497 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035825090] [2022-02-20 18:27:49,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:49,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:49,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:49,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {10505#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(50, 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; {10505#true} is VALID [2022-02-20 18:27:49,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {10505#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~r1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~st4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~send4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~id5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~st5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~send5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~alive5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {10505#true} is VALID [2022-02-20 18:27:49,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {10505#true} assume 0 == ~r1~0; {10505#true} is VALID [2022-02-20 18:27:49,589 INFO L290 TraceCheckUtils]: 3: Hoare triple {10505#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {10505#true} is VALID [2022-02-20 18:27:49,589 INFO L290 TraceCheckUtils]: 4: Hoare triple {10505#true} assume ~id1~0 >= 0; {10505#true} is VALID [2022-02-20 18:27:49,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {10505#true} assume 0 == ~st1~0; {10505#true} is VALID [2022-02-20 18:27:49,590 INFO L290 TraceCheckUtils]: 6: Hoare triple {10505#true} assume ~send1~0 == ~id1~0; {10505#true} is VALID [2022-02-20 18:27:49,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {10505#true} assume 0 == ~mode1~0 % 256; {10505#true} is VALID [2022-02-20 18:27:49,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {10505#true} assume ~id2~0 >= 0; {10505#true} is VALID [2022-02-20 18:27:49,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {10505#true} assume 0 == ~st2~0; {10505#true} is VALID [2022-02-20 18:27:49,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {10505#true} assume ~send2~0 == ~id2~0; {10505#true} is VALID [2022-02-20 18:27:49,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {10505#true} assume 0 == ~mode2~0 % 256; {10505#true} is VALID [2022-02-20 18:27:49,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {10505#true} assume ~id3~0 >= 0; {10505#true} is VALID [2022-02-20 18:27:49,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {10505#true} assume 0 == ~st3~0; {10505#true} is VALID [2022-02-20 18:27:49,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {10505#true} assume ~send3~0 == ~id3~0; {10505#true} is VALID [2022-02-20 18:27:49,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {10505#true} assume 0 == ~mode3~0 % 256; {10505#true} is VALID [2022-02-20 18:27:49,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {10505#true} assume ~id4~0 >= 0; {10505#true} is VALID [2022-02-20 18:27:49,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {10505#true} assume 0 == ~st4~0; {10505#true} is VALID [2022-02-20 18:27:49,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {10505#true} assume ~send4~0 == ~id4~0; {10505#true} is VALID [2022-02-20 18:27:49,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {10505#true} assume 0 == ~mode4~0 % 256; {10505#true} is VALID [2022-02-20 18:27:49,592 INFO L290 TraceCheckUtils]: 20: Hoare triple {10505#true} assume ~id5~0 >= 0; {10505#true} is VALID [2022-02-20 18:27:49,592 INFO L290 TraceCheckUtils]: 21: Hoare triple {10505#true} assume 0 == ~st5~0; {10505#true} is VALID [2022-02-20 18:27:49,593 INFO L290 TraceCheckUtils]: 22: Hoare triple {10505#true} assume ~send5~0 == ~id5~0; {10505#true} is VALID [2022-02-20 18:27:49,593 INFO L290 TraceCheckUtils]: 23: Hoare triple {10505#true} assume 0 == ~mode5~0 % 256; {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:49,594 INFO L290 TraceCheckUtils]: 24: Hoare triple {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:49,594 INFO L290 TraceCheckUtils]: 25: Hoare triple {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:49,595 INFO L290 TraceCheckUtils]: 26: Hoare triple {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:49,595 INFO L290 TraceCheckUtils]: 27: Hoare triple {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:49,596 INFO L290 TraceCheckUtils]: 28: Hoare triple {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:49,596 INFO L290 TraceCheckUtils]: 29: Hoare triple {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:49,597 INFO L290 TraceCheckUtils]: 30: Hoare triple {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:49,597 INFO L290 TraceCheckUtils]: 31: Hoare triple {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:49,598 INFO L290 TraceCheckUtils]: 32: Hoare triple {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:49,598 INFO L290 TraceCheckUtils]: 33: Hoare triple {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:49,598 INFO L290 TraceCheckUtils]: 34: Hoare triple {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:49,599 INFO L290 TraceCheckUtils]: 35: Hoare triple {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:49,599 INFO L290 TraceCheckUtils]: 36: Hoare triple {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:49,600 INFO L290 TraceCheckUtils]: 37: Hoare triple {10507#(= (+ (* (- 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; {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:49,600 INFO L290 TraceCheckUtils]: 38: Hoare triple {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:49,605 INFO L290 TraceCheckUtils]: 39: Hoare triple {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:49,606 INFO L290 TraceCheckUtils]: 40: Hoare triple {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~alive1~0 % 256); {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:49,607 INFO L290 TraceCheckUtils]: 41: Hoare triple {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send1~0 != ~id1~0); {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:49,608 INFO L290 TraceCheckUtils]: 42: Hoare triple {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode1~0 := 1; {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:49,608 INFO L290 TraceCheckUtils]: 43: Hoare triple {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:49,612 INFO L290 TraceCheckUtils]: 44: Hoare triple {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:49,614 INFO L290 TraceCheckUtils]: 45: Hoare triple {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~alive2~0 % 256); {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:49,615 INFO L290 TraceCheckUtils]: 46: Hoare triple {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send2~0 != ~id2~0); {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:49,615 INFO L290 TraceCheckUtils]: 47: Hoare triple {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode2~0 := 1; {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:49,616 INFO L290 TraceCheckUtils]: 48: Hoare triple {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:49,616 INFO L290 TraceCheckUtils]: 49: Hoare triple {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:49,618 INFO L290 TraceCheckUtils]: 50: Hoare triple {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~alive3~0 % 256); {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:49,618 INFO L290 TraceCheckUtils]: 51: Hoare triple {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send3~0 != ~id3~0); {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:49,618 INFO L290 TraceCheckUtils]: 52: Hoare triple {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode3~0 := 1; {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:49,619 INFO L290 TraceCheckUtils]: 53: Hoare triple {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:49,622 INFO L290 TraceCheckUtils]: 54: Hoare triple {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:49,624 INFO L290 TraceCheckUtils]: 55: Hoare triple {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~alive4~0 % 256); {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:49,625 INFO L290 TraceCheckUtils]: 56: Hoare triple {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send4~0 != ~id4~0); {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:49,625 INFO L290 TraceCheckUtils]: 57: Hoare triple {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode4~0 := 1; {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:49,625 INFO L290 TraceCheckUtils]: 58: Hoare triple {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {10507#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:49,626 INFO L290 TraceCheckUtils]: 59: Hoare triple {10507#(= (+ (* (- 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; {10506#false} is VALID [2022-02-20 18:27:49,626 INFO L290 TraceCheckUtils]: 60: Hoare triple {10506#false} assume !(node5_~m5~0#1 != ~nomsg~0); {10506#false} is VALID [2022-02-20 18:27:49,626 INFO L290 TraceCheckUtils]: 61: Hoare triple {10506#false} ~mode5~0 := 0; {10506#false} is VALID [2022-02-20 18:27:49,626 INFO L290 TraceCheckUtils]: 62: Hoare triple {10506#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; {10506#false} is VALID [2022-02-20 18:27:49,627 INFO L290 TraceCheckUtils]: 63: Hoare triple {10506#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {10506#false} is VALID [2022-02-20 18:27:49,627 INFO L290 TraceCheckUtils]: 64: Hoare triple {10506#false} check_#res#1 := check_~tmp~1#1; {10506#false} is VALID [2022-02-20 18:27:49,627 INFO L290 TraceCheckUtils]: 65: Hoare triple {10506#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {10506#false} is VALID [2022-02-20 18:27:49,627 INFO L290 TraceCheckUtils]: 66: Hoare triple {10506#false} assume 0 == assert_~arg#1 % 256; {10506#false} is VALID [2022-02-20 18:27:49,627 INFO L290 TraceCheckUtils]: 67: Hoare triple {10506#false} assume !false; {10506#false} is VALID [2022-02-20 18:27:49,628 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:49,628 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:49,628 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035825090] [2022-02-20 18:27:49,628 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035825090] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:49,628 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:49,628 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:27:49,629 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47348672] [2022-02-20 18:27:49,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:49,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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:27:49,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:49,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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:27:49,679 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:27:49,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:27:49,679 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:49,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:27:49,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:27:49,680 INFO L87 Difference]: Start difference. First operand 904 states and 1399 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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:27:50,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:50,220 INFO L93 Difference]: Finished difference Result 2444 states and 3801 transitions. [2022-02-20 18:27:50,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:27:50,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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:27:50,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:50,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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:27:50,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2022-02-20 18:27:50,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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:27:50,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2022-02-20 18:27:50,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 402 transitions. [2022-02-20 18:27:50,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 402 edges. 402 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:50,633 INFO L225 Difference]: With dead ends: 2444 [2022-02-20 18:27:50,633 INFO L226 Difference]: Without dead ends: 1578 [2022-02-20 18:27:50,635 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:27:50,635 INFO L933 BasicCegarLoop]: 218 mSDtfsCounter, 96 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 353 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:27:50,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 353 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:50,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2022-02-20 18:27:50,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1576. [2022-02-20 18:27:50,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:50,686 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1578 states. Second operand has 1576 states, 1575 states have (on average 1.5384126984126985) internal successors, (2423), 1575 states have internal predecessors, (2423), 0 states have call successors, (0), 0 states have 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:50,688 INFO L74 IsIncluded]: Start isIncluded. First operand 1578 states. Second operand has 1576 states, 1575 states have (on average 1.5384126984126985) internal successors, (2423), 1575 states have internal predecessors, (2423), 0 states have call successors, (0), 0 states have 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:50,690 INFO L87 Difference]: Start difference. First operand 1578 states. Second operand has 1576 states, 1575 states have (on average 1.5384126984126985) internal successors, (2423), 1575 states have internal predecessors, (2423), 0 states have call successors, (0), 0 states have 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:50,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:50,801 INFO L93 Difference]: Finished difference Result 1578 states and 2424 transitions. [2022-02-20 18:27:50,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2424 transitions. [2022-02-20 18:27:50,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:50,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:50,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 1576 states, 1575 states have (on average 1.5384126984126985) internal successors, (2423), 1575 states have internal predecessors, (2423), 0 states have call successors, (0), 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 1578 states. [2022-02-20 18:27:50,808 INFO L87 Difference]: Start difference. First operand has 1576 states, 1575 states have (on average 1.5384126984126985) internal successors, (2423), 1575 states have internal predecessors, (2423), 0 states have call successors, (0), 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 1578 states. [2022-02-20 18:27:50,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:50,928 INFO L93 Difference]: Finished difference Result 1578 states and 2424 transitions. [2022-02-20 18:27:50,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2424 transitions. [2022-02-20 18:27:50,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:50,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:50,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:50,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:50,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1575 states have (on average 1.5384126984126985) internal successors, (2423), 1575 states have internal predecessors, (2423), 0 states have call successors, (0), 0 states have 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:51,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2423 transitions. [2022-02-20 18:27:51,052 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2423 transitions. Word has length 68 [2022-02-20 18:27:51,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:51,052 INFO L470 AbstractCegarLoop]: Abstraction has 1576 states and 2423 transitions. [2022-02-20 18:27:51,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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:27:51,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2423 transitions. [2022-02-20 18:27:51,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 18:27:51,053 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:51,053 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:27:51,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:27:51,053 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:51,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:51,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1083012428, now seen corresponding path program 1 times [2022-02-20 18:27:51,056 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:51,056 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528760900] [2022-02-20 18:27:51,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:51,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:51,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {18248#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(50, 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; {18248#true} is VALID [2022-02-20 18:27:51,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {18248#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~r1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~st4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~send4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~id5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~st5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~send5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~alive5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {18248#true} is VALID [2022-02-20 18:27:51,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {18248#true} assume 0 == ~r1~0; {18248#true} is VALID [2022-02-20 18:27:51,145 INFO L290 TraceCheckUtils]: 3: Hoare triple {18248#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {18248#true} is VALID [2022-02-20 18:27:51,145 INFO L290 TraceCheckUtils]: 4: Hoare triple {18248#true} assume ~id1~0 >= 0; {18248#true} is VALID [2022-02-20 18:27:51,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {18248#true} assume 0 == ~st1~0; {18250#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:51,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {18250#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {18250#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:51,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {18250#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {18250#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:51,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {18250#(<= ~st1~0 0)} assume ~id2~0 >= 0; {18250#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:51,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {18250#(<= ~st1~0 0)} assume 0 == ~st2~0; {18251#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {18251#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {18251#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {18251#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {18251#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,148 INFO L290 TraceCheckUtils]: 12: Hoare triple {18251#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {18251#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {18251#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {18252#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,149 INFO L290 TraceCheckUtils]: 14: Hoare triple {18252#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {18252#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,149 INFO L290 TraceCheckUtils]: 15: Hoare triple {18252#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {18252#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {18252#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {18252#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {18252#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {18253#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {18253#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {18253#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {18253#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {18253#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {18253#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {18253#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,152 INFO L290 TraceCheckUtils]: 21: Hoare triple {18253#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,152 INFO L290 TraceCheckUtils]: 22: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,153 INFO L290 TraceCheckUtils]: 23: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,153 INFO L290 TraceCheckUtils]: 25: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,154 INFO L290 TraceCheckUtils]: 26: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,154 INFO L290 TraceCheckUtils]: 27: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,155 INFO L290 TraceCheckUtils]: 28: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,155 INFO L290 TraceCheckUtils]: 29: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,156 INFO L290 TraceCheckUtils]: 30: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,156 INFO L290 TraceCheckUtils]: 31: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,156 INFO L290 TraceCheckUtils]: 32: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,157 INFO L290 TraceCheckUtils]: 33: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,157 INFO L290 TraceCheckUtils]: 34: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,158 INFO L290 TraceCheckUtils]: 35: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,158 INFO L290 TraceCheckUtils]: 36: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,159 INFO L290 TraceCheckUtils]: 37: Hoare triple {18254#(<= (+ ~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; {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,159 INFO L290 TraceCheckUtils]: 38: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,160 INFO L290 TraceCheckUtils]: 39: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,160 INFO L290 TraceCheckUtils]: 40: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive1~0 % 256); {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,160 INFO L290 TraceCheckUtils]: 41: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send1~0 != ~id1~0); {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,161 INFO L290 TraceCheckUtils]: 42: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,161 INFO L290 TraceCheckUtils]: 43: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,162 INFO L290 TraceCheckUtils]: 44: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,162 INFO L290 TraceCheckUtils]: 45: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive2~0 % 256); {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,162 INFO L290 TraceCheckUtils]: 46: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,163 INFO L290 TraceCheckUtils]: 47: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,163 INFO L290 TraceCheckUtils]: 48: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,164 INFO L290 TraceCheckUtils]: 49: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,164 INFO L290 TraceCheckUtils]: 50: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive3~0 % 256); {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,164 INFO L290 TraceCheckUtils]: 51: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,165 INFO L290 TraceCheckUtils]: 52: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,165 INFO L290 TraceCheckUtils]: 53: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,166 INFO L290 TraceCheckUtils]: 54: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,166 INFO L290 TraceCheckUtils]: 55: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive4~0 % 256); {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,166 INFO L290 TraceCheckUtils]: 56: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~id4~0); {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,167 INFO L290 TraceCheckUtils]: 57: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode4~0 := 1; {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,167 INFO L290 TraceCheckUtils]: 58: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,168 INFO L290 TraceCheckUtils]: 59: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode5~0 % 256); {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,168 INFO L290 TraceCheckUtils]: 60: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive5~0 % 256); {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,168 INFO L290 TraceCheckUtils]: 61: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send5~0 != ~id5~0); {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,169 INFO L290 TraceCheckUtils]: 62: Hoare triple {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode5~0 := 1; {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,169 INFO L290 TraceCheckUtils]: 63: Hoare triple {18254#(<= (+ ~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; {18254#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,170 INFO L290 TraceCheckUtils]: 64: Hoare triple {18254#(<= (+ ~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; {18249#false} is VALID [2022-02-20 18:27:51,170 INFO L290 TraceCheckUtils]: 65: Hoare triple {18249#false} check_#res#1 := check_~tmp~1#1; {18249#false} is VALID [2022-02-20 18:27:51,170 INFO L290 TraceCheckUtils]: 66: Hoare triple {18249#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {18249#false} is VALID [2022-02-20 18:27:51,170 INFO L290 TraceCheckUtils]: 67: Hoare triple {18249#false} assume 0 == assert_~arg#1 % 256; {18249#false} is VALID [2022-02-20 18:27:51,170 INFO L290 TraceCheckUtils]: 68: Hoare triple {18249#false} assume !false; {18249#false} is VALID [2022-02-20 18:27:51,171 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:51,171 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:51,171 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528760900] [2022-02-20 18:27:51,171 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528760900] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:51,172 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:51,172 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:27:51,172 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029985203] [2022-02-20 18:27:51,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:51,172 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:27:51,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:51,173 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:27:51,228 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:27:51,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:27:51,228 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:51,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:27:51,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:27:51,229 INFO L87 Difference]: Start difference. First operand 1576 states and 2423 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:27:57,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:57,825 INFO L93 Difference]: Finished difference Result 10804 states and 16733 transitions. [2022-02-20 18:27:57,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:27:57,825 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:27:57,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:57,825 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:27:57,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 934 transitions. [2022-02-20 18:27:57,830 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:27:57,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 934 transitions. [2022-02-20 18:27:57,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 934 transitions. [2022-02-20 18:27:58,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 934 edges. 934 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:01,000 INFO L225 Difference]: With dead ends: 10804 [2022-02-20 18:28:01,000 INFO L226 Difference]: Without dead ends: 9266 [2022-02-20 18:28:01,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:28:01,004 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 1313 mSDsluCounter, 1591 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1313 SdHoareTripleChecker+Valid, 1755 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:28:01,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1313 Valid, 1755 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:28:01,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9266 states. [2022-02-20 18:28:02,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9266 to 3112. [2022-02-20 18:28:02,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:02,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9266 states. Second operand has 3112 states, 3111 states have (on average 1.5245901639344261) internal successors, (4743), 3111 states have internal predecessors, (4743), 0 states have call successors, (0), 0 states have 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,179 INFO L74 IsIncluded]: Start isIncluded. First operand 9266 states. Second operand has 3112 states, 3111 states have (on average 1.5245901639344261) internal successors, (4743), 3111 states have internal predecessors, (4743), 0 states have call successors, (0), 0 states have 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,184 INFO L87 Difference]: Start difference. First operand 9266 states. Second operand has 3112 states, 3111 states have (on average 1.5245901639344261) internal successors, (4743), 3111 states have internal predecessors, (4743), 0 states have call successors, (0), 0 states have 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,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:04,454 INFO L93 Difference]: Finished difference Result 9266 states and 14284 transitions. [2022-02-20 18:28:04,454 INFO L276 IsEmpty]: Start isEmpty. Operand 9266 states and 14284 transitions. [2022-02-20 18:28:04,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:04,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:04,475 INFO L74 IsIncluded]: Start isIncluded. First operand has 3112 states, 3111 states have (on average 1.5245901639344261) internal successors, (4743), 3111 states have internal predecessors, (4743), 0 states have call successors, (0), 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 9266 states. [2022-02-20 18:28:04,478 INFO L87 Difference]: Start difference. First operand has 3112 states, 3111 states have (on average 1.5245901639344261) internal successors, (4743), 3111 states have internal predecessors, (4743), 0 states have call successors, (0), 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 9266 states. [2022-02-20 18:28:06,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:06,648 INFO L93 Difference]: Finished difference Result 9266 states and 14284 transitions. [2022-02-20 18:28:06,648 INFO L276 IsEmpty]: Start isEmpty. Operand 9266 states and 14284 transitions. [2022-02-20 18:28:06,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:06,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:06,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:06,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:06,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3112 states, 3111 states have (on average 1.5245901639344261) internal successors, (4743), 3111 states have internal predecessors, (4743), 0 states have call successors, (0), 0 states have 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:07,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 3112 states and 4743 transitions. [2022-02-20 18:28:07,028 INFO L78 Accepts]: Start accepts. Automaton has 3112 states and 4743 transitions. Word has length 69 [2022-02-20 18:28:07,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:07,028 INFO L470 AbstractCegarLoop]: Abstraction has 3112 states and 4743 transitions. [2022-02-20 18:28:07,029 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:07,029 INFO L276 IsEmpty]: Start isEmpty. Operand 3112 states and 4743 transitions. [2022-02-20 18:28:07,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 18:28:07,029 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:07,029 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:07,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:28:07,030 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:07,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:07,030 INFO L85 PathProgramCache]: Analyzing trace with hash 403029886, now seen corresponding path program 1 times [2022-02-20 18:28:07,031 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:07,031 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550866168] [2022-02-20 18:28:07,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:07,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:07,163 INFO L290 TraceCheckUtils]: 0: Hoare triple {52732#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(50, 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; {52732#true} is VALID [2022-02-20 18:28:07,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {52732#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~r1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~id2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~st2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~send2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~id3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~send3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~id4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~st4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~send4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~id5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~st5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~send5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~alive5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {52732#true} is VALID [2022-02-20 18:28:07,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {52732#true} assume 0 == ~r1~0; {52732#true} is VALID [2022-02-20 18:28:07,164 INFO L290 TraceCheckUtils]: 3: Hoare triple {52732#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {52734#(<= (+ (* (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:07,165 INFO L290 TraceCheckUtils]: 4: Hoare triple {52734#(<= (+ (* (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; {52734#(<= (+ (* (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:07,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {52734#(<= (+ (* (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; {52734#(<= (+ (* (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:07,166 INFO L290 TraceCheckUtils]: 6: Hoare triple {52734#(<= (+ (* (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; {52734#(<= (+ (* (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:07,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {52734#(<= (+ (* (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; {52734#(<= (+ (* (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:07,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {52734#(<= (+ (* (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; {52734#(<= (+ (* (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:07,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {52734#(<= (+ (* (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; {52734#(<= (+ (* (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:07,168 INFO L290 TraceCheckUtils]: 10: Hoare triple {52734#(<= (+ (* (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; {52734#(<= (+ (* (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:07,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {52734#(<= (+ (* (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; {52734#(<= (+ (* (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:07,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {52734#(<= (+ (* (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; {52734#(<= (+ (* (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:07,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {52734#(<= (+ (* (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; {52734#(<= (+ (* (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:07,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {52734#(<= (+ (* (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; {52734#(<= (+ (* (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:07,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {52734#(<= (+ (* (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; {52734#(<= (+ (* (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:07,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {52734#(<= (+ (* (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; {52734#(<= (+ (* (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:07,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {52734#(<= (+ (* (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; {52734#(<= (+ (* (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:07,173 INFO L290 TraceCheckUtils]: 18: Hoare triple {52734#(<= (+ (* (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; {52734#(<= (+ (* (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:07,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {52734#(<= (+ (* (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; {52734#(<= (+ (* (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:07,174 INFO L290 TraceCheckUtils]: 20: Hoare triple {52734#(<= (+ (* (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; {52734#(<= (+ (* (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:07,175 INFO L290 TraceCheckUtils]: 21: Hoare triple {52734#(<= (+ (* (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; {52734#(<= (+ (* (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:07,175 INFO L290 TraceCheckUtils]: 22: Hoare triple {52734#(<= (+ (* (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; {52734#(<= (+ (* (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:07,176 INFO L290 TraceCheckUtils]: 23: Hoare triple {52734#(<= (+ (* (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; {52734#(<= (+ (* (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:07,176 INFO L290 TraceCheckUtils]: 24: Hoare triple {52734#(<= (+ (* (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; {52734#(<= (+ (* (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:07,177 INFO L290 TraceCheckUtils]: 25: Hoare triple {52734#(<= (+ (* (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; {52734#(<= (+ (* (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:07,178 INFO L290 TraceCheckUtils]: 26: Hoare triple {52734#(<= (+ (* (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; {52734#(<= (+ (* (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:07,178 INFO L290 TraceCheckUtils]: 27: Hoare triple {52734#(<= (+ (* (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; {52734#(<= (+ (* (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:07,179 INFO L290 TraceCheckUtils]: 28: Hoare triple {52734#(<= (+ (* (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; {52734#(<= (+ (* (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:07,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {52734#(<= (+ (* (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; {52734#(<= (+ (* (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:07,180 INFO L290 TraceCheckUtils]: 30: Hoare triple {52734#(<= (+ (* (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; {52734#(<= (+ (* (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:07,181 INFO L290 TraceCheckUtils]: 31: Hoare triple {52734#(<= (+ (* (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; {52734#(<= (+ (* (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:07,182 INFO L290 TraceCheckUtils]: 32: Hoare triple {52734#(<= (+ (* (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; {52734#(<= (+ (* (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:07,183 INFO L290 TraceCheckUtils]: 33: Hoare triple {52734#(<= (+ (* (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; {52734#(<= (+ (* (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:07,184 INFO L290 TraceCheckUtils]: 34: Hoare triple {52734#(<= (+ (* (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; {52734#(<= (+ (* (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:07,184 INFO L290 TraceCheckUtils]: 35: Hoare triple {52734#(<= (+ (* (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~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; {52734#(<= (+ (* (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:07,185 INFO L290 TraceCheckUtils]: 36: Hoare triple {52734#(<= (+ (* (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); {52734#(<= (+ (* (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:07,186 INFO L290 TraceCheckUtils]: 37: Hoare triple {52734#(<= (+ (* (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; {52734#(<= (+ (* (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:07,186 INFO L290 TraceCheckUtils]: 38: Hoare triple {52734#(<= (+ (* (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 !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {52734#(<= (+ (* (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:07,187 INFO L290 TraceCheckUtils]: 39: Hoare triple {52734#(<= (+ (* (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); {52734#(<= (+ (* (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:07,188 INFO L290 TraceCheckUtils]: 40: Hoare triple {52734#(<= (+ (* (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); {52735#(<= (+ (* (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:07,188 INFO L290 TraceCheckUtils]: 41: Hoare triple {52735#(<= (+ (* (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 !(~send1~0 != ~id1~0); {52735#(<= (+ (* (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:07,189 INFO L290 TraceCheckUtils]: 42: Hoare triple {52735#(<= (+ (* (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; {52735#(<= (+ (* (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:07,189 INFO L290 TraceCheckUtils]: 43: Hoare triple {52735#(<= (+ (* (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~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {52735#(<= (+ (* (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:07,190 INFO L290 TraceCheckUtils]: 44: Hoare triple {52735#(<= (+ (* (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); {52735#(<= (+ (* (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:07,191 INFO L290 TraceCheckUtils]: 45: Hoare triple {52735#(<= (+ (* (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); {52736#(<= (+ (* (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:07,193 INFO L290 TraceCheckUtils]: 46: Hoare triple {52736#(<= (+ (* (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); {52736#(<= (+ (* (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:07,194 INFO L290 TraceCheckUtils]: 47: Hoare triple {52736#(<= (+ (* (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; {52736#(<= (+ (* (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:07,194 INFO L290 TraceCheckUtils]: 48: Hoare triple {52736#(<= (+ (* (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~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {52736#(<= (+ (* (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:07,195 INFO L290 TraceCheckUtils]: 49: Hoare triple {52736#(<= (+ (* (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); {52736#(<= (+ (* (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:07,195 INFO L290 TraceCheckUtils]: 50: Hoare triple {52736#(<= (+ (* (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); {52737#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:28:07,196 INFO L290 TraceCheckUtils]: 51: Hoare triple {52737#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} assume !(~send3~0 != ~id3~0); {52737#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:28:07,196 INFO L290 TraceCheckUtils]: 52: Hoare triple {52737#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} ~mode3~0 := 1; {52737#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:28:07,196 INFO L290 TraceCheckUtils]: 53: Hoare triple {52737#(<= (+ (* 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~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {52737#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:28:07,197 INFO L290 TraceCheckUtils]: 54: Hoare triple {52737#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} assume !(0 != ~mode4~0 % 256); {52737#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:28:07,197 INFO L290 TraceCheckUtils]: 55: Hoare triple {52737#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} assume !(0 != ~alive4~0 % 256); {52738#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID [2022-02-20 18:28:07,198 INFO L290 TraceCheckUtils]: 56: Hoare triple {52738#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} assume !(~send4~0 != ~id4~0); {52738#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID [2022-02-20 18:28:07,198 INFO L290 TraceCheckUtils]: 57: Hoare triple {52738#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} ~mode4~0 := 1; {52738#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID [2022-02-20 18:28:07,199 INFO L290 TraceCheckUtils]: 58: Hoare triple {52738#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {52738#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID [2022-02-20 18:28:07,200 INFO L290 TraceCheckUtils]: 59: Hoare triple {52738#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} assume !(0 != ~mode5~0 % 256); {52738#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID [2022-02-20 18:28:07,200 INFO L290 TraceCheckUtils]: 60: Hoare triple {52738#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} assume !(0 != ~alive5~0 % 256); {52733#false} is VALID [2022-02-20 18:28:07,200 INFO L290 TraceCheckUtils]: 61: Hoare triple {52733#false} assume !(~send5~0 != ~id5~0); {52733#false} is VALID [2022-02-20 18:28:07,200 INFO L290 TraceCheckUtils]: 62: Hoare triple {52733#false} ~mode5~0 := 1; {52733#false} is VALID [2022-02-20 18:28:07,200 INFO L290 TraceCheckUtils]: 63: Hoare triple {52733#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; {52733#false} is VALID [2022-02-20 18:28:07,201 INFO L290 TraceCheckUtils]: 64: Hoare triple {52733#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {52733#false} is VALID [2022-02-20 18:28:07,201 INFO L290 TraceCheckUtils]: 65: Hoare triple {52733#false} assume ~r1~0 < 5;check_~tmp~1#1 := 1; {52733#false} is VALID [2022-02-20 18:28:07,201 INFO L290 TraceCheckUtils]: 66: Hoare triple {52733#false} check_#res#1 := check_~tmp~1#1; {52733#false} is VALID [2022-02-20 18:28:07,201 INFO L290 TraceCheckUtils]: 67: Hoare triple {52733#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {52733#false} is VALID [2022-02-20 18:28:07,201 INFO L290 TraceCheckUtils]: 68: Hoare triple {52733#false} assume 0 == assert_~arg#1 % 256; {52733#false} is VALID [2022-02-20 18:28:07,201 INFO L290 TraceCheckUtils]: 69: Hoare triple {52733#false} assume !false; {52733#false} is VALID [2022-02-20 18:28:07,202 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:07,202 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:07,203 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550866168] [2022-02-20 18:28:07,203 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550866168] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:07,203 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:07,203 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:28:07,203 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487861776] [2022-02-20 18:28:07,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:07,204 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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:07,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:07,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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:07,274 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:07,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:28:07,275 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:07,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:28:07,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:28:07,275 INFO L87 Difference]: Start difference. First operand 3112 states and 4743 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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:22,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:22,883 INFO L93 Difference]: Finished difference Result 16722 states and 25228 transitions. [2022-02-20 18:28:22,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:28:22,883 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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:22,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:22,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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:22,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 711 transitions. [2022-02-20 18:28:22,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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:22,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 711 transitions. [2022-02-20 18:28:22,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 711 transitions. [2022-02-20 18:28:23,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 711 edges. 711 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:29,336 INFO L225 Difference]: With dead ends: 16722 [2022-02-20 18:28:29,336 INFO L226 Difference]: Without dead ends: 13648 [2022-02-20 18:28:29,340 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:29,340 INFO L933 BasicCegarLoop]: 342 mSDtfsCounter, 559 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:28:29,341 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [559 Valid, 970 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:28:29,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13648 states. [2022-02-20 18:28:35,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13648 to 13640. [2022-02-20 18:28:35,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:35,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13648 states. Second operand has 13640 states, 13639 states have (on average 1.4997433829459639) internal successors, (20455), 13639 states have internal predecessors, (20455), 0 states have call successors, (0), 0 states have 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:35,441 INFO L74 IsIncluded]: Start isIncluded. First operand 13648 states. Second operand has 13640 states, 13639 states have (on average 1.4997433829459639) internal successors, (20455), 13639 states have internal predecessors, (20455), 0 states have call successors, (0), 0 states have 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:35,458 INFO L87 Difference]: Start difference. First operand 13648 states. Second operand has 13640 states, 13639 states have (on average 1.4997433829459639) internal successors, (20455), 13639 states have internal predecessors, (20455), 0 states have call successors, (0), 0 states have 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:40,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:40,629 INFO L93 Difference]: Finished difference Result 13648 states and 20459 transitions. [2022-02-20 18:28:40,629 INFO L276 IsEmpty]: Start isEmpty. Operand 13648 states and 20459 transitions. [2022-02-20 18:28:40,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:40,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:40,659 INFO L74 IsIncluded]: Start isIncluded. First operand has 13640 states, 13639 states have (on average 1.4997433829459639) internal successors, (20455), 13639 states have internal predecessors, (20455), 0 states have call successors, (0), 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 13648 states. [2022-02-20 18:28:40,676 INFO L87 Difference]: Start difference. First operand has 13640 states, 13639 states have (on average 1.4997433829459639) internal successors, (20455), 13639 states have internal predecessors, (20455), 0 states have call successors, (0), 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 13648 states. [2022-02-20 18:28:45,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:45,983 INFO L93 Difference]: Finished difference Result 13648 states and 20459 transitions. [2022-02-20 18:28:45,983 INFO L276 IsEmpty]: Start isEmpty. Operand 13648 states and 20459 transitions. [2022-02-20 18:28:45,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:45,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:45,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:45,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:46,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13640 states, 13639 states have (on average 1.4997433829459639) internal successors, (20455), 13639 states have internal predecessors, (20455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)