./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.2.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.2.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 cea4cc3548129351800c62333a8b3afa818cc0cede5b8fec1c7e8b8079e480c6 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:27:45,375 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:27:45,377 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:27:45,410 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:27:45,411 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:27:45,412 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:27:45,413 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:27:45,414 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:27:45,415 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:27:45,415 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:27:45,416 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:27:45,417 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:27:45,417 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:27:45,418 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:27:45,418 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:27:45,419 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:27:45,420 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:27:45,420 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:27:45,422 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:27:45,423 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:27:45,424 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:27:45,425 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:27:45,426 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:27:45,426 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:27:45,428 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:27:45,429 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:27:45,429 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:27:45,429 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:27:45,430 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:27:45,430 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:27:45,431 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:27:45,431 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:27:45,432 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:27:45,432 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:27:45,433 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:27:45,433 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:27:45,434 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:27:45,434 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:27:45,434 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:27:45,435 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:27:45,435 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:27:45,436 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:45,449 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:27:45,449 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:27:45,449 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:27:45,449 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:27:45,450 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:27:45,450 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:27:45,450 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:27:45,450 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:27:45,451 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:27:45,451 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:27:45,451 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:27:45,451 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:27:45,451 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:27:45,451 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:27:45,452 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:27:45,452 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:27:45,452 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:27:45,452 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:27:45,452 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:27:45,452 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:27:45,452 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:27:45,452 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:27:45,453 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:27:45,453 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:27:45,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:27:45,453 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:27:45,453 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:27:45,453 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:27:45,453 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:27:45,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:27:45,454 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:27:45,454 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:27:45,454 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:27:45,454 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 -> cea4cc3548129351800c62333a8b3afa818cc0cede5b8fec1c7e8b8079e480c6 [2022-02-20 18:27:45,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:27:45,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:27:45,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:27:45,610 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:27:45,611 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:27:45,611 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c [2022-02-20 18:27:45,671 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f9b96193/6c4217e856e240048c56062ed98d1d0f/FLAG0856d04c9 [2022-02-20 18:27:46,039 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:27:46,040 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c [2022-02-20 18:27:46,045 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f9b96193/6c4217e856e240048c56062ed98d1d0f/FLAG0856d04c9 [2022-02-20 18:27:46,056 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f9b96193/6c4217e856e240048c56062ed98d1d0f [2022-02-20 18:27:46,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:27:46,059 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:27:46,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:27:46,061 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:27:46,079 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:27:46,083 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:27:46" (1/1) ... [2022-02-20 18:27:46,083 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62628a6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:46, skipping insertion in model container [2022-02-20 18:27:46,084 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:27:46" (1/1) ... [2022-02-20 18:27:46,088 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:27:46,121 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:27:46,354 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c[12639,12652] [2022-02-20 18:27:46,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:27:46,365 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:27:46,408 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c[12639,12652] [2022-02-20 18:27:46,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:27:46,418 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:27:46,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:46 WrapperNode [2022-02-20 18:27:46,419 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:27:46,420 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:27:46,420 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:27:46,420 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:27:46,425 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:46" (1/1) ... [2022-02-20 18:27:46,431 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:46" (1/1) ... [2022-02-20 18:27:46,464 INFO L137 Inliner]: procedures = 24, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 384 [2022-02-20 18:27:46,475 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:27:46,476 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:27:46,476 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:27:46,476 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:27:46,482 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:46" (1/1) ... [2022-02-20 18:27:46,482 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:46" (1/1) ... [2022-02-20 18:27:46,485 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:46" (1/1) ... [2022-02-20 18:27:46,492 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:46" (1/1) ... [2022-02-20 18:27:46,497 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:46" (1/1) ... [2022-02-20 18:27:46,512 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:46" (1/1) ... [2022-02-20 18:27:46,513 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:46" (1/1) ... [2022-02-20 18:27:46,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:27:46,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:27:46,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:27:46,531 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:27:46,532 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:46" (1/1) ... [2022-02-20 18:27:46,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:27:46,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:27:46,573 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:46,575 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:46,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:27:46,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:27:46,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:27:46,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:27:46,666 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:27:46,670 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:27:47,175 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:27:47,182 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:27:47,183 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:27:47,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:27:47 BoogieIcfgContainer [2022-02-20 18:27:47,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:27:47,188 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:27:47,188 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:27:47,191 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:27:47,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:27:46" (1/3) ... [2022-02-20 18:27:47,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@343b1c10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:27:47, skipping insertion in model container [2022-02-20 18:27:47,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:27:46" (2/3) ... [2022-02-20 18:27:47,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@343b1c10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:27:47, skipping insertion in model container [2022-02-20 18:27:47,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:27:47" (3/3) ... [2022-02-20 18:27:47,193 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c [2022-02-20 18:27:47,200 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:27:47,200 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:27:47,266 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:27:47,276 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:47,276 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:27:47,309 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 117 states have (on average 1.7094017094017093) internal successors, (200), 118 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have 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 L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 18:27:47,317 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:47,317 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:47,318 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:47,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:47,322 INFO L85 PathProgramCache]: Analyzing trace with hash -737936725, now seen corresponding path program 1 times [2022-02-20 18:27:47,332 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:47,333 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130671987] [2022-02-20 18:27:47,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:47,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:47,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {122#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; {122#true} is VALID [2022-02-20 18:27:47,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {122#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1, main_#t~post41#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~nondet13#1 && main_#t~nondet13#1 <= 127;~r1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~alive1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~alive2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~send3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~alive3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~alive4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~id5~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~st5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~send5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~mode5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~alive5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {122#true} is VALID [2022-02-20 18:27:47,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {122#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {122#true} is VALID [2022-02-20 18:27:47,461 INFO L290 TraceCheckUtils]: 3: Hoare triple {122#true} init_#res#1 := init_~tmp~0#1; {122#true} is VALID [2022-02-20 18:27:47,461 INFO L290 TraceCheckUtils]: 4: Hoare triple {122#true} main_#t~ret39#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret39#1 && main_#t~ret39#1 <= 2147483647;main_~i2~0#1 := main_#t~ret39#1;havoc main_#t~ret39#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {122#true} is VALID [2022-02-20 18:27:47,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {122#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {123#false} is VALID [2022-02-20 18:27:47,462 INFO L290 TraceCheckUtils]: 6: Hoare triple {123#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; {123#false} is VALID [2022-02-20 18:27:47,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {123#false} assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {123#false} is VALID [2022-02-20 18:27:47,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {123#false} assume !(0 != ~mode1~0 % 256); {123#false} is VALID [2022-02-20 18:27:47,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {123#false} assume !(0 != ~alive1~0 % 256); {123#false} is VALID [2022-02-20 18:27:47,463 INFO L290 TraceCheckUtils]: 10: Hoare triple {123#false} ~mode1~0 := 1; {123#false} is VALID [2022-02-20 18:27:47,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {123#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {123#false} is VALID [2022-02-20 18:27:47,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {123#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {123#false} is VALID [2022-02-20 18:27:47,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {123#false} assume !(node2_~m2~0#1 != ~nomsg~0); {123#false} is VALID [2022-02-20 18:27:47,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {123#false} ~mode2~0 := 0; {123#false} is VALID [2022-02-20 18:27:47,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {123#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {123#false} is VALID [2022-02-20 18:27:47,464 INFO L290 TraceCheckUtils]: 16: Hoare triple {123#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {123#false} is VALID [2022-02-20 18:27:47,464 INFO L290 TraceCheckUtils]: 17: Hoare triple {123#false} assume !(node3_~m3~0#1 != ~nomsg~0); {123#false} is VALID [2022-02-20 18:27:47,465 INFO L290 TraceCheckUtils]: 18: Hoare triple {123#false} ~mode3~0 := 0; {123#false} is VALID [2022-02-20 18:27:47,465 INFO L290 TraceCheckUtils]: 19: Hoare triple {123#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {123#false} is VALID [2022-02-20 18:27:47,465 INFO L290 TraceCheckUtils]: 20: Hoare triple {123#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {123#false} is VALID [2022-02-20 18:27:47,465 INFO L290 TraceCheckUtils]: 21: Hoare triple {123#false} assume !(node4_~m4~0#1 != ~nomsg~0); {123#false} is VALID [2022-02-20 18:27:47,465 INFO L290 TraceCheckUtils]: 22: Hoare triple {123#false} ~mode4~0 := 0; {123#false} is VALID [2022-02-20 18:27:47,466 INFO L290 TraceCheckUtils]: 23: Hoare triple {123#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {123#false} is VALID [2022-02-20 18:27:47,466 INFO L290 TraceCheckUtils]: 24: Hoare triple {123#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {123#false} is VALID [2022-02-20 18:27:47,466 INFO L290 TraceCheckUtils]: 25: Hoare triple {123#false} assume !(node5_~m5~0#1 != ~nomsg~0); {123#false} is VALID [2022-02-20 18:27:47,466 INFO L290 TraceCheckUtils]: 26: Hoare triple {123#false} ~mode5~0 := 0; {123#false} is VALID [2022-02-20 18:27:47,466 INFO L290 TraceCheckUtils]: 27: Hoare triple {123#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; {123#false} is VALID [2022-02-20 18:27:47,467 INFO L290 TraceCheckUtils]: 28: Hoare triple {123#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {123#false} is VALID [2022-02-20 18:27:47,467 INFO L290 TraceCheckUtils]: 29: Hoare triple {123#false} check_#res#1 := check_~tmp~1#1; {123#false} is VALID [2022-02-20 18:27:47,467 INFO L290 TraceCheckUtils]: 30: Hoare triple {123#false} main_#t~ret40#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~c1~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {123#false} is VALID [2022-02-20 18:27:47,467 INFO L290 TraceCheckUtils]: 31: Hoare triple {123#false} assume 0 == assert_~arg#1 % 256; {123#false} is VALID [2022-02-20 18:27:47,467 INFO L290 TraceCheckUtils]: 32: Hoare triple {123#false} assume !false; {123#false} is VALID [2022-02-20 18:27:47,468 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,469 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:47,469 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130671987] [2022-02-20 18:27:47,469 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130671987] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:47,470 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:47,470 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:27:47,471 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225924183] [2022-02-20 18:27:47,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:47,474 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:47,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:47,477 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:47,501 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:47,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:27:47,502 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:47,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:27:47,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:27:47,517 INFO L87 Difference]: Start difference. First operand has 119 states, 117 states have (on average 1.7094017094017093) internal successors, (200), 118 states have internal predecessors, (200), 0 states have call successors, (0), 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:47,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:47,611 INFO L93 Difference]: Finished difference Result 201 states and 330 transitions. [2022-02-20 18:27:47,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:27:47,612 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:47,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:47,613 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:47,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 330 transitions. [2022-02-20 18:27:47,621 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:47,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 330 transitions. [2022-02-20 18:27:47,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 330 transitions. [2022-02-20 18:27:47,854 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:47,862 INFO L225 Difference]: With dead ends: 201 [2022-02-20 18:27:47,862 INFO L226 Difference]: Without dead ends: 115 [2022-02-20 18:27:47,888 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:47,891 INFO L933 BasicCegarLoop]: 197 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, 197 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:47,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 197 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:47,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-02-20 18:27:47,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-02-20 18:27:47,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:47,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 115 states, 114 states have (on average 1.6929824561403508) internal successors, (193), 114 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have 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,943 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 115 states, 114 states have (on average 1.6929824561403508) internal successors, (193), 114 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have 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,944 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 115 states, 114 states have (on average 1.6929824561403508) internal successors, (193), 114 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have 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,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:47,953 INFO L93 Difference]: Finished difference Result 115 states and 193 transitions. [2022-02-20 18:27:47,953 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 193 transitions. [2022-02-20 18:27:47,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:47,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:47,956 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 114 states have (on average 1.6929824561403508) internal successors, (193), 114 states have internal predecessors, (193), 0 states have call successors, (0), 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 115 states. [2022-02-20 18:27:47,957 INFO L87 Difference]: Start difference. First operand has 115 states, 114 states have (on average 1.6929824561403508) internal successors, (193), 114 states have internal predecessors, (193), 0 states have call successors, (0), 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 115 states. [2022-02-20 18:27:47,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:47,967 INFO L93 Difference]: Finished difference Result 115 states and 193 transitions. [2022-02-20 18:27:47,968 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 193 transitions. [2022-02-20 18:27:47,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:47,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:47,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:47,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:47,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.6929824561403508) internal successors, (193), 114 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have 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,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 193 transitions. [2022-02-20 18:27:47,976 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 193 transitions. Word has length 33 [2022-02-20 18:27:47,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:47,977 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 193 transitions. [2022-02-20 18:27:47,977 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:47,978 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 193 transitions. [2022-02-20 18:27:47,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 18:27:47,979 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:47,980 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:47,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:27:47,980 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:47,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:47,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1247409815, now seen corresponding path program 1 times [2022-02-20 18:27:47,981 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:47,981 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145365045] [2022-02-20 18:27:47,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:47,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:48,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:48,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {697#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; {697#true} is VALID [2022-02-20 18:27:48,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {697#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1, main_#t~post41#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~nondet13#1 && main_#t~nondet13#1 <= 127;~r1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~alive1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~alive2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~send3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~alive3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~alive4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~id5~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~st5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~send5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~mode5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~alive5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {697#true} is VALID [2022-02-20 18:27:48,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {697#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {699#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 18:27:48,099 INFO L290 TraceCheckUtils]: 3: Hoare triple {699#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {700#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:27:48,100 INFO L290 TraceCheckUtils]: 4: Hoare triple {700#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret39#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret39#1 && main_#t~ret39#1 <= 2147483647;main_~i2~0#1 := main_#t~ret39#1;havoc main_#t~ret39#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {701#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 18:27:48,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {701#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {698#false} is VALID [2022-02-20 18:27:48,101 INFO L290 TraceCheckUtils]: 6: Hoare triple {698#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; {698#false} is VALID [2022-02-20 18:27:48,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {698#false} assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {698#false} is VALID [2022-02-20 18:27:48,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {698#false} assume !(0 != ~mode1~0 % 256); {698#false} is VALID [2022-02-20 18:27:48,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {698#false} assume !(0 != ~alive1~0 % 256); {698#false} is VALID [2022-02-20 18:27:48,103 INFO L290 TraceCheckUtils]: 10: Hoare triple {698#false} ~mode1~0 := 1; {698#false} is VALID [2022-02-20 18:27:48,103 INFO L290 TraceCheckUtils]: 11: Hoare triple {698#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {698#false} is VALID [2022-02-20 18:27:48,103 INFO L290 TraceCheckUtils]: 12: Hoare triple {698#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {698#false} is VALID [2022-02-20 18:27:48,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {698#false} assume !(node2_~m2~0#1 != ~nomsg~0); {698#false} is VALID [2022-02-20 18:27:48,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {698#false} ~mode2~0 := 0; {698#false} is VALID [2022-02-20 18:27:48,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {698#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {698#false} is VALID [2022-02-20 18:27:48,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {698#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {698#false} is VALID [2022-02-20 18:27:48,107 INFO L290 TraceCheckUtils]: 17: Hoare triple {698#false} assume !(node3_~m3~0#1 != ~nomsg~0); {698#false} is VALID [2022-02-20 18:27:48,107 INFO L290 TraceCheckUtils]: 18: Hoare triple {698#false} ~mode3~0 := 0; {698#false} is VALID [2022-02-20 18:27:48,108 INFO L290 TraceCheckUtils]: 19: Hoare triple {698#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {698#false} is VALID [2022-02-20 18:27:48,108 INFO L290 TraceCheckUtils]: 20: Hoare triple {698#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {698#false} is VALID [2022-02-20 18:27:48,108 INFO L290 TraceCheckUtils]: 21: Hoare triple {698#false} assume !(node4_~m4~0#1 != ~nomsg~0); {698#false} is VALID [2022-02-20 18:27:48,110 INFO L290 TraceCheckUtils]: 22: Hoare triple {698#false} ~mode4~0 := 0; {698#false} is VALID [2022-02-20 18:27:48,110 INFO L290 TraceCheckUtils]: 23: Hoare triple {698#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {698#false} is VALID [2022-02-20 18:27:48,110 INFO L290 TraceCheckUtils]: 24: Hoare triple {698#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {698#false} is VALID [2022-02-20 18:27:48,111 INFO L290 TraceCheckUtils]: 25: Hoare triple {698#false} assume !(node5_~m5~0#1 != ~nomsg~0); {698#false} is VALID [2022-02-20 18:27:48,111 INFO L290 TraceCheckUtils]: 26: Hoare triple {698#false} ~mode5~0 := 0; {698#false} is VALID [2022-02-20 18:27:48,111 INFO L290 TraceCheckUtils]: 27: Hoare triple {698#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; {698#false} is VALID [2022-02-20 18:27:48,112 INFO L290 TraceCheckUtils]: 28: Hoare triple {698#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {698#false} is VALID [2022-02-20 18:27:48,112 INFO L290 TraceCheckUtils]: 29: Hoare triple {698#false} check_#res#1 := check_~tmp~1#1; {698#false} is VALID [2022-02-20 18:27:48,112 INFO L290 TraceCheckUtils]: 30: Hoare triple {698#false} main_#t~ret40#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~c1~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {698#false} is VALID [2022-02-20 18:27:48,112 INFO L290 TraceCheckUtils]: 31: Hoare triple {698#false} assume 0 == assert_~arg#1 % 256; {698#false} is VALID [2022-02-20 18:27:48,113 INFO L290 TraceCheckUtils]: 32: Hoare triple {698#false} assume !false; {698#false} is VALID [2022-02-20 18:27:48,113 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,113 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:48,113 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145365045] [2022-02-20 18:27:48,114 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145365045] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:48,114 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:48,114 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:27:48,114 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313478094] [2022-02-20 18:27:48,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:48,116 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:48,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:48,117 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:48,140 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:48,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:27:48,141 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:48,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:27:48,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:27:48,142 INFO L87 Difference]: Start difference. First operand 115 states and 193 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:48,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:48,465 INFO L93 Difference]: Finished difference Result 196 states and 320 transitions. [2022-02-20 18:27:48,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:27:48,466 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:48,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:48,466 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:48,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 320 transitions. [2022-02-20 18:27:48,469 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:48,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 320 transitions. [2022-02-20 18:27:48,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 320 transitions. [2022-02-20 18:27:48,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 320 edges. 320 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:48,669 INFO L225 Difference]: With dead ends: 196 [2022-02-20 18:27:48,669 INFO L226 Difference]: Without dead ends: 115 [2022-02-20 18:27:48,673 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:48,675 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 3 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 729 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:48,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 729 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:48,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-02-20 18:27:48,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-02-20 18:27:48,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:48,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 115 states, 114 states have (on average 1.412280701754386) internal successors, (161), 114 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have 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,687 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 115 states, 114 states have (on average 1.412280701754386) internal successors, (161), 114 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have 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,688 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 115 states, 114 states have (on average 1.412280701754386) internal successors, (161), 114 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have 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,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:48,690 INFO L93 Difference]: Finished difference Result 115 states and 161 transitions. [2022-02-20 18:27:48,691 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2022-02-20 18:27:48,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:48,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:48,694 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 114 states have (on average 1.412280701754386) internal successors, (161), 114 states have internal predecessors, (161), 0 states have call successors, (0), 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 115 states. [2022-02-20 18:27:48,694 INFO L87 Difference]: Start difference. First operand has 115 states, 114 states have (on average 1.412280701754386) internal successors, (161), 114 states have internal predecessors, (161), 0 states have call successors, (0), 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 115 states. [2022-02-20 18:27:48,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:48,700 INFO L93 Difference]: Finished difference Result 115 states and 161 transitions. [2022-02-20 18:27:48,700 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2022-02-20 18:27:48,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:48,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:48,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:48,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:48,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.412280701754386) internal successors, (161), 114 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have 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,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2022-02-20 18:27:48,703 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 33 [2022-02-20 18:27:48,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:48,704 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2022-02-20 18:27:48,704 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:48,704 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2022-02-20 18:27:48,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:27:48,707 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:48,707 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:48,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:27:48,707 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:48,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:48,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1143227198, now seen corresponding path program 1 times [2022-02-20 18:27:48,708 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:48,708 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723309220] [2022-02-20 18:27:48,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:48,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:48,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {1273#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; {1273#true} is VALID [2022-02-20 18:27:48,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {1273#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1, main_#t~post41#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~nondet13#1 && main_#t~nondet13#1 <= 127;~r1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~alive1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~alive2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~send3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~alive3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~alive4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~id5~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~st5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~send5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~mode5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~alive5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1273#true} is VALID [2022-02-20 18:27:48,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {1273#true} assume 0 == ~r1~0; {1273#true} is VALID [2022-02-20 18:27:48,844 INFO L290 TraceCheckUtils]: 3: Hoare triple {1273#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {1273#true} is VALID [2022-02-20 18:27:48,844 INFO L290 TraceCheckUtils]: 4: Hoare triple {1273#true} assume ~id1~0 >= 0; {1273#true} is VALID [2022-02-20 18:27:48,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {1273#true} assume 0 == ~st1~0; {1273#true} is VALID [2022-02-20 18:27:48,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {1273#true} assume ~send1~0 == ~id1~0; {1273#true} is VALID [2022-02-20 18:27:48,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {1273#true} assume 0 == ~mode1~0 % 256; {1273#true} is VALID [2022-02-20 18:27:48,845 INFO L290 TraceCheckUtils]: 8: Hoare triple {1273#true} assume ~id2~0 >= 0; {1273#true} is VALID [2022-02-20 18:27:48,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {1273#true} assume 0 == ~st2~0; {1273#true} is VALID [2022-02-20 18:27:48,845 INFO L290 TraceCheckUtils]: 10: Hoare triple {1273#true} assume ~send2~0 == ~id2~0; {1273#true} is VALID [2022-02-20 18:27:48,846 INFO L290 TraceCheckUtils]: 11: Hoare triple {1273#true} assume 0 == ~mode2~0 % 256; {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:48,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:48,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:48,847 INFO L290 TraceCheckUtils]: 14: Hoare triple {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:48,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:48,848 INFO L290 TraceCheckUtils]: 16: Hoare triple {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:48,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:48,849 INFO L290 TraceCheckUtils]: 18: Hoare triple {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:48,849 INFO L290 TraceCheckUtils]: 19: Hoare triple {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:48,850 INFO L290 TraceCheckUtils]: 20: Hoare triple {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:48,850 INFO L290 TraceCheckUtils]: 21: Hoare triple {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:48,851 INFO L290 TraceCheckUtils]: 22: Hoare triple {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:48,851 INFO L290 TraceCheckUtils]: 23: Hoare triple {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:48,851 INFO L290 TraceCheckUtils]: 24: Hoare triple {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:48,852 INFO L290 TraceCheckUtils]: 25: Hoare triple {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:48,852 INFO L290 TraceCheckUtils]: 26: Hoare triple {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:48,853 INFO L290 TraceCheckUtils]: 27: Hoare triple {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:48,853 INFO L290 TraceCheckUtils]: 28: Hoare triple {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:48,854 INFO L290 TraceCheckUtils]: 29: Hoare triple {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:48,854 INFO L290 TraceCheckUtils]: 30: Hoare triple {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:48,854 INFO L290 TraceCheckUtils]: 31: Hoare triple {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:48,855 INFO L290 TraceCheckUtils]: 32: Hoare triple {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:48,855 INFO L290 TraceCheckUtils]: 33: Hoare triple {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:48,856 INFO L290 TraceCheckUtils]: 34: Hoare triple {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:48,856 INFO L290 TraceCheckUtils]: 35: Hoare triple {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret39#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret39#1 && main_#t~ret39#1 <= 2147483647;main_~i2~0#1 := main_#t~ret39#1;havoc main_#t~ret39#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:48,857 INFO L290 TraceCheckUtils]: 36: Hoare triple {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:48,857 INFO L290 TraceCheckUtils]: 37: Hoare triple {1275#(= (+ (* (- 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; {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:48,857 INFO L290 TraceCheckUtils]: 38: Hoare triple {1275#(= (+ (* (- 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_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:48,858 INFO L290 TraceCheckUtils]: 39: Hoare triple {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:48,858 INFO L290 TraceCheckUtils]: 40: Hoare triple {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~alive1~0 % 256); {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:48,859 INFO L290 TraceCheckUtils]: 41: Hoare triple {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:48,859 INFO L290 TraceCheckUtils]: 42: Hoare triple {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1275#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:27:48,860 INFO L290 TraceCheckUtils]: 43: Hoare triple {1275#(= (+ (* (- 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; {1274#false} is VALID [2022-02-20 18:27:48,860 INFO L290 TraceCheckUtils]: 44: Hoare triple {1274#false} assume !(node2_~m2~0#1 != ~nomsg~0); {1274#false} is VALID [2022-02-20 18:27:48,860 INFO L290 TraceCheckUtils]: 45: Hoare triple {1274#false} ~mode2~0 := 0; {1274#false} is VALID [2022-02-20 18:27:48,860 INFO L290 TraceCheckUtils]: 46: Hoare triple {1274#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1274#false} is VALID [2022-02-20 18:27:48,860 INFO L290 TraceCheckUtils]: 47: Hoare triple {1274#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1274#false} is VALID [2022-02-20 18:27:48,860 INFO L290 TraceCheckUtils]: 48: Hoare triple {1274#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1274#false} is VALID [2022-02-20 18:27:48,861 INFO L290 TraceCheckUtils]: 49: Hoare triple {1274#false} ~mode3~0 := 0; {1274#false} is VALID [2022-02-20 18:27:48,861 INFO L290 TraceCheckUtils]: 50: Hoare triple {1274#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1274#false} is VALID [2022-02-20 18:27:48,861 INFO L290 TraceCheckUtils]: 51: Hoare triple {1274#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1274#false} is VALID [2022-02-20 18:27:48,861 INFO L290 TraceCheckUtils]: 52: Hoare triple {1274#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1274#false} is VALID [2022-02-20 18:27:48,861 INFO L290 TraceCheckUtils]: 53: Hoare triple {1274#false} ~mode4~0 := 0; {1274#false} is VALID [2022-02-20 18:27:48,861 INFO L290 TraceCheckUtils]: 54: Hoare triple {1274#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {1274#false} is VALID [2022-02-20 18:27:48,862 INFO L290 TraceCheckUtils]: 55: Hoare triple {1274#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1274#false} is VALID [2022-02-20 18:27:48,862 INFO L290 TraceCheckUtils]: 56: Hoare triple {1274#false} assume !(node5_~m5~0#1 != ~nomsg~0); {1274#false} is VALID [2022-02-20 18:27:48,862 INFO L290 TraceCheckUtils]: 57: Hoare triple {1274#false} ~mode5~0 := 0; {1274#false} is VALID [2022-02-20 18:27:48,862 INFO L290 TraceCheckUtils]: 58: Hoare triple {1274#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; {1274#false} is VALID [2022-02-20 18:27:48,862 INFO L290 TraceCheckUtils]: 59: Hoare triple {1274#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {1274#false} is VALID [2022-02-20 18:27:48,862 INFO L290 TraceCheckUtils]: 60: Hoare triple {1274#false} check_#res#1 := check_~tmp~1#1; {1274#false} is VALID [2022-02-20 18:27:48,862 INFO L290 TraceCheckUtils]: 61: Hoare triple {1274#false} main_#t~ret40#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~c1~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1274#false} is VALID [2022-02-20 18:27:48,863 INFO L290 TraceCheckUtils]: 62: Hoare triple {1274#false} assume 0 == assert_~arg#1 % 256; {1274#false} is VALID [2022-02-20 18:27:48,863 INFO L290 TraceCheckUtils]: 63: Hoare triple {1274#false} assume !false; {1274#false} is VALID [2022-02-20 18:27:48,863 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,864 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:48,864 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723309220] [2022-02-20 18:27:48,864 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723309220] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:48,864 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:48,864 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:27:48,864 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040111716] [2022-02-20 18:27:48,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:48,865 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:48,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:48,865 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:48,902 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:48,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:27:48,902 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:48,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:27:48,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:27:48,903 INFO L87 Difference]: Start difference. First operand 115 states and 161 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:49,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:49,087 INFO L93 Difference]: Finished difference Result 257 states and 387 transitions. [2022-02-20 18:27:49,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:27:49,087 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:49,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:49,088 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:49,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2022-02-20 18:27:49,090 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:49,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2022-02-20 18:27:49,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 387 transitions. [2022-02-20 18:27:49,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 387 edges. 387 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:49,342 INFO L225 Difference]: With dead ends: 257 [2022-02-20 18:27:49,342 INFO L226 Difference]: Without dead ends: 180 [2022-02-20 18:27:49,343 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,344 INFO L933 BasicCegarLoop]: 242 mSDtfsCounter, 107 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 360 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,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 360 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,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-02-20 18:27:49,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [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 180 states. Second operand has 178 states, 177 states have (on average 1.4802259887005649) internal successors, (262), 177 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have 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,351 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand has 178 states, 177 states have (on average 1.4802259887005649) internal successors, (262), 177 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have 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,352 INFO L87 Difference]: Start difference. First operand 180 states. Second operand has 178 states, 177 states have (on average 1.4802259887005649) internal successors, (262), 177 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have 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,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:49,355 INFO L93 Difference]: Finished difference Result 180 states and 263 transitions. [2022-02-20 18:27:49,355 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 263 transitions. [2022-02-20 18:27:49,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:49,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:49,356 INFO L74 IsIncluded]: Start isIncluded. First operand has 178 states, 177 states have (on average 1.4802259887005649) internal successors, (262), 177 states have internal predecessors, (262), 0 states have call successors, (0), 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 180 states. [2022-02-20 18:27:49,356 INFO L87 Difference]: Start difference. First operand has 178 states, 177 states have (on average 1.4802259887005649) internal successors, (262), 177 states have internal predecessors, (262), 0 states have call successors, (0), 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 180 states. [2022-02-20 18:27:49,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:49,359 INFO L93 Difference]: Finished difference Result 180 states and 263 transitions. [2022-02-20 18:27:49,359 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 263 transitions. [2022-02-20 18:27:49,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:49,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:49,360 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:49,360 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:49,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.4802259887005649) internal successors, (262), 177 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have 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,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 262 transitions. [2022-02-20 18:27:49,363 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 262 transitions. Word has length 64 [2022-02-20 18:27:49,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:49,364 INFO L470 AbstractCegarLoop]: Abstraction has 178 states and 262 transitions. [2022-02-20 18:27:49,364 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:49,364 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 262 transitions. [2022-02-20 18:27:49,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:27:49,364 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:49,365 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:49,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:27:49,365 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:49,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:49,365 INFO L85 PathProgramCache]: Analyzing trace with hash -969420354, now seen corresponding path program 1 times [2022-02-20 18:27:49,366 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:49,366 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123765562] [2022-02-20 18:27:49,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:49,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:49,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {2110#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; {2110#true} is VALID [2022-02-20 18:27:49,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {2110#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1, main_#t~post41#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~nondet13#1 && main_#t~nondet13#1 <= 127;~r1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~alive1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~alive2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~send3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~alive3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~alive4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~id5~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~st5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~send5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~mode5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~alive5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {2110#true} is VALID [2022-02-20 18:27:49,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {2110#true} assume 0 == ~r1~0; {2110#true} is VALID [2022-02-20 18:27:49,425 INFO L290 TraceCheckUtils]: 3: Hoare triple {2110#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {2110#true} is VALID [2022-02-20 18:27:49,425 INFO L290 TraceCheckUtils]: 4: Hoare triple {2110#true} assume ~id1~0 >= 0; {2110#true} is VALID [2022-02-20 18:27:49,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {2110#true} assume 0 == ~st1~0; {2110#true} is VALID [2022-02-20 18:27:49,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {2110#true} assume ~send1~0 == ~id1~0; {2110#true} is VALID [2022-02-20 18:27:49,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {2110#true} assume 0 == ~mode1~0 % 256; {2110#true} is VALID [2022-02-20 18:27:49,425 INFO L290 TraceCheckUtils]: 8: Hoare triple {2110#true} assume ~id2~0 >= 0; {2110#true} is VALID [2022-02-20 18:27:49,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {2110#true} assume 0 == ~st2~0; {2110#true} is VALID [2022-02-20 18:27:49,426 INFO L290 TraceCheckUtils]: 10: Hoare triple {2110#true} assume ~send2~0 == ~id2~0; {2110#true} is VALID [2022-02-20 18:27:49,426 INFO L290 TraceCheckUtils]: 11: Hoare triple {2110#true} assume 0 == ~mode2~0 % 256; {2110#true} is VALID [2022-02-20 18:27:49,426 INFO L290 TraceCheckUtils]: 12: Hoare triple {2110#true} assume ~id3~0 >= 0; {2110#true} is VALID [2022-02-20 18:27:49,426 INFO L290 TraceCheckUtils]: 13: Hoare triple {2110#true} assume 0 == ~st3~0; {2110#true} is VALID [2022-02-20 18:27:49,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {2110#true} assume ~send3~0 == ~id3~0; {2110#true} is VALID [2022-02-20 18:27:49,427 INFO L290 TraceCheckUtils]: 15: Hoare triple {2110#true} assume 0 == ~mode3~0 % 256; {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:49,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:49,427 INFO L290 TraceCheckUtils]: 17: Hoare triple {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:49,428 INFO L290 TraceCheckUtils]: 18: Hoare triple {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:49,428 INFO L290 TraceCheckUtils]: 19: Hoare triple {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:49,428 INFO L290 TraceCheckUtils]: 20: Hoare triple {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:49,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:49,429 INFO L290 TraceCheckUtils]: 22: Hoare triple {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:49,430 INFO L290 TraceCheckUtils]: 23: Hoare triple {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:49,430 INFO L290 TraceCheckUtils]: 24: Hoare triple {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:49,430 INFO L290 TraceCheckUtils]: 25: Hoare triple {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:49,431 INFO L290 TraceCheckUtils]: 26: Hoare triple {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:49,431 INFO L290 TraceCheckUtils]: 27: Hoare triple {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:49,431 INFO L290 TraceCheckUtils]: 28: Hoare triple {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:49,432 INFO L290 TraceCheckUtils]: 29: Hoare triple {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:49,432 INFO L290 TraceCheckUtils]: 30: Hoare triple {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:49,432 INFO L290 TraceCheckUtils]: 31: Hoare triple {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:49,439 INFO L290 TraceCheckUtils]: 32: Hoare triple {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:49,440 INFO L290 TraceCheckUtils]: 33: Hoare triple {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:49,440 INFO L290 TraceCheckUtils]: 34: Hoare triple {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:49,440 INFO L290 TraceCheckUtils]: 35: Hoare triple {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_#t~ret39#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret39#1 && main_#t~ret39#1 <= 2147483647;main_~i2~0#1 := main_#t~ret39#1;havoc main_#t~ret39#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:49,441 INFO L290 TraceCheckUtils]: 36: Hoare triple {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:49,441 INFO L290 TraceCheckUtils]: 37: Hoare triple {2112#(= (+ (* (- 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; {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:49,442 INFO L290 TraceCheckUtils]: 38: Hoare triple {2112#(= (+ (* (- 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_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:49,442 INFO L290 TraceCheckUtils]: 39: Hoare triple {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:49,442 INFO L290 TraceCheckUtils]: 40: Hoare triple {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~alive1~0 % 256); {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:49,443 INFO L290 TraceCheckUtils]: 41: Hoare triple {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:49,443 INFO L290 TraceCheckUtils]: 42: Hoare triple {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:49,443 INFO L290 TraceCheckUtils]: 43: Hoare triple {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:49,444 INFO L290 TraceCheckUtils]: 44: Hoare triple {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~alive2~0 % 256); {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:49,444 INFO L290 TraceCheckUtils]: 45: Hoare triple {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send2~0 != ~id2~0); {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:49,445 INFO L290 TraceCheckUtils]: 46: Hoare triple {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:49,445 INFO L290 TraceCheckUtils]: 47: Hoare triple {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {2112#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:27:49,446 INFO L290 TraceCheckUtils]: 48: Hoare triple {2112#(= (+ (* (- 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; {2111#false} is VALID [2022-02-20 18:27:49,446 INFO L290 TraceCheckUtils]: 49: Hoare triple {2111#false} assume !(node3_~m3~0#1 != ~nomsg~0); {2111#false} is VALID [2022-02-20 18:27:49,446 INFO L290 TraceCheckUtils]: 50: Hoare triple {2111#false} ~mode3~0 := 0; {2111#false} is VALID [2022-02-20 18:27:49,446 INFO L290 TraceCheckUtils]: 51: Hoare triple {2111#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {2111#false} is VALID [2022-02-20 18:27:49,446 INFO L290 TraceCheckUtils]: 52: Hoare triple {2111#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2111#false} is VALID [2022-02-20 18:27:49,446 INFO L290 TraceCheckUtils]: 53: Hoare triple {2111#false} assume !(node4_~m4~0#1 != ~nomsg~0); {2111#false} is VALID [2022-02-20 18:27:49,447 INFO L290 TraceCheckUtils]: 54: Hoare triple {2111#false} ~mode4~0 := 0; {2111#false} is VALID [2022-02-20 18:27:49,447 INFO L290 TraceCheckUtils]: 55: Hoare triple {2111#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {2111#false} is VALID [2022-02-20 18:27:49,447 INFO L290 TraceCheckUtils]: 56: Hoare triple {2111#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {2111#false} is VALID [2022-02-20 18:27:49,447 INFO L290 TraceCheckUtils]: 57: Hoare triple {2111#false} assume !(node5_~m5~0#1 != ~nomsg~0); {2111#false} is VALID [2022-02-20 18:27:49,447 INFO L290 TraceCheckUtils]: 58: Hoare triple {2111#false} ~mode5~0 := 0; {2111#false} is VALID [2022-02-20 18:27:49,447 INFO L290 TraceCheckUtils]: 59: Hoare triple {2111#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; {2111#false} is VALID [2022-02-20 18:27:49,447 INFO L290 TraceCheckUtils]: 60: Hoare triple {2111#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {2111#false} is VALID [2022-02-20 18:27:49,448 INFO L290 TraceCheckUtils]: 61: Hoare triple {2111#false} check_#res#1 := check_~tmp~1#1; {2111#false} is VALID [2022-02-20 18:27:49,448 INFO L290 TraceCheckUtils]: 62: Hoare triple {2111#false} main_#t~ret40#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~c1~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {2111#false} is VALID [2022-02-20 18:27:49,448 INFO L290 TraceCheckUtils]: 63: Hoare triple {2111#false} assume 0 == assert_~arg#1 % 256; {2111#false} is VALID [2022-02-20 18:27:49,448 INFO L290 TraceCheckUtils]: 64: Hoare triple {2111#false} assume !false; {2111#false} is VALID [2022-02-20 18:27:49,448 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,449 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:49,449 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123765562] [2022-02-20 18:27:49,449 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123765562] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:49,449 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:49,449 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:27:49,449 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113249078] [2022-02-20 18:27:49,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:49,450 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:49,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:49,450 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:49,486 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:49,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:27:49,486 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:49,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:27:49,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:27:49,487 INFO L87 Difference]: Start difference. First operand 178 states and 262 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:49,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:49,666 INFO L93 Difference]: Finished difference Result 434 states and 670 transitions. [2022-02-20 18:27:49,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:27:49,666 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:49,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:49,667 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:49,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2022-02-20 18:27:49,669 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:49,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2022-02-20 18:27:49,671 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 387 transitions. [2022-02-20 18:27:49,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 387 edges. 387 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:49,927 INFO L225 Difference]: With dead ends: 434 [2022-02-20 18:27:49,927 INFO L226 Difference]: Without dead ends: 294 [2022-02-20 18:27:49,928 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,929 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 102 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 351 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,929 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 351 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,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-02-20 18:27:49,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2022-02-20 18:27:49,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:49,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 294 states. Second operand has 292 states, 291 states have (on average 1.52233676975945) internal successors, (443), 291 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have 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,938 INFO L74 IsIncluded]: Start isIncluded. First operand 294 states. Second operand has 292 states, 291 states have (on average 1.52233676975945) internal successors, (443), 291 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have 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,938 INFO L87 Difference]: Start difference. First operand 294 states. Second operand has 292 states, 291 states have (on average 1.52233676975945) internal successors, (443), 291 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have 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,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:49,944 INFO L93 Difference]: Finished difference Result 294 states and 444 transitions. [2022-02-20 18:27:49,944 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 444 transitions. [2022-02-20 18:27:49,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:49,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:49,945 INFO L74 IsIncluded]: Start isIncluded. First operand has 292 states, 291 states have (on average 1.52233676975945) internal successors, (443), 291 states have internal predecessors, (443), 0 states have call successors, (0), 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 294 states. [2022-02-20 18:27:49,946 INFO L87 Difference]: Start difference. First operand has 292 states, 291 states have (on average 1.52233676975945) internal successors, (443), 291 states have internal predecessors, (443), 0 states have call successors, (0), 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 294 states. [2022-02-20 18:27:49,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:49,952 INFO L93 Difference]: Finished difference Result 294 states and 444 transitions. [2022-02-20 18:27:49,952 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 444 transitions. [2022-02-20 18:27:49,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:49,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:49,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:49,953 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:49,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 1.52233676975945) internal successors, (443), 291 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have 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,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 443 transitions. [2022-02-20 18:27:49,959 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 443 transitions. Word has length 65 [2022-02-20 18:27:49,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:49,959 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 443 transitions. [2022-02-20 18:27:49,959 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:49,960 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 443 transitions. [2022-02-20 18:27:49,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:27:49,960 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:49,960 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:49,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:27:49,961 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:49,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:49,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1280140338, now seen corresponding path program 1 times [2022-02-20 18:27:49,961 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:49,961 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740321977] [2022-02-20 18:27:49,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:49,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:49,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:50,015 INFO L290 TraceCheckUtils]: 0: Hoare triple {3501#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; {3501#true} is VALID [2022-02-20 18:27:50,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {3501#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1, main_#t~post41#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~nondet13#1 && main_#t~nondet13#1 <= 127;~r1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~alive1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~alive2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~send3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~alive3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~alive4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~id5~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~st5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~send5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~mode5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~alive5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {3501#true} is VALID [2022-02-20 18:27:50,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {3501#true} assume 0 == ~r1~0; {3501#true} is VALID [2022-02-20 18:27:50,016 INFO L290 TraceCheckUtils]: 3: Hoare triple {3501#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {3501#true} is VALID [2022-02-20 18:27:50,016 INFO L290 TraceCheckUtils]: 4: Hoare triple {3501#true} assume ~id1~0 >= 0; {3501#true} is VALID [2022-02-20 18:27:50,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {3501#true} assume 0 == ~st1~0; {3501#true} is VALID [2022-02-20 18:27:50,017 INFO L290 TraceCheckUtils]: 6: Hoare triple {3501#true} assume ~send1~0 == ~id1~0; {3501#true} is VALID [2022-02-20 18:27:50,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {3501#true} assume 0 == ~mode1~0 % 256; {3501#true} is VALID [2022-02-20 18:27:50,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {3501#true} assume ~id2~0 >= 0; {3501#true} is VALID [2022-02-20 18:27:50,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {3501#true} assume 0 == ~st2~0; {3501#true} is VALID [2022-02-20 18:27:50,017 INFO L290 TraceCheckUtils]: 10: Hoare triple {3501#true} assume ~send2~0 == ~id2~0; {3501#true} is VALID [2022-02-20 18:27:50,017 INFO L290 TraceCheckUtils]: 11: Hoare triple {3501#true} assume 0 == ~mode2~0 % 256; {3501#true} is VALID [2022-02-20 18:27:50,017 INFO L290 TraceCheckUtils]: 12: Hoare triple {3501#true} assume ~id3~0 >= 0; {3501#true} is VALID [2022-02-20 18:27:50,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {3501#true} assume 0 == ~st3~0; {3501#true} is VALID [2022-02-20 18:27:50,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {3501#true} assume ~send3~0 == ~id3~0; {3501#true} is VALID [2022-02-20 18:27:50,018 INFO L290 TraceCheckUtils]: 15: Hoare triple {3501#true} assume 0 == ~mode3~0 % 256; {3501#true} is VALID [2022-02-20 18:27:50,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {3501#true} assume ~id4~0 >= 0; {3501#true} is VALID [2022-02-20 18:27:50,018 INFO L290 TraceCheckUtils]: 17: Hoare triple {3501#true} assume 0 == ~st4~0; {3501#true} is VALID [2022-02-20 18:27:50,018 INFO L290 TraceCheckUtils]: 18: Hoare triple {3501#true} assume ~send4~0 == ~id4~0; {3501#true} is VALID [2022-02-20 18:27:50,019 INFO L290 TraceCheckUtils]: 19: Hoare triple {3501#true} assume 0 == ~mode4~0 % 256; {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:50,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:50,020 INFO L290 TraceCheckUtils]: 21: Hoare triple {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:50,020 INFO L290 TraceCheckUtils]: 22: Hoare triple {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:50,021 INFO L290 TraceCheckUtils]: 23: Hoare triple {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:50,021 INFO L290 TraceCheckUtils]: 24: Hoare triple {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:50,021 INFO L290 TraceCheckUtils]: 25: Hoare triple {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:50,022 INFO L290 TraceCheckUtils]: 26: Hoare triple {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:50,022 INFO L290 TraceCheckUtils]: 27: Hoare triple {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:50,023 INFO L290 TraceCheckUtils]: 28: Hoare triple {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:50,023 INFO L290 TraceCheckUtils]: 29: Hoare triple {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:50,023 INFO L290 TraceCheckUtils]: 30: Hoare triple {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:50,024 INFO L290 TraceCheckUtils]: 31: Hoare triple {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:50,024 INFO L290 TraceCheckUtils]: 32: Hoare triple {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:50,025 INFO L290 TraceCheckUtils]: 33: Hoare triple {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:50,025 INFO L290 TraceCheckUtils]: 34: Hoare triple {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:50,026 INFO L290 TraceCheckUtils]: 35: Hoare triple {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_#t~ret39#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret39#1 && main_#t~ret39#1 <= 2147483647;main_~i2~0#1 := main_#t~ret39#1;havoc main_#t~ret39#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:50,026 INFO L290 TraceCheckUtils]: 36: Hoare triple {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:50,027 INFO L290 TraceCheckUtils]: 37: Hoare triple {3503#(= (+ (* (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; {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:50,027 INFO L290 TraceCheckUtils]: 38: Hoare triple {3503#(= (+ (* (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_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:50,027 INFO L290 TraceCheckUtils]: 39: Hoare triple {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:50,028 INFO L290 TraceCheckUtils]: 40: Hoare triple {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~alive1~0 % 256); {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:50,028 INFO L290 TraceCheckUtils]: 41: Hoare triple {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode1~0 := 1; {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:50,029 INFO L290 TraceCheckUtils]: 42: Hoare triple {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:50,029 INFO L290 TraceCheckUtils]: 43: Hoare triple {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:50,030 INFO L290 TraceCheckUtils]: 44: Hoare triple {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~alive2~0 % 256); {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:50,030 INFO L290 TraceCheckUtils]: 45: Hoare triple {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send2~0 != ~id2~0); {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:50,030 INFO L290 TraceCheckUtils]: 46: Hoare triple {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode2~0 := 1; {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:50,031 INFO L290 TraceCheckUtils]: 47: Hoare triple {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:50,031 INFO L290 TraceCheckUtils]: 48: Hoare triple {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:50,032 INFO L290 TraceCheckUtils]: 49: Hoare triple {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~alive3~0 % 256); {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:50,032 INFO L290 TraceCheckUtils]: 50: Hoare triple {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~id3~0); {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:50,032 INFO L290 TraceCheckUtils]: 51: Hoare triple {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~mode3~0 := 1; {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:50,033 INFO L290 TraceCheckUtils]: 52: Hoare triple {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {3503#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:27:50,033 INFO L290 TraceCheckUtils]: 53: Hoare triple {3503#(= (+ (* (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; {3502#false} is VALID [2022-02-20 18:27:50,033 INFO L290 TraceCheckUtils]: 54: Hoare triple {3502#false} assume !(node4_~m4~0#1 != ~nomsg~0); {3502#false} is VALID [2022-02-20 18:27:50,033 INFO L290 TraceCheckUtils]: 55: Hoare triple {3502#false} ~mode4~0 := 0; {3502#false} is VALID [2022-02-20 18:27:50,034 INFO L290 TraceCheckUtils]: 56: Hoare triple {3502#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {3502#false} is VALID [2022-02-20 18:27:50,034 INFO L290 TraceCheckUtils]: 57: Hoare triple {3502#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {3502#false} is VALID [2022-02-20 18:27:50,034 INFO L290 TraceCheckUtils]: 58: Hoare triple {3502#false} assume !(node5_~m5~0#1 != ~nomsg~0); {3502#false} is VALID [2022-02-20 18:27:50,034 INFO L290 TraceCheckUtils]: 59: Hoare triple {3502#false} ~mode5~0 := 0; {3502#false} is VALID [2022-02-20 18:27:50,034 INFO L290 TraceCheckUtils]: 60: Hoare triple {3502#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; {3502#false} is VALID [2022-02-20 18:27:50,034 INFO L290 TraceCheckUtils]: 61: Hoare triple {3502#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {3502#false} is VALID [2022-02-20 18:27:50,034 INFO L290 TraceCheckUtils]: 62: Hoare triple {3502#false} check_#res#1 := check_~tmp~1#1; {3502#false} is VALID [2022-02-20 18:27:50,034 INFO L290 TraceCheckUtils]: 63: Hoare triple {3502#false} main_#t~ret40#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~c1~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {3502#false} is VALID [2022-02-20 18:27:50,035 INFO L290 TraceCheckUtils]: 64: Hoare triple {3502#false} assume 0 == assert_~arg#1 % 256; {3502#false} is VALID [2022-02-20 18:27:50,035 INFO L290 TraceCheckUtils]: 65: Hoare triple {3502#false} assume !false; {3502#false} is VALID [2022-02-20 18:27:50,035 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:50,035 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:50,035 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740321977] [2022-02-20 18:27:50,035 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740321977] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:50,036 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:50,036 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:27:50,036 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477603440] [2022-02-20 18:27:50,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:50,036 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:50,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:50,037 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:50,074 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:50,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:27:50,074 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:50,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:27:50,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:27:50,074 INFO L87 Difference]: Start difference. First operand 292 states and 443 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:50,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:50,268 INFO L93 Difference]: Finished difference Result 752 states and 1173 transitions. [2022-02-20 18:27:50,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:27:50,269 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:50,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:50,269 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:50,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2022-02-20 18:27:50,271 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:50,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2022-02-20 18:27:50,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 387 transitions. [2022-02-20 18:27:50,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 387 edges. 387 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:50,506 INFO L225 Difference]: With dead ends: 752 [2022-02-20 18:27:50,507 INFO L226 Difference]: Without dead ends: 498 [2022-02-20 18:27:50,507 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,508 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 97 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 342 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,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 342 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,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2022-02-20 18:27:50,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 496. [2022-02-20 18:27:50,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:50,520 INFO L82 GeneralOperation]: Start isEquivalent. First operand 498 states. Second operand has 496 states, 495 states have (on average 1.5414141414141413) internal successors, (763), 495 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have 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,521 INFO L74 IsIncluded]: Start isIncluded. First operand 498 states. Second operand has 496 states, 495 states have (on average 1.5414141414141413) internal successors, (763), 495 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have 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,522 INFO L87 Difference]: Start difference. First operand 498 states. Second operand has 496 states, 495 states have (on average 1.5414141414141413) internal successors, (763), 495 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have 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,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:50,532 INFO L93 Difference]: Finished difference Result 498 states and 764 transitions. [2022-02-20 18:27:50,532 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 764 transitions. [2022-02-20 18:27:50,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:50,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:50,534 INFO L74 IsIncluded]: Start isIncluded. First operand has 496 states, 495 states have (on average 1.5414141414141413) internal successors, (763), 495 states have internal predecessors, (763), 0 states have call successors, (0), 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 498 states. [2022-02-20 18:27:50,535 INFO L87 Difference]: Start difference. First operand has 496 states, 495 states have (on average 1.5414141414141413) internal successors, (763), 495 states have internal predecessors, (763), 0 states have call successors, (0), 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 498 states. [2022-02-20 18:27:50,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:50,545 INFO L93 Difference]: Finished difference Result 498 states and 764 transitions. [2022-02-20 18:27:50,545 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 764 transitions. [2022-02-20 18:27:50,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:50,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:50,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:50,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:50,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 495 states have (on average 1.5414141414141413) internal successors, (763), 495 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have 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,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 763 transitions. [2022-02-20 18:27:50,557 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 763 transitions. Word has length 66 [2022-02-20 18:27:50,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:50,558 INFO L470 AbstractCegarLoop]: Abstraction has 496 states and 763 transitions. [2022-02-20 18:27:50,558 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:50,558 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 763 transitions. [2022-02-20 18:27:50,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 18:27:50,558 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:50,559 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:50,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:27:50,559 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:50,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:50,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1226283954, now seen corresponding path program 1 times [2022-02-20 18:27:50,560 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:50,560 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33960409] [2022-02-20 18:27:50,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:50,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:50,610 INFO L290 TraceCheckUtils]: 0: Hoare triple {5892#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; {5892#true} is VALID [2022-02-20 18:27:50,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {5892#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1, main_#t~post41#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~nondet13#1 && main_#t~nondet13#1 <= 127;~r1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~alive1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~alive2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~send3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~alive3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~alive4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~id5~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~st5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~send5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~mode5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~alive5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {5892#true} is VALID [2022-02-20 18:27:50,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {5892#true} assume 0 == ~r1~0; {5892#true} is VALID [2022-02-20 18:27:50,610 INFO L290 TraceCheckUtils]: 3: Hoare triple {5892#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {5892#true} is VALID [2022-02-20 18:27:50,610 INFO L290 TraceCheckUtils]: 4: Hoare triple {5892#true} assume ~id1~0 >= 0; {5892#true} is VALID [2022-02-20 18:27:50,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {5892#true} assume 0 == ~st1~0; {5892#true} is VALID [2022-02-20 18:27:50,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {5892#true} assume ~send1~0 == ~id1~0; {5892#true} is VALID [2022-02-20 18:27:50,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {5892#true} assume 0 == ~mode1~0 % 256; {5892#true} is VALID [2022-02-20 18:27:50,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {5892#true} assume ~id2~0 >= 0; {5892#true} is VALID [2022-02-20 18:27:50,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {5892#true} assume 0 == ~st2~0; {5892#true} is VALID [2022-02-20 18:27:50,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {5892#true} assume ~send2~0 == ~id2~0; {5892#true} is VALID [2022-02-20 18:27:50,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {5892#true} assume 0 == ~mode2~0 % 256; {5892#true} is VALID [2022-02-20 18:27:50,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {5892#true} assume ~id3~0 >= 0; {5892#true} is VALID [2022-02-20 18:27:50,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {5892#true} assume 0 == ~st3~0; {5892#true} is VALID [2022-02-20 18:27:50,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {5892#true} assume ~send3~0 == ~id3~0; {5892#true} is VALID [2022-02-20 18:27:50,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {5892#true} assume 0 == ~mode3~0 % 256; {5892#true} is VALID [2022-02-20 18:27:50,612 INFO L290 TraceCheckUtils]: 16: Hoare triple {5892#true} assume ~id4~0 >= 0; {5892#true} is VALID [2022-02-20 18:27:50,612 INFO L290 TraceCheckUtils]: 17: Hoare triple {5892#true} assume 0 == ~st4~0; {5892#true} is VALID [2022-02-20 18:27:50,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {5892#true} assume ~send4~0 == ~id4~0; {5892#true} is VALID [2022-02-20 18:27:50,612 INFO L290 TraceCheckUtils]: 19: Hoare triple {5892#true} assume 0 == ~mode4~0 % 256; {5892#true} is VALID [2022-02-20 18:27:50,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {5892#true} assume ~id5~0 >= 0; {5892#true} is VALID [2022-02-20 18:27:50,612 INFO L290 TraceCheckUtils]: 21: Hoare triple {5892#true} assume 0 == ~st5~0; {5892#true} is VALID [2022-02-20 18:27:50,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {5892#true} assume ~send5~0 == ~id5~0; {5892#true} is VALID [2022-02-20 18:27:50,613 INFO L290 TraceCheckUtils]: 23: Hoare triple {5892#true} assume 0 == ~mode5~0 % 256; {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:50,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:50,614 INFO L290 TraceCheckUtils]: 25: Hoare triple {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:50,614 INFO L290 TraceCheckUtils]: 26: Hoare triple {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:50,614 INFO L290 TraceCheckUtils]: 27: Hoare triple {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:50,615 INFO L290 TraceCheckUtils]: 28: Hoare triple {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:50,615 INFO L290 TraceCheckUtils]: 29: Hoare triple {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:50,616 INFO L290 TraceCheckUtils]: 30: Hoare triple {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:50,616 INFO L290 TraceCheckUtils]: 31: Hoare triple {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:50,616 INFO L290 TraceCheckUtils]: 32: Hoare triple {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:50,617 INFO L290 TraceCheckUtils]: 33: Hoare triple {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:50,617 INFO L290 TraceCheckUtils]: 34: Hoare triple {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:50,617 INFO L290 TraceCheckUtils]: 35: Hoare triple {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main_#t~ret39#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret39#1 && main_#t~ret39#1 <= 2147483647;main_~i2~0#1 := main_#t~ret39#1;havoc main_#t~ret39#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:50,618 INFO L290 TraceCheckUtils]: 36: Hoare triple {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:50,618 INFO L290 TraceCheckUtils]: 37: Hoare triple {5894#(= (+ (* (- 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; {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:50,618 INFO L290 TraceCheckUtils]: 38: Hoare triple {5894#(= (+ (* (- 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_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:50,619 INFO L290 TraceCheckUtils]: 39: Hoare triple {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:50,619 INFO L290 TraceCheckUtils]: 40: Hoare triple {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~alive1~0 % 256); {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:50,619 INFO L290 TraceCheckUtils]: 41: Hoare triple {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode1~0 := 1; {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:50,620 INFO L290 TraceCheckUtils]: 42: Hoare triple {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:50,620 INFO L290 TraceCheckUtils]: 43: Hoare triple {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:50,621 INFO L290 TraceCheckUtils]: 44: Hoare triple {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~alive2~0 % 256); {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:50,621 INFO L290 TraceCheckUtils]: 45: Hoare triple {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send2~0 != ~id2~0); {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:50,621 INFO L290 TraceCheckUtils]: 46: Hoare triple {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode2~0 := 1; {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:50,622 INFO L290 TraceCheckUtils]: 47: Hoare triple {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:50,622 INFO L290 TraceCheckUtils]: 48: Hoare triple {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:50,622 INFO L290 TraceCheckUtils]: 49: Hoare triple {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~alive3~0 % 256); {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:50,623 INFO L290 TraceCheckUtils]: 50: Hoare triple {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send3~0 != ~id3~0); {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:50,623 INFO L290 TraceCheckUtils]: 51: Hoare triple {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode3~0 := 1; {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:50,623 INFO L290 TraceCheckUtils]: 52: Hoare triple {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:50,624 INFO L290 TraceCheckUtils]: 53: Hoare triple {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:50,624 INFO L290 TraceCheckUtils]: 54: Hoare triple {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~alive4~0 % 256); {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:50,624 INFO L290 TraceCheckUtils]: 55: Hoare triple {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send4~0 != ~id4~0); {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:50,625 INFO L290 TraceCheckUtils]: 56: Hoare triple {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~mode4~0 := 1; {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:50,625 INFO L290 TraceCheckUtils]: 57: Hoare triple {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {5894#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:27:50,626 INFO L290 TraceCheckUtils]: 58: Hoare triple {5894#(= (+ (* (- 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; {5893#false} is VALID [2022-02-20 18:27:50,626 INFO L290 TraceCheckUtils]: 59: Hoare triple {5893#false} assume !(node5_~m5~0#1 != ~nomsg~0); {5893#false} is VALID [2022-02-20 18:27:50,626 INFO L290 TraceCheckUtils]: 60: Hoare triple {5893#false} ~mode5~0 := 0; {5893#false} is VALID [2022-02-20 18:27:50,626 INFO L290 TraceCheckUtils]: 61: Hoare triple {5893#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; {5893#false} is VALID [2022-02-20 18:27:50,626 INFO L290 TraceCheckUtils]: 62: Hoare triple {5893#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {5893#false} is VALID [2022-02-20 18:27:50,626 INFO L290 TraceCheckUtils]: 63: Hoare triple {5893#false} check_#res#1 := check_~tmp~1#1; {5893#false} is VALID [2022-02-20 18:27:50,626 INFO L290 TraceCheckUtils]: 64: Hoare triple {5893#false} main_#t~ret40#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~c1~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {5893#false} is VALID [2022-02-20 18:27:50,626 INFO L290 TraceCheckUtils]: 65: Hoare triple {5893#false} assume 0 == assert_~arg#1 % 256; {5893#false} is VALID [2022-02-20 18:27:50,626 INFO L290 TraceCheckUtils]: 66: Hoare triple {5893#false} assume !false; {5893#false} is VALID [2022-02-20 18:27:50,627 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:50,627 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:50,627 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33960409] [2022-02-20 18:27:50,627 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33960409] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:50,627 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:50,627 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:27:50,628 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150493845] [2022-02-20 18:27:50,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:50,628 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:50,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:50,629 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:50,665 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:50,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:27:50,665 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:50,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:27:50,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:27:50,666 INFO L87 Difference]: Start difference. First operand 496 states and 763 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:50,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:50,915 INFO L93 Difference]: Finished difference Result 1316 states and 2053 transitions. [2022-02-20 18:27:50,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:27:50,916 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:50,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:50,916 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:50,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2022-02-20 18:27:50,918 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:50,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2022-02-20 18:27:50,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 387 transitions. [2022-02-20 18:27:51,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 387 edges. 387 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:51,166 INFO L225 Difference]: With dead ends: 1316 [2022-02-20 18:27:51,167 INFO L226 Difference]: Without dead ends: 858 [2022-02-20 18:27:51,167 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:51,168 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 92 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 333 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:51,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 333 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:51,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2022-02-20 18:27:51,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 856. [2022-02-20 18:27:51,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:51,186 INFO L82 GeneralOperation]: Start isEquivalent. First operand 858 states. Second operand has 856 states, 855 states have (on average 1.5426900584795322) internal successors, (1319), 855 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states have 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,187 INFO L74 IsIncluded]: Start isIncluded. First operand 858 states. Second operand has 856 states, 855 states have (on average 1.5426900584795322) internal successors, (1319), 855 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states have 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,188 INFO L87 Difference]: Start difference. First operand 858 states. Second operand has 856 states, 855 states have (on average 1.5426900584795322) internal successors, (1319), 855 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states have 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,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:51,212 INFO L93 Difference]: Finished difference Result 858 states and 1320 transitions. [2022-02-20 18:27:51,213 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1320 transitions. [2022-02-20 18:27:51,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:51,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:51,215 INFO L74 IsIncluded]: Start isIncluded. First operand has 856 states, 855 states have (on average 1.5426900584795322) internal successors, (1319), 855 states have internal predecessors, (1319), 0 states have call successors, (0), 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 858 states. [2022-02-20 18:27:51,216 INFO L87 Difference]: Start difference. First operand has 856 states, 855 states have (on average 1.5426900584795322) internal successors, (1319), 855 states have internal predecessors, (1319), 0 states have call successors, (0), 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 858 states. [2022-02-20 18:27:51,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:51,242 INFO L93 Difference]: Finished difference Result 858 states and 1320 transitions. [2022-02-20 18:27:51,242 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1320 transitions. [2022-02-20 18:27:51,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:51,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:51,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:51,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:51,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 855 states have (on average 1.5426900584795322) internal successors, (1319), 855 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states have 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,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1319 transitions. [2022-02-20 18:27:51,275 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1319 transitions. Word has length 67 [2022-02-20 18:27:51,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:51,275 INFO L470 AbstractCegarLoop]: Abstraction has 856 states and 1319 transitions. [2022-02-20 18:27:51,276 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:51,276 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1319 transitions. [2022-02-20 18:27:51,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 18:27:51,276 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:51,276 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:51,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:27:51,277 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:51,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:51,277 INFO L85 PathProgramCache]: Analyzing trace with hash 211928158, now seen corresponding path program 1 times [2022-02-20 18:27:51,277 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:51,277 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258152594] [2022-02-20 18:27:51,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:51,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:51,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {10067#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; {10067#true} is VALID [2022-02-20 18:27:51,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {10067#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1, main_#t~post41#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~nondet13#1 && main_#t~nondet13#1 <= 127;~r1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~alive1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~alive2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~send3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~alive3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~alive4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~id5~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~st5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~send5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~mode5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~alive5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {10067#true} is VALID [2022-02-20 18:27:51,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {10067#true} assume 0 == ~r1~0; {10067#true} is VALID [2022-02-20 18:27:51,353 INFO L290 TraceCheckUtils]: 3: Hoare triple {10067#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {10067#true} is VALID [2022-02-20 18:27:51,353 INFO L290 TraceCheckUtils]: 4: Hoare triple {10067#true} assume ~id1~0 >= 0; {10067#true} is VALID [2022-02-20 18:27:51,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {10067#true} assume 0 == ~st1~0; {10069#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:51,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {10069#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {10069#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:51,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {10069#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {10069#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:51,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {10069#(<= ~st1~0 0)} assume ~id2~0 >= 0; {10069#(<= ~st1~0 0)} is VALID [2022-02-20 18:27:51,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {10069#(<= ~st1~0 0)} assume 0 == ~st2~0; {10070#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,355 INFO L290 TraceCheckUtils]: 10: Hoare triple {10070#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {10070#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {10070#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {10070#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {10070#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {10070#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {10070#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {10071#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {10071#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {10071#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {10071#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {10071#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {10071#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {10071#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,359 INFO L290 TraceCheckUtils]: 17: Hoare triple {10071#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {10072#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,359 INFO L290 TraceCheckUtils]: 18: Hoare triple {10072#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {10072#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,360 INFO L290 TraceCheckUtils]: 19: Hoare triple {10072#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {10072#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,360 INFO L290 TraceCheckUtils]: 20: Hoare triple {10072#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {10072#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,360 INFO L290 TraceCheckUtils]: 21: Hoare triple {10072#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,361 INFO L290 TraceCheckUtils]: 22: Hoare triple {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,361 INFO L290 TraceCheckUtils]: 23: Hoare triple {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,361 INFO L290 TraceCheckUtils]: 24: Hoare triple {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,362 INFO L290 TraceCheckUtils]: 25: Hoare triple {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,362 INFO L290 TraceCheckUtils]: 26: Hoare triple {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,362 INFO L290 TraceCheckUtils]: 27: Hoare triple {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id5~0; {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,363 INFO L290 TraceCheckUtils]: 28: Hoare triple {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,363 INFO L290 TraceCheckUtils]: 29: Hoare triple {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,363 INFO L290 TraceCheckUtils]: 30: Hoare triple {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id5~0; {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,364 INFO L290 TraceCheckUtils]: 31: Hoare triple {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0; {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,364 INFO L290 TraceCheckUtils]: 32: Hoare triple {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id5~0; {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,364 INFO L290 TraceCheckUtils]: 33: Hoare triple {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,365 INFO L290 TraceCheckUtils]: 34: Hoare triple {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,365 INFO L290 TraceCheckUtils]: 35: Hoare triple {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main_#t~ret39#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret39#1 && main_#t~ret39#1 <= 2147483647;main_~i2~0#1 := main_#t~ret39#1;havoc main_#t~ret39#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,365 INFO L290 TraceCheckUtils]: 36: Hoare triple {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,366 INFO L290 TraceCheckUtils]: 37: Hoare triple {10073#(<= (+ ~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; {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,366 INFO L290 TraceCheckUtils]: 38: Hoare triple {10073#(<= (+ ~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_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,366 INFO L290 TraceCheckUtils]: 39: Hoare triple {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,367 INFO L290 TraceCheckUtils]: 40: Hoare triple {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive1~0 % 256); {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,367 INFO L290 TraceCheckUtils]: 41: Hoare triple {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,367 INFO L290 TraceCheckUtils]: 42: Hoare triple {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,368 INFO L290 TraceCheckUtils]: 43: Hoare triple {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,368 INFO L290 TraceCheckUtils]: 44: Hoare triple {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive2~0 % 256); {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,370 INFO L290 TraceCheckUtils]: 45: Hoare triple {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send2~0 != ~id2~0); {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,370 INFO L290 TraceCheckUtils]: 46: Hoare triple {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,373 INFO L290 TraceCheckUtils]: 47: Hoare triple {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,374 INFO L290 TraceCheckUtils]: 48: Hoare triple {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,374 INFO L290 TraceCheckUtils]: 49: Hoare triple {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive3~0 % 256); {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,374 INFO L290 TraceCheckUtils]: 50: Hoare triple {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~id3~0); {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,375 INFO L290 TraceCheckUtils]: 51: Hoare triple {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,375 INFO L290 TraceCheckUtils]: 52: Hoare triple {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,375 INFO L290 TraceCheckUtils]: 53: Hoare triple {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,376 INFO L290 TraceCheckUtils]: 54: Hoare triple {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive4~0 % 256); {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,376 INFO L290 TraceCheckUtils]: 55: Hoare triple {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~id4~0); {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,376 INFO L290 TraceCheckUtils]: 56: Hoare triple {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode4~0 := 1; {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,377 INFO L290 TraceCheckUtils]: 57: Hoare triple {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,377 INFO L290 TraceCheckUtils]: 58: Hoare triple {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode5~0 % 256); {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,377 INFO L290 TraceCheckUtils]: 59: Hoare triple {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~alive5~0 % 256); {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,378 INFO L290 TraceCheckUtils]: 60: Hoare triple {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send5~0 != ~id5~0); {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,378 INFO L290 TraceCheckUtils]: 61: Hoare triple {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~mode5~0 := 1; {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,379 INFO L290 TraceCheckUtils]: 62: Hoare triple {10073#(<= (+ ~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; {10073#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:27:51,379 INFO L290 TraceCheckUtils]: 63: Hoare triple {10073#(<= (+ ~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; {10068#false} is VALID [2022-02-20 18:27:51,379 INFO L290 TraceCheckUtils]: 64: Hoare triple {10068#false} check_#res#1 := check_~tmp~1#1; {10068#false} is VALID [2022-02-20 18:27:51,379 INFO L290 TraceCheckUtils]: 65: Hoare triple {10068#false} main_#t~ret40#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~c1~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {10068#false} is VALID [2022-02-20 18:27:51,379 INFO L290 TraceCheckUtils]: 66: Hoare triple {10068#false} assume 0 == assert_~arg#1 % 256; {10068#false} is VALID [2022-02-20 18:27:51,379 INFO L290 TraceCheckUtils]: 67: Hoare triple {10068#false} assume !false; {10068#false} is VALID [2022-02-20 18:27:51,380 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,380 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:51,380 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258152594] [2022-02-20 18:27:51,380 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258152594] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:51,380 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:51,380 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:27:51,380 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108402136] [2022-02-20 18:27:51,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:51,381 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-02-20 18:27:51,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:51,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:51,418 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:51,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:27:51,418 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:51,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:27:51,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:27:51,419 INFO L87 Difference]: Start difference. First operand 856 states and 1319 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:53,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:53,949 INFO L93 Difference]: Finished difference Result 5764 states and 9005 transitions. [2022-02-20 18:27:53,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:27:53,950 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-02-20 18:27:53,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:27:53,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:53,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 899 transitions. [2022-02-20 18:27:53,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:53,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 899 transitions. [2022-02-20 18:27:53,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 899 transitions. [2022-02-20 18:27:54,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 899 edges. 899 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:27:55,235 INFO L225 Difference]: With dead ends: 5764 [2022-02-20 18:27:55,235 INFO L226 Difference]: Without dead ends: 4946 [2022-02-20 18:27:55,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:27:55,237 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 1263 mSDsluCounter, 1643 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1263 SdHoareTripleChecker+Valid, 1802 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:27:55,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1263 Valid, 1802 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:27:55,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4946 states. [2022-02-20 18:27:55,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4946 to 1672. [2022-02-20 18:27:55,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:27:55,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4946 states. Second operand has 1672 states, 1671 states have (on average 1.5362058647516457) internal successors, (2567), 1671 states have internal predecessors, (2567), 0 states have call successors, (0), 0 states have 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:55,742 INFO L74 IsIncluded]: Start isIncluded. First operand 4946 states. Second operand has 1672 states, 1671 states have (on average 1.5362058647516457) internal successors, (2567), 1671 states have internal predecessors, (2567), 0 states have call successors, (0), 0 states have 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:55,744 INFO L87 Difference]: Start difference. First operand 4946 states. Second operand has 1672 states, 1671 states have (on average 1.5362058647516457) internal successors, (2567), 1671 states have internal predecessors, (2567), 0 states have call successors, (0), 0 states have 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:56,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:56,437 INFO L93 Difference]: Finished difference Result 4946 states and 7692 transitions. [2022-02-20 18:27:56,437 INFO L276 IsEmpty]: Start isEmpty. Operand 4946 states and 7692 transitions. [2022-02-20 18:27:56,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:56,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:56,446 INFO L74 IsIncluded]: Start isIncluded. First operand has 1672 states, 1671 states have (on average 1.5362058647516457) internal successors, (2567), 1671 states have internal predecessors, (2567), 0 states have call successors, (0), 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 4946 states. [2022-02-20 18:27:56,447 INFO L87 Difference]: Start difference. First operand has 1672 states, 1671 states have (on average 1.5362058647516457) internal successors, (2567), 1671 states have internal predecessors, (2567), 0 states have call successors, (0), 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 4946 states. [2022-02-20 18:27:57,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:27:57,136 INFO L93 Difference]: Finished difference Result 4946 states and 7692 transitions. [2022-02-20 18:27:57,136 INFO L276 IsEmpty]: Start isEmpty. Operand 4946 states and 7692 transitions. [2022-02-20 18:27:57,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:27:57,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:27:57,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:27:57,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:27:57,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1671 states have (on average 1.5362058647516457) internal successors, (2567), 1671 states have internal predecessors, (2567), 0 states have call successors, (0), 0 states have 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,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2567 transitions. [2022-02-20 18:27:57,232 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2567 transitions. Word has length 68 [2022-02-20 18:27:57,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:27:57,232 INFO L470 AbstractCegarLoop]: Abstraction has 1672 states and 2567 transitions. [2022-02-20 18:27:57,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:27:57,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2567 transitions. [2022-02-20 18:27:57,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 18:27:57,233 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:27:57,233 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:57,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:27:57,233 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:27:57,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:27:57,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1891482376, now seen corresponding path program 1 times [2022-02-20 18:27:57,234 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:27:57,234 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89768417] [2022-02-20 18:27:57,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:27:57,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:27:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:27:57,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {28423#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; {28423#true} is VALID [2022-02-20 18:27:57,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {28423#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1, main_#t~post41#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~nondet13#1 && main_#t~nondet13#1 <= 127;~r1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~alive1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~alive2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~send3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~alive3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~alive4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~id5~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~st5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~send5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~mode5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~alive5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {28423#true} is VALID [2022-02-20 18:27:57,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {28423#true} assume 0 == ~r1~0; {28423#true} is VALID [2022-02-20 18:27:57,348 INFO L290 TraceCheckUtils]: 3: Hoare triple {28423#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {28425#(<= (+ (* (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:27:57,349 INFO L290 TraceCheckUtils]: 4: Hoare triple {28425#(<= (+ (* (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; {28425#(<= (+ (* (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:27:57,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {28425#(<= (+ (* (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; {28425#(<= (+ (* (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:27:57,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {28425#(<= (+ (* (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; {28425#(<= (+ (* (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:27:57,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {28425#(<= (+ (* (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; {28425#(<= (+ (* (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:27:57,350 INFO L290 TraceCheckUtils]: 8: Hoare triple {28425#(<= (+ (* (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; {28425#(<= (+ (* (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:27:57,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {28425#(<= (+ (* (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; {28425#(<= (+ (* (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:27:57,351 INFO L290 TraceCheckUtils]: 10: Hoare triple {28425#(<= (+ (* (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; {28425#(<= (+ (* (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:27:57,352 INFO L290 TraceCheckUtils]: 11: Hoare triple {28425#(<= (+ (* (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; {28425#(<= (+ (* (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:27:57,352 INFO L290 TraceCheckUtils]: 12: Hoare triple {28425#(<= (+ (* (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; {28425#(<= (+ (* (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:27:57,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {28425#(<= (+ (* (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; {28425#(<= (+ (* (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:27:57,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {28425#(<= (+ (* (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; {28425#(<= (+ (* (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:27:57,353 INFO L290 TraceCheckUtils]: 15: Hoare triple {28425#(<= (+ (* (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; {28425#(<= (+ (* (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:27:57,354 INFO L290 TraceCheckUtils]: 16: Hoare triple {28425#(<= (+ (* (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; {28425#(<= (+ (* (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:27:57,354 INFO L290 TraceCheckUtils]: 17: Hoare triple {28425#(<= (+ (* (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; {28425#(<= (+ (* (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:27:57,354 INFO L290 TraceCheckUtils]: 18: Hoare triple {28425#(<= (+ (* (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; {28425#(<= (+ (* (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:27:57,355 INFO L290 TraceCheckUtils]: 19: Hoare triple {28425#(<= (+ (* (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; {28425#(<= (+ (* (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:27:57,355 INFO L290 TraceCheckUtils]: 20: Hoare triple {28425#(<= (+ (* (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; {28425#(<= (+ (* (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:27:57,356 INFO L290 TraceCheckUtils]: 21: Hoare triple {28425#(<= (+ (* (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; {28425#(<= (+ (* (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:27:57,356 INFO L290 TraceCheckUtils]: 22: Hoare triple {28425#(<= (+ (* (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; {28425#(<= (+ (* (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:27:57,357 INFO L290 TraceCheckUtils]: 23: Hoare triple {28425#(<= (+ (* (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; {28425#(<= (+ (* (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:27:57,357 INFO L290 TraceCheckUtils]: 24: Hoare triple {28425#(<= (+ (* (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; {28425#(<= (+ (* (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:27:57,357 INFO L290 TraceCheckUtils]: 25: Hoare triple {28425#(<= (+ (* (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; {28425#(<= (+ (* (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:27:57,358 INFO L290 TraceCheckUtils]: 26: Hoare triple {28425#(<= (+ (* (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; {28425#(<= (+ (* (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:27:57,358 INFO L290 TraceCheckUtils]: 27: Hoare triple {28425#(<= (+ (* (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; {28425#(<= (+ (* (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:27:57,359 INFO L290 TraceCheckUtils]: 28: Hoare triple {28425#(<= (+ (* (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; {28425#(<= (+ (* (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:27:57,359 INFO L290 TraceCheckUtils]: 29: Hoare triple {28425#(<= (+ (* (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; {28425#(<= (+ (* (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:27:57,360 INFO L290 TraceCheckUtils]: 30: Hoare triple {28425#(<= (+ (* (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; {28425#(<= (+ (* (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:27:57,360 INFO L290 TraceCheckUtils]: 31: Hoare triple {28425#(<= (+ (* (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; {28425#(<= (+ (* (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:27:57,360 INFO L290 TraceCheckUtils]: 32: Hoare triple {28425#(<= (+ (* (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; {28425#(<= (+ (* (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:27:57,361 INFO L290 TraceCheckUtils]: 33: Hoare triple {28425#(<= (+ (* (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; {28425#(<= (+ (* (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:27:57,361 INFO L290 TraceCheckUtils]: 34: Hoare triple {28425#(<= (+ (* (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; {28425#(<= (+ (* (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:27:57,362 INFO L290 TraceCheckUtils]: 35: Hoare triple {28425#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) (* 256 (div ~alive1~0 256)) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0 ~alive1~0))} main_#t~ret39#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret39#1 && main_#t~ret39#1 <= 2147483647;main_~i2~0#1 := main_#t~ret39#1;havoc main_#t~ret39#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {28425#(<= (+ (* (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:27:57,362 INFO L290 TraceCheckUtils]: 36: Hoare triple {28425#(<= (+ (* (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); {28425#(<= (+ (* (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:27:57,363 INFO L290 TraceCheckUtils]: 37: Hoare triple {28425#(<= (+ (* (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; {28425#(<= (+ (* (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:27:57,363 INFO L290 TraceCheckUtils]: 38: Hoare triple {28425#(<= (+ (* (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_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {28425#(<= (+ (* (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:27:57,364 INFO L290 TraceCheckUtils]: 39: Hoare triple {28425#(<= (+ (* (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); {28425#(<= (+ (* (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:27:57,364 INFO L290 TraceCheckUtils]: 40: Hoare triple {28425#(<= (+ (* (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); {28426#(<= (+ (* (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:27:57,365 INFO L290 TraceCheckUtils]: 41: Hoare triple {28426#(<= (+ (* (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; {28426#(<= (+ (* (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:27:57,365 INFO L290 TraceCheckUtils]: 42: Hoare triple {28426#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* 256 (div ~alive2~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0 ~alive2~0))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {28426#(<= (+ (* (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:27:57,366 INFO L290 TraceCheckUtils]: 43: Hoare triple {28426#(<= (+ (* (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); {28426#(<= (+ (* (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:27:57,366 INFO L290 TraceCheckUtils]: 44: Hoare triple {28426#(<= (+ (* (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); {28427#(<= (+ (* (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:27:57,367 INFO L290 TraceCheckUtils]: 45: Hoare triple {28427#(<= (+ (* (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); {28427#(<= (+ (* (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:27:57,367 INFO L290 TraceCheckUtils]: 46: Hoare triple {28427#(<= (+ (* (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; {28427#(<= (+ (* (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:27:57,367 INFO L290 TraceCheckUtils]: 47: Hoare triple {28427#(<= (+ (* (div ~alive3~0 256) 256) (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0 ~alive3~0))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {28427#(<= (+ (* (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:27:57,374 INFO L290 TraceCheckUtils]: 48: Hoare triple {28427#(<= (+ (* (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); {28427#(<= (+ (* (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:27:57,375 INFO L290 TraceCheckUtils]: 49: Hoare triple {28427#(<= (+ (* (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); {28428#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:27:57,375 INFO L290 TraceCheckUtils]: 50: Hoare triple {28428#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} assume !(~send3~0 != ~id3~0); {28428#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:27:57,375 INFO L290 TraceCheckUtils]: 51: Hoare triple {28428#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} ~mode3~0 := 1; {28428#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:27:57,375 INFO L290 TraceCheckUtils]: 52: Hoare triple {28428#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {28428#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:27:57,376 INFO L290 TraceCheckUtils]: 53: Hoare triple {28428#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} assume !(0 != ~mode4~0 % 256); {28428#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} is VALID [2022-02-20 18:27:57,376 INFO L290 TraceCheckUtils]: 54: Hoare triple {28428#(<= (+ (* 256 (div ~alive4~0 256)) (* (div ~alive5~0 256) 256) 1) (+ ~alive5~0 ~alive4~0))} assume !(0 != ~alive4~0 % 256); {28429#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID [2022-02-20 18:27:57,377 INFO L290 TraceCheckUtils]: 55: Hoare triple {28429#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} assume !(~send4~0 != ~id4~0); {28429#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID [2022-02-20 18:27:57,377 INFO L290 TraceCheckUtils]: 56: Hoare triple {28429#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} ~mode4~0 := 1; {28429#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID [2022-02-20 18:27:57,377 INFO L290 TraceCheckUtils]: 57: Hoare triple {28429#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {28429#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID [2022-02-20 18:27:57,377 INFO L290 TraceCheckUtils]: 58: Hoare triple {28429#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} assume !(0 != ~mode5~0 % 256); {28429#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} is VALID [2022-02-20 18:27:57,378 INFO L290 TraceCheckUtils]: 59: Hoare triple {28429#(<= (+ (* (div ~alive5~0 256) 256) 1) ~alive5~0)} assume !(0 != ~alive5~0 % 256); {28424#false} is VALID [2022-02-20 18:27:57,378 INFO L290 TraceCheckUtils]: 60: Hoare triple {28424#false} assume !(~send5~0 != ~id5~0); {28424#false} is VALID [2022-02-20 18:27:57,378 INFO L290 TraceCheckUtils]: 61: Hoare triple {28424#false} ~mode5~0 := 1; {28424#false} is VALID [2022-02-20 18:27:57,378 INFO L290 TraceCheckUtils]: 62: Hoare triple {28424#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; {28424#false} is VALID [2022-02-20 18:27:57,378 INFO L290 TraceCheckUtils]: 63: Hoare triple {28424#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {28424#false} is VALID [2022-02-20 18:27:57,378 INFO L290 TraceCheckUtils]: 64: Hoare triple {28424#false} assume ~r1~0 < 5;check_~tmp~1#1 := 1; {28424#false} is VALID [2022-02-20 18:27:57,378 INFO L290 TraceCheckUtils]: 65: Hoare triple {28424#false} check_#res#1 := check_~tmp~1#1; {28424#false} is VALID [2022-02-20 18:27:57,379 INFO L290 TraceCheckUtils]: 66: Hoare triple {28424#false} main_#t~ret40#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~c1~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {28424#false} is VALID [2022-02-20 18:27:57,379 INFO L290 TraceCheckUtils]: 67: Hoare triple {28424#false} assume 0 == assert_~arg#1 % 256; {28424#false} is VALID [2022-02-20 18:27:57,379 INFO L290 TraceCheckUtils]: 68: Hoare triple {28424#false} assume !false; {28424#false} is VALID [2022-02-20 18:27:57,379 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:57,379 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:27:57,380 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89768417] [2022-02-20 18:27:57,380 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89768417] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:27:57,380 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:27:57,380 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 18:27:57,380 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162283012] [2022-02-20 18:27:57,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:27:57,380 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,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:27:57,381 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:57,432 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:57,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 18:27:57,432 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:27:57,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 18:27:57,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:27:57,433 INFO L87 Difference]: Start difference. First operand 1672 states and 2567 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:03,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:03,673 INFO L93 Difference]: Finished difference Result 9010 states and 13772 transitions. [2022-02-20 18:28:03,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:28:03,674 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-02-20 18:28:03,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:03,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:03,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 686 transitions. [2022-02-20 18:28:03,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:03,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 686 transitions. [2022-02-20 18:28:03,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 686 transitions. [2022-02-20 18:28:04,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 686 edges. 686 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:05,856 INFO L225 Difference]: With dead ends: 9010 [2022-02-20 18:28:05,856 INFO L226 Difference]: Without dead ends: 7376 [2022-02-20 18:28:05,858 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:05,859 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 792 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:28:05,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [792 Valid, 687 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:28:05,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7376 states. [2022-02-20 18:28:09,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7376 to 7368. [2022-02-20 18:28:09,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:09,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7376 states. Second operand has 7368 states, 7367 states have (on average 1.5212433826523686) internal successors, (11207), 7367 states have internal predecessors, (11207), 0 states have call successors, (0), 0 states have 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:09,231 INFO L74 IsIncluded]: Start isIncluded. First operand 7376 states. Second operand has 7368 states, 7367 states have (on average 1.5212433826523686) internal successors, (11207), 7367 states have internal predecessors, (11207), 0 states have call successors, (0), 0 states have 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:09,238 INFO L87 Difference]: Start difference. First operand 7376 states. Second operand has 7368 states, 7367 states have (on average 1.5212433826523686) internal successors, (11207), 7367 states have internal predecessors, (11207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:28:10,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:10,885 INFO L93 Difference]: Finished difference Result 7376 states and 11211 transitions. [2022-02-20 18:28:10,885 INFO L276 IsEmpty]: Start isEmpty. Operand 7376 states and 11211 transitions. [2022-02-20 18:28:10,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:10,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:10,919 INFO L74 IsIncluded]: Start isIncluded. First operand has 7368 states, 7367 states have (on average 1.5212433826523686) internal successors, (11207), 7367 states have internal predecessors, (11207), 0 states have call successors, (0), 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 7376 states. [2022-02-20 18:28:10,927 INFO L87 Difference]: Start difference. First operand has 7368 states, 7367 states have (on average 1.5212433826523686) internal successors, (11207), 7367 states have internal predecessors, (11207), 0 states have call successors, (0), 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 7376 states. [2022-02-20 18:28:12,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:12,647 INFO L93 Difference]: Finished difference Result 7376 states and 11211 transitions. [2022-02-20 18:28:12,647 INFO L276 IsEmpty]: Start isEmpty. Operand 7376 states and 11211 transitions. [2022-02-20 18:28:12,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:12,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:12,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:12,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:12,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7368 states, 7367 states have (on average 1.5212433826523686) internal successors, (11207), 7367 states have internal predecessors, (11207), 0 states have call successors, (0), 0 states have 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:14,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7368 states to 7368 states and 11207 transitions. [2022-02-20 18:28:14,475 INFO L78 Accepts]: Start accepts. Automaton has 7368 states and 11207 transitions. Word has length 69 [2022-02-20 18:28:14,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:28:14,476 INFO L470 AbstractCegarLoop]: Abstraction has 7368 states and 11207 transitions. [2022-02-20 18:28:14,476 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:14,476 INFO L276 IsEmpty]: Start isEmpty. Operand 7368 states and 11207 transitions. [2022-02-20 18:28:14,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 18:28:14,477 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:28:14,477 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:28:14,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:28:14,477 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:28:14,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:28:14,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1121612062, now seen corresponding path program 1 times [2022-02-20 18:28:14,478 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:28:14,478 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834641086] [2022-02-20 18:28:14,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:28:14,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:28:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:28:14,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {62028#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; {62028#true} is VALID [2022-02-20 18:28:14,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {62028#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1, main_#t~post41#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~nondet13#1 && main_#t~nondet13#1 <= 127;~r1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~alive1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~alive2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~send3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~alive3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~alive4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~id5~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~st5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~send5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~mode5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~alive5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {62028#true} is VALID [2022-02-20 18:28:14,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {62028#true} assume 0 == ~r1~0; {62028#true} is VALID [2022-02-20 18:28:14,510 INFO L290 TraceCheckUtils]: 3: Hoare triple {62028#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {62028#true} is VALID [2022-02-20 18:28:14,510 INFO L290 TraceCheckUtils]: 4: Hoare triple {62028#true} assume ~id1~0 >= 0; {62028#true} is VALID [2022-02-20 18:28:14,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {62028#true} assume 0 == ~st1~0; {62028#true} is VALID [2022-02-20 18:28:14,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {62028#true} assume ~send1~0 == ~id1~0; {62028#true} is VALID [2022-02-20 18:28:14,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {62028#true} assume 0 == ~mode1~0 % 256; {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:14,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:14,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:14,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:14,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:14,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:14,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:14,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:14,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:14,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:14,514 INFO L290 TraceCheckUtils]: 17: Hoare triple {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:14,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:14,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:14,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:14,515 INFO L290 TraceCheckUtils]: 21: Hoare triple {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:14,515 INFO L290 TraceCheckUtils]: 22: Hoare triple {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:14,516 INFO L290 TraceCheckUtils]: 23: Hoare triple {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:14,516 INFO L290 TraceCheckUtils]: 24: Hoare triple {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:14,516 INFO L290 TraceCheckUtils]: 25: Hoare triple {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:14,516 INFO L290 TraceCheckUtils]: 26: Hoare triple {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:14,517 INFO L290 TraceCheckUtils]: 27: Hoare triple {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:14,517 INFO L290 TraceCheckUtils]: 28: Hoare triple {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:14,517 INFO L290 TraceCheckUtils]: 29: Hoare triple {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:14,518 INFO L290 TraceCheckUtils]: 30: Hoare triple {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:14,518 INFO L290 TraceCheckUtils]: 31: Hoare triple {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:14,518 INFO L290 TraceCheckUtils]: 32: Hoare triple {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:14,519 INFO L290 TraceCheckUtils]: 33: Hoare triple {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:14,519 INFO L290 TraceCheckUtils]: 34: Hoare triple {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:14,519 INFO L290 TraceCheckUtils]: 35: Hoare triple {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret39#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret39#1 && main_#t~ret39#1 <= 2147483647;main_~i2~0#1 := main_#t~ret39#1;havoc main_#t~ret39#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:14,520 INFO L290 TraceCheckUtils]: 36: Hoare triple {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:14,520 INFO L290 TraceCheckUtils]: 37: Hoare triple {62030#(= (+ (* (- 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; {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:14,520 INFO L290 TraceCheckUtils]: 38: Hoare triple {62030#(= (+ (* (- 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_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {62030#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:28:14,521 INFO L290 TraceCheckUtils]: 39: Hoare triple {62030#(= (+ (* (- 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; {62029#false} is VALID [2022-02-20 18:28:14,521 INFO L290 TraceCheckUtils]: 40: Hoare triple {62029#false} assume !(node1_~m1~0#1 != ~nomsg~0); {62029#false} is VALID [2022-02-20 18:28:14,521 INFO L290 TraceCheckUtils]: 41: Hoare triple {62029#false} ~mode1~0 := 0; {62029#false} is VALID [2022-02-20 18:28:14,521 INFO L290 TraceCheckUtils]: 42: Hoare triple {62029#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {62029#false} is VALID [2022-02-20 18:28:14,521 INFO L290 TraceCheckUtils]: 43: Hoare triple {62029#false} assume !(0 != ~mode2~0 % 256); {62029#false} is VALID [2022-02-20 18:28:14,521 INFO L290 TraceCheckUtils]: 44: Hoare triple {62029#false} assume !(0 != ~alive2~0 % 256); {62029#false} is VALID [2022-02-20 18:28:14,522 INFO L290 TraceCheckUtils]: 45: Hoare triple {62029#false} assume !(~send2~0 != ~id2~0); {62029#false} is VALID [2022-02-20 18:28:14,522 INFO L290 TraceCheckUtils]: 46: Hoare triple {62029#false} ~mode2~0 := 1; {62029#false} is VALID [2022-02-20 18:28:14,522 INFO L290 TraceCheckUtils]: 47: Hoare triple {62029#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {62029#false} is VALID [2022-02-20 18:28:14,522 INFO L290 TraceCheckUtils]: 48: Hoare triple {62029#false} assume !(0 != ~mode3~0 % 256); {62029#false} is VALID [2022-02-20 18:28:14,522 INFO L290 TraceCheckUtils]: 49: Hoare triple {62029#false} assume !(0 != ~alive3~0 % 256); {62029#false} is VALID [2022-02-20 18:28:14,522 INFO L290 TraceCheckUtils]: 50: Hoare triple {62029#false} assume !(~send3~0 != ~id3~0); {62029#false} is VALID [2022-02-20 18:28:14,522 INFO L290 TraceCheckUtils]: 51: Hoare triple {62029#false} ~mode3~0 := 1; {62029#false} is VALID [2022-02-20 18:28:14,522 INFO L290 TraceCheckUtils]: 52: Hoare triple {62029#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {62029#false} is VALID [2022-02-20 18:28:14,522 INFO L290 TraceCheckUtils]: 53: Hoare triple {62029#false} assume !(0 != ~mode4~0 % 256); {62029#false} is VALID [2022-02-20 18:28:14,523 INFO L290 TraceCheckUtils]: 54: Hoare triple {62029#false} assume !(0 != ~alive4~0 % 256); {62029#false} is VALID [2022-02-20 18:28:14,523 INFO L290 TraceCheckUtils]: 55: Hoare triple {62029#false} assume !(~send4~0 != ~id4~0); {62029#false} is VALID [2022-02-20 18:28:14,523 INFO L290 TraceCheckUtils]: 56: Hoare triple {62029#false} ~mode4~0 := 1; {62029#false} is VALID [2022-02-20 18:28:14,523 INFO L290 TraceCheckUtils]: 57: Hoare triple {62029#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {62029#false} is VALID [2022-02-20 18:28:14,523 INFO L290 TraceCheckUtils]: 58: Hoare triple {62029#false} assume !(0 != ~mode5~0 % 256); {62029#false} is VALID [2022-02-20 18:28:14,523 INFO L290 TraceCheckUtils]: 59: Hoare triple {62029#false} assume !(0 != ~alive5~0 % 256); {62029#false} is VALID [2022-02-20 18:28:14,523 INFO L290 TraceCheckUtils]: 60: Hoare triple {62029#false} assume !(~send5~0 != ~id5~0); {62029#false} is VALID [2022-02-20 18:28:14,523 INFO L290 TraceCheckUtils]: 61: Hoare triple {62029#false} ~mode5~0 := 1; {62029#false} is VALID [2022-02-20 18:28:14,524 INFO L290 TraceCheckUtils]: 62: Hoare triple {62029#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; {62029#false} is VALID [2022-02-20 18:28:14,524 INFO L290 TraceCheckUtils]: 63: Hoare triple {62029#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {62029#false} is VALID [2022-02-20 18:28:14,524 INFO L290 TraceCheckUtils]: 64: Hoare triple {62029#false} assume ~r1~0 < 5;check_~tmp~1#1 := 1; {62029#false} is VALID [2022-02-20 18:28:14,524 INFO L290 TraceCheckUtils]: 65: Hoare triple {62029#false} check_#res#1 := check_~tmp~1#1; {62029#false} is VALID [2022-02-20 18:28:14,524 INFO L290 TraceCheckUtils]: 66: Hoare triple {62029#false} main_#t~ret40#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~c1~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {62029#false} is VALID [2022-02-20 18:28:14,524 INFO L290 TraceCheckUtils]: 67: Hoare triple {62029#false} assume 0 == assert_~arg#1 % 256; {62029#false} is VALID [2022-02-20 18:28:14,524 INFO L290 TraceCheckUtils]: 68: Hoare triple {62029#false} assume !false; {62029#false} is VALID [2022-02-20 18:28:14,524 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:14,525 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:28:14,525 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834641086] [2022-02-20 18:28:14,525 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834641086] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:28:14,525 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:28:14,525 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:28:14,525 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000946914] [2022-02-20 18:28:14,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:28:14,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-02-20 18:28:14,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:28:14,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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:14,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:14,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:28:14,585 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:28:14,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:28:14,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:14,586 INFO L87 Difference]: Start difference. First operand 7368 states and 11207 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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:34,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:34,143 INFO L93 Difference]: Finished difference Result 20588 states and 31145 transitions. [2022-02-20 18:28:34,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:28:34,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-02-20 18:28:34,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:28:34,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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:34,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2022-02-20 18:28:34,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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:34,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2022-02-20 18:28:34,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 392 transitions. [2022-02-20 18:28:34,388 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 392 edges. 392 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:28:40,072 INFO L225 Difference]: With dead ends: 20588 [2022-02-20 18:28:40,073 INFO L226 Difference]: Without dead ends: 13258 [2022-02-20 18:28:40,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:28:40,079 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 111 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:28:40,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 384 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:28:40,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13258 states. [2022-02-20 18:28:43,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13258 to 13256. [2022-02-20 18:28:43,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:28:43,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13258 states. Second operand has 13256 states, 13255 states have (on average 1.4949075820445115) internal successors, (19815), 13255 states have internal predecessors, (19815), 0 states have call successors, (0), 0 states have 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:44,002 INFO L74 IsIncluded]: Start isIncluded. First operand 13258 states. Second operand has 13256 states, 13255 states have (on average 1.4949075820445115) internal successors, (19815), 13255 states have internal predecessors, (19815), 0 states have call successors, (0), 0 states have 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:44,013 INFO L87 Difference]: Start difference. First operand 13258 states. Second operand has 13256 states, 13255 states have (on average 1.4949075820445115) internal successors, (19815), 13255 states have internal predecessors, (19815), 0 states have call successors, (0), 0 states have 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:49,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:49,460 INFO L93 Difference]: Finished difference Result 13258 states and 19816 transitions. [2022-02-20 18:28:49,460 INFO L276 IsEmpty]: Start isEmpty. Operand 13258 states and 19816 transitions. [2022-02-20 18:28:49,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:49,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:49,489 INFO L74 IsIncluded]: Start isIncluded. First operand has 13256 states, 13255 states have (on average 1.4949075820445115) internal successors, (19815), 13255 states have internal predecessors, (19815), 0 states have call successors, (0), 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 13258 states. [2022-02-20 18:28:49,500 INFO L87 Difference]: Start difference. First operand has 13256 states, 13255 states have (on average 1.4949075820445115) internal successors, (19815), 13255 states have internal predecessors, (19815), 0 states have call successors, (0), 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 13258 states. [2022-02-20 18:28:54,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:28:54,908 INFO L93 Difference]: Finished difference Result 13258 states and 19816 transitions. [2022-02-20 18:28:54,908 INFO L276 IsEmpty]: Start isEmpty. Operand 13258 states and 19816 transitions. [2022-02-20 18:28:54,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:28:54,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:28:54,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:28:54,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:28:54,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13256 states, 13255 states have (on average 1.4949075820445115) internal successors, (19815), 13255 states have internal predecessors, (19815), 0 states have call successors, (0), 0 states have 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:29:01,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13256 states to 13256 states and 19815 transitions. [2022-02-20 18:29:01,273 INFO L78 Accepts]: Start accepts. Automaton has 13256 states and 19815 transitions. Word has length 69 [2022-02-20 18:29:01,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:29:01,274 INFO L470 AbstractCegarLoop]: Abstraction has 13256 states and 19815 transitions. [2022-02-20 18:29:01,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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:29:01,274 INFO L276 IsEmpty]: Start isEmpty. Operand 13256 states and 19815 transitions. [2022-02-20 18:29:01,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 18:29:01,274 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:29:01,275 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:29:01,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:29:01,275 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:29:01,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:29:01,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1170027667, now seen corresponding path program 1 times [2022-02-20 18:29:01,276 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:29:01,276 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698665498] [2022-02-20 18:29:01,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:29:01,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:29:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:29:01,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {127995#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; {127995#true} is VALID [2022-02-20 18:29:01,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {127995#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1, main_#t~post41#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~nondet13#1 && main_#t~nondet13#1 <= 127;~r1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~id1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~st1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~send1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~alive1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~alive2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~st3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~send3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~alive3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~id4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~st4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~send4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~alive4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~id5~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~st5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~send5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~mode5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~alive5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {127995#true} is VALID [2022-02-20 18:29:01,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {127995#true} assume 0 == ~r1~0; {127995#true} is VALID [2022-02-20 18:29:01,362 INFO L290 TraceCheckUtils]: 3: Hoare triple {127995#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {127995#true} is VALID [2022-02-20 18:29:01,362 INFO L290 TraceCheckUtils]: 4: Hoare triple {127995#true} assume ~id1~0 >= 0; {127995#true} is VALID [2022-02-20 18:29:01,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {127995#true} assume 0 == ~st1~0; {127995#true} is VALID [2022-02-20 18:29:01,362 INFO L290 TraceCheckUtils]: 6: Hoare triple {127995#true} assume ~send1~0 == ~id1~0; {127995#true} is VALID [2022-02-20 18:29:01,362 INFO L290 TraceCheckUtils]: 7: Hoare triple {127995#true} assume 0 == ~mode1~0 % 256; {127995#true} is VALID [2022-02-20 18:29:01,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {127995#true} assume ~id2~0 >= 0; {127995#true} is VALID [2022-02-20 18:29:01,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {127995#true} assume 0 == ~st2~0; {127995#true} is VALID [2022-02-20 18:29:01,363 INFO L290 TraceCheckUtils]: 10: Hoare triple {127995#true} assume ~send2~0 == ~id2~0; {127995#true} is VALID [2022-02-20 18:29:01,363 INFO L290 TraceCheckUtils]: 11: Hoare triple {127995#true} assume 0 == ~mode2~0 % 256; {127995#true} is VALID [2022-02-20 18:29:01,363 INFO L290 TraceCheckUtils]: 12: Hoare triple {127995#true} assume ~id3~0 >= 0; {127995#true} is VALID [2022-02-20 18:29:01,363 INFO L290 TraceCheckUtils]: 13: Hoare triple {127995#true} assume 0 == ~st3~0; {127995#true} is VALID [2022-02-20 18:29:01,363 INFO L290 TraceCheckUtils]: 14: Hoare triple {127995#true} assume ~send3~0 == ~id3~0; {127995#true} is VALID [2022-02-20 18:29:01,363 INFO L290 TraceCheckUtils]: 15: Hoare triple {127995#true} assume 0 == ~mode3~0 % 256; {127995#true} is VALID [2022-02-20 18:29:01,363 INFO L290 TraceCheckUtils]: 16: Hoare triple {127995#true} assume ~id4~0 >= 0; {127995#true} is VALID [2022-02-20 18:29:01,363 INFO L290 TraceCheckUtils]: 17: Hoare triple {127995#true} assume 0 == ~st4~0; {127995#true} is VALID [2022-02-20 18:29:01,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {127995#true} assume ~send4~0 == ~id4~0; {127995#true} is VALID [2022-02-20 18:29:01,364 INFO L290 TraceCheckUtils]: 19: Hoare triple {127995#true} assume 0 == ~mode4~0 % 256; {127995#true} is VALID [2022-02-20 18:29:01,364 INFO L290 TraceCheckUtils]: 20: Hoare triple {127995#true} assume ~id5~0 >= 0; {127995#true} is VALID [2022-02-20 18:29:01,364 INFO L290 TraceCheckUtils]: 21: Hoare triple {127995#true} assume 0 == ~st5~0; {127995#true} is VALID [2022-02-20 18:29:01,364 INFO L290 TraceCheckUtils]: 22: Hoare triple {127995#true} assume ~send5~0 == ~id5~0; {127995#true} is VALID [2022-02-20 18:29:01,364 INFO L290 TraceCheckUtils]: 23: Hoare triple {127995#true} assume 0 == ~mode5~0 % 256; {127995#true} is VALID [2022-02-20 18:29:01,364 INFO L290 TraceCheckUtils]: 24: Hoare triple {127995#true} assume ~id1~0 != ~id2~0; {127995#true} is VALID [2022-02-20 18:29:01,364 INFO L290 TraceCheckUtils]: 25: Hoare triple {127995#true} assume ~id1~0 != ~id3~0; {127995#true} is VALID [2022-02-20 18:29:01,364 INFO L290 TraceCheckUtils]: 26: Hoare triple {127995#true} assume ~id1~0 != ~id4~0; {127995#true} is VALID [2022-02-20 18:29:01,364 INFO L290 TraceCheckUtils]: 27: Hoare triple {127995#true} assume ~id1~0 != ~id5~0; {127995#true} is VALID [2022-02-20 18:29:01,364 INFO L290 TraceCheckUtils]: 28: Hoare triple {127995#true} assume ~id2~0 != ~id3~0; {127995#true} is VALID [2022-02-20 18:29:01,365 INFO L290 TraceCheckUtils]: 29: Hoare triple {127995#true} assume ~id2~0 != ~id4~0; {127995#true} is VALID [2022-02-20 18:29:01,365 INFO L290 TraceCheckUtils]: 30: Hoare triple {127995#true} assume ~id2~0 != ~id5~0; {127995#true} is VALID [2022-02-20 18:29:01,365 INFO L290 TraceCheckUtils]: 31: Hoare triple {127995#true} assume ~id3~0 != ~id4~0; {127995#true} is VALID [2022-02-20 18:29:01,365 INFO L290 TraceCheckUtils]: 32: Hoare triple {127995#true} assume ~id3~0 != ~id5~0; {127995#true} is VALID [2022-02-20 18:29:01,365 INFO L290 TraceCheckUtils]: 33: Hoare triple {127995#true} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {127997#(= |ULTIMATE.start_init_~tmp~0#1| 1)} is VALID [2022-02-20 18:29:01,366 INFO L290 TraceCheckUtils]: 34: Hoare triple {127997#(= |ULTIMATE.start_init_~tmp~0#1| 1)} init_#res#1 := init_~tmp~0#1; {127998#(= |ULTIMATE.start_init_#res#1| 1)} is VALID [2022-02-20 18:29:01,366 INFO L290 TraceCheckUtils]: 35: Hoare triple {127998#(= |ULTIMATE.start_init_#res#1| 1)} main_#t~ret39#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret39#1 && main_#t~ret39#1 <= 2147483647;main_~i2~0#1 := main_#t~ret39#1;havoc main_#t~ret39#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {127999#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)} is VALID [2022-02-20 18:29:01,366 INFO L290 TraceCheckUtils]: 36: Hoare triple {127999#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)} assume !(0 == assume_abort_if_not_~cond#1); {127995#true} is VALID [2022-02-20 18:29:01,366 INFO L290 TraceCheckUtils]: 37: Hoare triple {127995#true} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {127995#true} is VALID [2022-02-20 18:29:01,366 INFO L290 TraceCheckUtils]: 38: Hoare triple {127995#true} assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {127995#true} is VALID [2022-02-20 18:29:01,366 INFO L290 TraceCheckUtils]: 39: Hoare triple {127995#true} assume !(0 != ~mode1~0 % 256); {127995#true} is VALID [2022-02-20 18:29:01,366 INFO L290 TraceCheckUtils]: 40: Hoare triple {127995#true} assume !(0 != ~alive1~0 % 256); {127995#true} is VALID [2022-02-20 18:29:01,367 INFO L290 TraceCheckUtils]: 41: Hoare triple {127995#true} ~mode1~0 := 1; {127995#true} is VALID [2022-02-20 18:29:01,367 INFO L290 TraceCheckUtils]: 42: Hoare triple {127995#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {127995#true} is VALID [2022-02-20 18:29:01,367 INFO L290 TraceCheckUtils]: 43: Hoare triple {127995#true} assume !(0 != ~mode2~0 % 256); {127995#true} is VALID [2022-02-20 18:29:01,367 INFO L290 TraceCheckUtils]: 44: Hoare triple {127995#true} assume 0 != ~alive2~0 % 256; {127995#true} is VALID [2022-02-20 18:29:01,367 INFO L290 TraceCheckUtils]: 45: Hoare triple {127995#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {127995#true} is VALID [2022-02-20 18:29:01,367 INFO L290 TraceCheckUtils]: 46: Hoare triple {127995#true} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1; {127995#true} is VALID [2022-02-20 18:29:01,367 INFO L290 TraceCheckUtils]: 47: Hoare triple {127995#true} ~mode2~0 := 1; {127995#true} is VALID [2022-02-20 18:29:01,367 INFO L290 TraceCheckUtils]: 48: Hoare triple {127995#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {127995#true} is VALID [2022-02-20 18:29:01,367 INFO L290 TraceCheckUtils]: 49: Hoare triple {127995#true} assume !(0 != ~mode3~0 % 256); {127995#true} is VALID [2022-02-20 18:29:01,368 INFO L290 TraceCheckUtils]: 50: Hoare triple {127995#true} assume !(0 != ~alive3~0 % 256); {127995#true} is VALID [2022-02-20 18:29:01,368 INFO L290 TraceCheckUtils]: 51: Hoare triple {127995#true} assume !(~send3~0 != ~id3~0); {127995#true} is VALID [2022-02-20 18:29:01,368 INFO L290 TraceCheckUtils]: 52: Hoare triple {127995#true} ~mode3~0 := 1; {127995#true} is VALID [2022-02-20 18:29:01,368 INFO L290 TraceCheckUtils]: 53: Hoare triple {127995#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {127995#true} is VALID [2022-02-20 18:29:01,368 INFO L290 TraceCheckUtils]: 54: Hoare triple {127995#true} assume !(0 != ~mode4~0 % 256); {127995#true} is VALID [2022-02-20 18:29:01,368 INFO L290 TraceCheckUtils]: 55: Hoare triple {127995#true} assume !(0 != ~alive4~0 % 256); {127995#true} is VALID [2022-02-20 18:29:01,368 INFO L290 TraceCheckUtils]: 56: Hoare triple {127995#true} assume !(~send4~0 != ~id4~0); {127995#true} is VALID [2022-02-20 18:29:01,368 INFO L290 TraceCheckUtils]: 57: Hoare triple {127995#true} ~mode4~0 := 1; {127995#true} is VALID [2022-02-20 18:29:01,368 INFO L290 TraceCheckUtils]: 58: Hoare triple {127995#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {127995#true} is VALID [2022-02-20 18:29:01,368 INFO L290 TraceCheckUtils]: 59: Hoare triple {127995#true} assume !(0 != ~mode5~0 % 256); {127995#true} is VALID [2022-02-20 18:29:01,369 INFO L290 TraceCheckUtils]: 60: Hoare triple {127995#true} assume !(0 != ~alive5~0 % 256); {127995#true} is VALID [2022-02-20 18:29:01,369 INFO L290 TraceCheckUtils]: 61: Hoare triple {127995#true} assume !(~send5~0 != ~id5~0); {127995#true} is VALID [2022-02-20 18:29:01,369 INFO L290 TraceCheckUtils]: 62: Hoare triple {127995#true} ~mode5~0 := 1; {127995#true} is VALID [2022-02-20 18:29:01,369 INFO L290 TraceCheckUtils]: 63: Hoare triple {127995#true} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {127995#true} is VALID [2022-02-20 18:29:01,369 INFO L290 TraceCheckUtils]: 64: Hoare triple {127995#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {127995#true} is VALID [2022-02-20 18:29:01,369 INFO L290 TraceCheckUtils]: 65: Hoare triple {127995#true} assume ~r1~0 < 5;check_~tmp~1#1 := 1; {128000#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} is VALID [2022-02-20 18:29:01,370 INFO L290 TraceCheckUtils]: 66: Hoare triple {128000#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} check_#res#1 := check_~tmp~1#1; {128001#(not (= 0 |ULTIMATE.start_check_#res#1|))} is VALID [2022-02-20 18:29:01,370 INFO L290 TraceCheckUtils]: 67: Hoare triple {128001#(not (= 0 |ULTIMATE.start_check_#res#1|))} main_#t~ret40#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~c1~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {128002#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} is VALID [2022-02-20 18:29:01,370 INFO L290 TraceCheckUtils]: 68: Hoare triple {128002#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} assume 0 == assert_~arg#1 % 256; {127996#false} is VALID [2022-02-20 18:29:01,371 INFO L290 TraceCheckUtils]: 69: Hoare triple {127996#false} assume !false; {127996#false} is VALID [2022-02-20 18:29:01,371 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:29:01,371 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:29:01,371 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698665498] [2022-02-20 18:29:01,371 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698665498] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:29:01,371 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:29:01,371 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:29:01,371 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278486253] [2022-02-20 18:29:01,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:29:01,372 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 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:29:01,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:29:01,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 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:29:01,411 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:29:01,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:29:01,412 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:29:01,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:29:01,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:29:01,412 INFO L87 Difference]: Start difference. First operand 13256 states and 19815 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 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)