./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label01.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label01.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e88e3e8aba390a13cb5a82d6fb8fb9bb13a0912ffa51b564a97f01b48e1cd0bb --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:41:28,322 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:41:28,323 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:41:28,364 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:41:28,365 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:41:28,369 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:41:28,372 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:41:28,375 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:41:28,376 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:41:28,380 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:41:28,381 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:41:28,382 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:41:28,382 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:41:28,385 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:41:28,386 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:41:28,388 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:41:28,389 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:41:28,390 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:41:28,392 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:41:28,397 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:41:28,398 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:41:28,399 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:41:28,400 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:41:28,401 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:41:28,407 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:41:28,407 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:41:28,408 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:41:28,409 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:41:28,409 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:41:28,410 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:41:28,410 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:41:28,411 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:41:28,412 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:41:28,413 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:41:28,414 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:41:28,414 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:41:28,415 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:41:28,415 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:41:28,415 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:41:28,416 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:41:28,416 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:41:28,418 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:41:28,448 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:41:28,448 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:41:28,449 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:41:28,449 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:41:28,450 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:41:28,450 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:41:28,450 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:41:28,450 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:41:28,451 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:41:28,451 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:41:28,452 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:41:28,452 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:41:28,452 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:41:28,452 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:41:28,452 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:41:28,453 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:41:28,453 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:41:28,453 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:41:28,453 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:41:28,453 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:41:28,453 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:41:28,454 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:41:28,454 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:41:28,454 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:41:28,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:41:28,454 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:41:28,454 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:41:28,455 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:41:28,456 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:41:28,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:41:28,456 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:41:28,456 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:41:28,457 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:41:28,457 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 -> e88e3e8aba390a13cb5a82d6fb8fb9bb13a0912ffa51b564a97f01b48e1cd0bb [2022-02-20 19:41:28,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:41:28,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:41:28,731 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:41:28,732 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:41:28,732 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:41:28,733 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label01.c [2022-02-20 19:41:28,796 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5969098d2/7825b4c7fc0046dc87ee5736cb1ca07c/FLAGdafc25e1d [2022-02-20 19:41:29,494 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:41:29,495 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label01.c [2022-02-20 19:41:29,537 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5969098d2/7825b4c7fc0046dc87ee5736cb1ca07c/FLAGdafc25e1d [2022-02-20 19:41:29,651 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5969098d2/7825b4c7fc0046dc87ee5736cb1ca07c [2022-02-20 19:41:29,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:41:29,656 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:41:29,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:41:29,660 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:41:29,663 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:41:29,664 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:41:29" (1/1) ... [2022-02-20 19:41:29,665 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1da8249d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:41:29, skipping insertion in model container [2022-02-20 19:41:29,665 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:41:29" (1/1) ... [2022-02-20 19:41:29,671 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:41:29,782 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:41:30,108 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label01.c[8616,8629] [2022-02-20 19:41:30,171 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label01.c[14171,14184] [2022-02-20 19:41:30,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:41:30,905 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:41:30,929 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label01.c[8616,8629] [2022-02-20 19:41:30,939 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label01.c[14171,14184] [2022-02-20 19:41:31,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:41:31,383 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:41:31,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:41:31 WrapperNode [2022-02-20 19:41:31,384 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:41:31,384 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:41:31,385 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:41:31,385 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:41:31,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:41:31" (1/1) ... [2022-02-20 19:41:31,439 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:41:31" (1/1) ... [2022-02-20 19:41:31,810 INFO L137 Inliner]: procedures = 34, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 5031 [2022-02-20 19:41:31,810 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:41:31,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:41:31,812 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:41:31,812 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:41:31,819 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:41:31" (1/1) ... [2022-02-20 19:41:31,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:41:31" (1/1) ... [2022-02-20 19:41:31,869 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:41:31" (1/1) ... [2022-02-20 19:41:31,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:41:31" (1/1) ... [2022-02-20 19:41:32,048 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:41:31" (1/1) ... [2022-02-20 19:41:32,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:41:31" (1/1) ... [2022-02-20 19:41:32,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:41:31" (1/1) ... [2022-02-20 19:41:32,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:41:32,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:41:32,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:41:32,204 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:41:32,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:41:31" (1/1) ... [2022-02-20 19:41:32,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:41:32,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:41:32,241 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:41:32,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:41:32,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:41:32,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:41:32,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:41:32,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:41:32,412 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:41:32,428 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:41:40,147 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:41:40,165 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:41:40,166 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:41:40,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:41:40 BoogieIcfgContainer [2022-02-20 19:41:40,168 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:41:40,169 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:41:40,170 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:41:40,172 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:41:40,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:41:29" (1/3) ... [2022-02-20 19:41:40,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2364f9ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:41:40, skipping insertion in model container [2022-02-20 19:41:40,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:41:31" (2/3) ... [2022-02-20 19:41:40,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2364f9ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:41:40, skipping insertion in model container [2022-02-20 19:41:40,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:41:40" (3/3) ... [2022-02-20 19:41:40,175 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label01.c [2022-02-20 19:41:40,179 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:41:40,179 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:41:40,220 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:41:40,229 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:41:40,229 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:41:40,271 INFO L276 IsEmpty]: Start isEmpty. Operand has 893 states, 890 states have (on average 1.902247191011236) internal successors, (1693), 892 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:40,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 19:41:40,280 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:41:40,280 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] [2022-02-20 19:41:40,281 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:41:40,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:41:40,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1675876582, now seen corresponding path program 1 times [2022-02-20 19:41:40,294 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:41:40,294 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054399590] [2022-02-20 19:41:40,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:41:40,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:41:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:41:40,530 INFO L290 TraceCheckUtils]: 0: Hoare triple {896#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {896#true} is VALID [2022-02-20 19:41:40,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {896#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_#t~ret45#1;assume -2147483648 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 2147483647; {896#true} is VALID [2022-02-20 19:41:40,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {896#true} assume 0 != main_#t~nondet43#1;havoc main_#t~nondet43#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_#t~post28#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {896#true} is VALID [2022-02-20 19:41:40,531 INFO L290 TraceCheckUtils]: 3: Hoare triple {896#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {896#true} is VALID [2022-02-20 19:41:40,531 INFO L290 TraceCheckUtils]: 4: Hoare triple {896#true} init_#res#1 := init_~tmp~0#1; {896#true} is VALID [2022-02-20 19:41:40,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {896#true} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1; {896#true} is VALID [2022-02-20 19:41:40,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {896#true} assume 0 == main1_~i2~0#1;assume false; {897#false} is VALID [2022-02-20 19:41:40,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {897#false} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {897#false} is VALID [2022-02-20 19:41:40,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {897#false} assume !!(main1_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {897#false} is VALID [2022-02-20 19:41:40,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {897#false} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {897#false} is VALID [2022-02-20 19:41:40,537 INFO L290 TraceCheckUtils]: 10: Hoare triple {897#false} assume !(node1_~m1~0#1 != ~nomsg~0); {897#false} is VALID [2022-02-20 19:41:40,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {897#false} ~mode1~0 := 0; {897#false} is VALID [2022-02-20 19:41:40,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {897#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {897#false} is VALID [2022-02-20 19:41:40,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {897#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {897#false} is VALID [2022-02-20 19:41:40,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {897#false} assume !(node2_~m2~0#1 != ~nomsg~0); {897#false} is VALID [2022-02-20 19:41:40,539 INFO L290 TraceCheckUtils]: 15: Hoare triple {897#false} ~mode2~0 := 0; {897#false} is VALID [2022-02-20 19:41:40,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {897#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {897#false} is VALID [2022-02-20 19:41:40,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {897#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {897#false} is VALID [2022-02-20 19:41:40,540 INFO L290 TraceCheckUtils]: 18: Hoare triple {897#false} assume !(node3_~m3~0#1 != ~nomsg~0); {897#false} is VALID [2022-02-20 19:41:40,541 INFO L290 TraceCheckUtils]: 19: Hoare triple {897#false} ~mode3~0 := 0; {897#false} is VALID [2022-02-20 19:41:40,541 INFO L290 TraceCheckUtils]: 20: Hoare triple {897#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {897#false} is VALID [2022-02-20 19:41:40,541 INFO L290 TraceCheckUtils]: 21: Hoare triple {897#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {897#false} is VALID [2022-02-20 19:41:40,541 INFO L290 TraceCheckUtils]: 22: Hoare triple {897#false} assume !(node4_~m4~0#1 != ~nomsg~0); {897#false} is VALID [2022-02-20 19:41:40,541 INFO L290 TraceCheckUtils]: 23: Hoare triple {897#false} ~mode4~0 := 0; {897#false} is VALID [2022-02-20 19:41:40,542 INFO L290 TraceCheckUtils]: 24: Hoare triple {897#false} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {897#false} is VALID [2022-02-20 19:41:40,543 INFO L290 TraceCheckUtils]: 25: Hoare triple {897#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {897#false} is VALID [2022-02-20 19:41:40,543 INFO L290 TraceCheckUtils]: 26: Hoare triple {897#false} check_#res#1 := check_~tmp~1#1; {897#false} is VALID [2022-02-20 19:41:40,543 INFO L290 TraceCheckUtils]: 27: Hoare triple {897#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {897#false} is VALID [2022-02-20 19:41:40,544 INFO L290 TraceCheckUtils]: 28: Hoare triple {897#false} assume 0 == assert_~arg#1 % 256; {897#false} is VALID [2022-02-20 19:41:40,544 INFO L290 TraceCheckUtils]: 29: Hoare triple {897#false} assume !false; {897#false} is VALID [2022-02-20 19:41:40,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:41:40,545 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:41:40,545 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054399590] [2022-02-20 19:41:40,546 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054399590] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:41:40,546 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:41:40,546 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:41:40,548 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370563955] [2022-02-20 19:41:40,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:41:40,552 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-02-20 19:41:40,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:41:40,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:40,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:41:40,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:41:40,592 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:41:40,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:41:40,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:41:40,618 INFO L87 Difference]: Start difference. First operand has 893 states, 890 states have (on average 1.902247191011236) internal successors, (1693), 892 states have internal predecessors, (1693), 0 states have call successors, (0), 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 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:42,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:42,015 INFO L93 Difference]: Finished difference Result 1757 states and 3332 transitions. [2022-02-20 19:41:42,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:41:42,016 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-02-20 19:41:42,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:41:42,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:42,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3332 transitions. [2022-02-20 19:41:42,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:42,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3332 transitions. [2022-02-20 19:41:42,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 3332 transitions. [2022-02-20 19:41:44,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3332 edges. 3332 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:41:44,865 INFO L225 Difference]: With dead ends: 1757 [2022-02-20 19:41:44,865 INFO L226 Difference]: Without dead ends: 827 [2022-02-20 19:41:44,874 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:41:44,877 INFO L933 BasicCegarLoop]: 1627 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, 1627 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:41:44,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1627 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:41:44,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2022-02-20 19:41:44,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 827. [2022-02-20 19:41:44,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:41:44,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 827 states. Second operand has 827 states, 825 states have (on average 1.8909090909090909) internal successors, (1560), 826 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:44,992 INFO L74 IsIncluded]: Start isIncluded. First operand 827 states. Second operand has 827 states, 825 states have (on average 1.8909090909090909) internal successors, (1560), 826 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:45,020 INFO L87 Difference]: Start difference. First operand 827 states. Second operand has 827 states, 825 states have (on average 1.8909090909090909) internal successors, (1560), 826 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:45,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:45,115 INFO L93 Difference]: Finished difference Result 827 states and 1560 transitions. [2022-02-20 19:41:45,115 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1560 transitions. [2022-02-20 19:41:45,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:41:45,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:41:45,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 827 states, 825 states have (on average 1.8909090909090909) internal successors, (1560), 826 states have internal predecessors, (1560), 0 states have call successors, (0), 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 827 states. [2022-02-20 19:41:45,154 INFO L87 Difference]: Start difference. First operand has 827 states, 825 states have (on average 1.8909090909090909) internal successors, (1560), 826 states have internal predecessors, (1560), 0 states have call successors, (0), 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 827 states. [2022-02-20 19:41:45,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:45,212 INFO L93 Difference]: Finished difference Result 827 states and 1560 transitions. [2022-02-20 19:41:45,213 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1560 transitions. [2022-02-20 19:41:45,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:41:45,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:41:45,215 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:41:45,215 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:41:45,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 825 states have (on average 1.8909090909090909) internal successors, (1560), 826 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:45,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1560 transitions. [2022-02-20 19:41:45,256 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1560 transitions. Word has length 30 [2022-02-20 19:41:45,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:41:45,257 INFO L470 AbstractCegarLoop]: Abstraction has 827 states and 1560 transitions. [2022-02-20 19:41:45,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:45,257 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1560 transitions. [2022-02-20 19:41:45,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 19:41:45,258 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:41:45,258 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] [2022-02-20 19:41:45,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:41:45,259 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:41:45,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:41:45,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1541863076, now seen corresponding path program 1 times [2022-02-20 19:41:45,260 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:41:45,260 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663493196] [2022-02-20 19:41:45,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:41:45,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:41:45,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:41:45,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {5180#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {5180#true} is VALID [2022-02-20 19:41:45,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {5180#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_#t~ret45#1;assume -2147483648 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 2147483647; {5180#true} is VALID [2022-02-20 19:41:45,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {5180#true} assume 0 != main_#t~nondet43#1;havoc main_#t~nondet43#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_#t~post28#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {5180#true} is VALID [2022-02-20 19:41:45,383 INFO L290 TraceCheckUtils]: 3: Hoare triple {5180#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {5182#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:41:45,384 INFO L290 TraceCheckUtils]: 4: Hoare triple {5182#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {5183#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:41:45,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {5183#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1; {5184#(= |ULTIMATE.start_main1_~i2~0#1| 0)} is VALID [2022-02-20 19:41:45,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {5184#(= |ULTIMATE.start_main1_~i2~0#1| 0)} assume !(0 == main1_~i2~0#1); {5181#false} is VALID [2022-02-20 19:41:45,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {5181#false} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {5181#false} is VALID [2022-02-20 19:41:45,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {5181#false} assume !!(main1_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {5181#false} is VALID [2022-02-20 19:41:45,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {5181#false} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {5181#false} is VALID [2022-02-20 19:41:45,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {5181#false} assume !(node1_~m1~0#1 != ~nomsg~0); {5181#false} is VALID [2022-02-20 19:41:45,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {5181#false} ~mode1~0 := 0; {5181#false} is VALID [2022-02-20 19:41:45,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {5181#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {5181#false} is VALID [2022-02-20 19:41:45,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {5181#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {5181#false} is VALID [2022-02-20 19:41:45,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {5181#false} assume !(node2_~m2~0#1 != ~nomsg~0); {5181#false} is VALID [2022-02-20 19:41:45,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {5181#false} ~mode2~0 := 0; {5181#false} is VALID [2022-02-20 19:41:45,387 INFO L290 TraceCheckUtils]: 16: Hoare triple {5181#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {5181#false} is VALID [2022-02-20 19:41:45,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {5181#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {5181#false} is VALID [2022-02-20 19:41:45,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {5181#false} assume !(node3_~m3~0#1 != ~nomsg~0); {5181#false} is VALID [2022-02-20 19:41:45,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {5181#false} ~mode3~0 := 0; {5181#false} is VALID [2022-02-20 19:41:45,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {5181#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {5181#false} is VALID [2022-02-20 19:41:45,391 INFO L290 TraceCheckUtils]: 21: Hoare triple {5181#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {5181#false} is VALID [2022-02-20 19:41:45,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {5181#false} assume !(node4_~m4~0#1 != ~nomsg~0); {5181#false} is VALID [2022-02-20 19:41:45,392 INFO L290 TraceCheckUtils]: 23: Hoare triple {5181#false} ~mode4~0 := 0; {5181#false} is VALID [2022-02-20 19:41:45,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {5181#false} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {5181#false} is VALID [2022-02-20 19:41:45,394 INFO L290 TraceCheckUtils]: 25: Hoare triple {5181#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {5181#false} is VALID [2022-02-20 19:41:45,395 INFO L290 TraceCheckUtils]: 26: Hoare triple {5181#false} check_#res#1 := check_~tmp~1#1; {5181#false} is VALID [2022-02-20 19:41:45,395 INFO L290 TraceCheckUtils]: 27: Hoare triple {5181#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {5181#false} is VALID [2022-02-20 19:41:45,395 INFO L290 TraceCheckUtils]: 28: Hoare triple {5181#false} assume 0 == assert_~arg#1 % 256; {5181#false} is VALID [2022-02-20 19:41:45,396 INFO L290 TraceCheckUtils]: 29: Hoare triple {5181#false} assume !false; {5181#false} is VALID [2022-02-20 19:41:45,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:41:45,397 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:41:45,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663493196] [2022-02-20 19:41:45,397 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663493196] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:41:45,397 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:41:45,397 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:41:45,398 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919557639] [2022-02-20 19:41:45,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:41:45,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-02-20 19:41:45,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:41:45,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:45,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:41:45,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:41:45,426 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:41:45,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:41:45,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:41:45,428 INFO L87 Difference]: Start difference. First operand 827 states and 1560 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:49,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:49,485 INFO L93 Difference]: Finished difference Result 919 states and 1702 transitions. [2022-02-20 19:41:49,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:41:49,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-02-20 19:41:49,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:41:49,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:49,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1702 transitions. [2022-02-20 19:41:49,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:49,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1702 transitions. [2022-02-20 19:41:49,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 1702 transitions. [2022-02-20 19:41:50,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1702 edges. 1702 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:41:50,915 INFO L225 Difference]: With dead ends: 919 [2022-02-20 19:41:50,915 INFO L226 Difference]: Without dead ends: 871 [2022-02-20 19:41:50,915 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:41:50,917 INFO L933 BasicCegarLoop]: 1556 mSDtfsCounter, 71 mSDsluCounter, 4640 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 6196 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:41:50,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 6196 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:41:50,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-02-20 19:41:50,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 827. [2022-02-20 19:41:50,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:41:50,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 871 states. Second operand has 827 states, 825 states have (on average 1.863030303030303) internal successors, (1537), 826 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:50,939 INFO L74 IsIncluded]: Start isIncluded. First operand 871 states. Second operand has 827 states, 825 states have (on average 1.863030303030303) internal successors, (1537), 826 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:50,940 INFO L87 Difference]: Start difference. First operand 871 states. Second operand has 827 states, 825 states have (on average 1.863030303030303) internal successors, (1537), 826 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:50,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:50,978 INFO L93 Difference]: Finished difference Result 871 states and 1606 transitions. [2022-02-20 19:41:50,978 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1606 transitions. [2022-02-20 19:41:50,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:41:50,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:41:50,982 INFO L74 IsIncluded]: Start isIncluded. First operand has 827 states, 825 states have (on average 1.863030303030303) internal successors, (1537), 826 states have internal predecessors, (1537), 0 states have call successors, (0), 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 871 states. [2022-02-20 19:41:50,984 INFO L87 Difference]: Start difference. First operand has 827 states, 825 states have (on average 1.863030303030303) internal successors, (1537), 826 states have internal predecessors, (1537), 0 states have call successors, (0), 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 871 states. [2022-02-20 19:41:51,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:51,025 INFO L93 Difference]: Finished difference Result 871 states and 1606 transitions. [2022-02-20 19:41:51,025 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1606 transitions. [2022-02-20 19:41:51,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:41:51,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:41:51,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:41:51,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:41:51,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 825 states have (on average 1.863030303030303) internal successors, (1537), 826 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:51,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1537 transitions. [2022-02-20 19:41:51,067 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1537 transitions. Word has length 30 [2022-02-20 19:41:51,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:41:51,067 INFO L470 AbstractCegarLoop]: Abstraction has 827 states and 1537 transitions. [2022-02-20 19:41:51,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:51,068 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1537 transitions. [2022-02-20 19:41:51,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 19:41:51,069 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:41:51,070 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] [2022-02-20 19:41:51,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:41:51,071 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:41:51,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:41:51,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1620709547, now seen corresponding path program 1 times [2022-02-20 19:41:51,072 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:41:51,072 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523478807] [2022-02-20 19:41:51,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:41:51,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:41:51,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:41:51,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {8720#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {8722#(<= 15 ~a24~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_#t~ret45#1;assume -2147483648 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 2147483647; {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {8722#(<= 15 ~a24~0)} assume !(0 != main_#t~nondet43#1);havoc main_#t~nondet43#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet41#1, main2_#t~ret42#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,195 INFO L290 TraceCheckUtils]: 3: Hoare triple {8722#(<= 15 ~a24~0)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet41#1 && main2_#t~nondet41#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet41#1;havoc main2_#t~nondet41#1; {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,195 INFO L290 TraceCheckUtils]: 4: Hoare triple {8722#(<= 15 ~a24~0)} assume !(((((1 != main2_~input~0#1 && 2 != main2_~input~0#1) && 3 != main2_~input~0#1) && 4 != main2_~input~0#1) && 5 != main2_~input~0#1) && 6 != main2_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main2_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret38#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,200 INFO L290 TraceCheckUtils]: 16: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,201 INFO L290 TraceCheckUtils]: 17: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,201 INFO L290 TraceCheckUtils]: 18: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,201 INFO L290 TraceCheckUtils]: 19: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,202 INFO L290 TraceCheckUtils]: 21: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,203 INFO L290 TraceCheckUtils]: 22: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,203 INFO L290 TraceCheckUtils]: 23: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,203 INFO L290 TraceCheckUtils]: 24: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,204 INFO L290 TraceCheckUtils]: 25: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,204 INFO L290 TraceCheckUtils]: 26: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,205 INFO L290 TraceCheckUtils]: 27: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,205 INFO L290 TraceCheckUtils]: 28: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,206 INFO L290 TraceCheckUtils]: 29: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,206 INFO L290 TraceCheckUtils]: 30: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,206 INFO L290 TraceCheckUtils]: 31: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,207 INFO L290 TraceCheckUtils]: 32: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,207 INFO L290 TraceCheckUtils]: 33: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,208 INFO L290 TraceCheckUtils]: 34: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,208 INFO L290 TraceCheckUtils]: 35: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,208 INFO L290 TraceCheckUtils]: 36: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,209 INFO L290 TraceCheckUtils]: 37: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,209 INFO L290 TraceCheckUtils]: 38: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,210 INFO L290 TraceCheckUtils]: 39: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,210 INFO L290 TraceCheckUtils]: 40: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,211 INFO L290 TraceCheckUtils]: 41: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,211 INFO L290 TraceCheckUtils]: 42: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,211 INFO L290 TraceCheckUtils]: 43: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,212 INFO L290 TraceCheckUtils]: 44: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,212 INFO L290 TraceCheckUtils]: 45: Hoare triple {8722#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {8722#(<= 15 ~a24~0)} is VALID [2022-02-20 19:41:51,213 INFO L290 TraceCheckUtils]: 46: Hoare triple {8722#(<= 15 ~a24~0)} assume (((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0; {8721#false} is VALID [2022-02-20 19:41:51,213 INFO L290 TraceCheckUtils]: 47: Hoare triple {8721#false} assume !false; {8721#false} is VALID [2022-02-20 19:41:51,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:41:51,214 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:41:51,214 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523478807] [2022-02-20 19:41:51,214 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523478807] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:41:51,214 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:41:51,215 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:41:51,215 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299336537] [2022-02-20 19:41:51,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:41:51,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2022-02-20 19:41:51,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:41:51,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:51,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:41:51,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:41:51,252 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:41:51,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:41:51,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:41:51,253 INFO L87 Difference]: Start difference. First operand 827 states and 1537 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:57,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:41:57,260 INFO L93 Difference]: Finished difference Result 2331 states and 4410 transitions. [2022-02-20 19:41:57,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:41:57,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2022-02-20 19:41:57,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:41:57,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:57,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4410 transitions. [2022-02-20 19:41:57,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:41:57,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4410 transitions. [2022-02-20 19:41:57,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4410 transitions. [2022-02-20 19:42:00,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4410 edges. 4410 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:00,864 INFO L225 Difference]: With dead ends: 2331 [2022-02-20 19:42:00,864 INFO L226 Difference]: Without dead ends: 1578 [2022-02-20 19:42:00,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:42:00,868 INFO L933 BasicCegarLoop]: 519 mSDtfsCounter, 868 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:42:00,868 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [868 Valid, 526 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2274 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-02-20 19:42:00,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2022-02-20 19:42:00,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1578. [2022-02-20 19:42:00,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:42:00,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1578 states. Second operand has 1578 states, 1576 states have (on average 1.6269035532994924) internal successors, (2564), 1577 states have internal predecessors, (2564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:00,907 INFO L74 IsIncluded]: Start isIncluded. First operand 1578 states. Second operand has 1578 states, 1576 states have (on average 1.6269035532994924) internal successors, (2564), 1577 states have internal predecessors, (2564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:00,910 INFO L87 Difference]: Start difference. First operand 1578 states. Second operand has 1578 states, 1576 states have (on average 1.6269035532994924) internal successors, (2564), 1577 states have internal predecessors, (2564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:01,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:01,026 INFO L93 Difference]: Finished difference Result 1578 states and 2564 transitions. [2022-02-20 19:42:01,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2564 transitions. [2022-02-20 19:42:01,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:01,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:01,033 INFO L74 IsIncluded]: Start isIncluded. First operand has 1578 states, 1576 states have (on average 1.6269035532994924) internal successors, (2564), 1577 states have internal predecessors, (2564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1578 states. [2022-02-20 19:42:01,037 INFO L87 Difference]: Start difference. First operand has 1578 states, 1576 states have (on average 1.6269035532994924) internal successors, (2564), 1577 states have internal predecessors, (2564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1578 states. [2022-02-20 19:42:01,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:01,151 INFO L93 Difference]: Finished difference Result 1578 states and 2564 transitions. [2022-02-20 19:42:01,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2564 transitions. [2022-02-20 19:42:01,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:01,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:01,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:42:01,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:42:01,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1576 states have (on average 1.6269035532994924) internal successors, (2564), 1577 states have internal predecessors, (2564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:01,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2564 transitions. [2022-02-20 19:42:01,280 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2564 transitions. Word has length 48 [2022-02-20 19:42:01,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:42:01,282 INFO L470 AbstractCegarLoop]: Abstraction has 1578 states and 2564 transitions. [2022-02-20 19:42:01,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:01,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2564 transitions. [2022-02-20 19:42:01,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 19:42:01,284 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:42:01,285 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:42:01,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:42:01,285 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:42:01,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:42:01,286 INFO L85 PathProgramCache]: Analyzing trace with hash 159296799, now seen corresponding path program 1 times [2022-02-20 19:42:01,286 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:42:01,286 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593368062] [2022-02-20 19:42:01,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:42:01,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:42:01,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:42:01,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {15831#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {15831#true} is VALID [2022-02-20 19:42:01,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {15831#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_#t~ret45#1;assume -2147483648 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 2147483647; {15831#true} is VALID [2022-02-20 19:42:01,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {15831#true} assume 0 != main_#t~nondet43#1;havoc main_#t~nondet43#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_#t~post28#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {15831#true} is VALID [2022-02-20 19:42:01,381 INFO L290 TraceCheckUtils]: 3: Hoare triple {15831#true} assume 0 == ~r1~0; {15831#true} is VALID [2022-02-20 19:42:01,381 INFO L290 TraceCheckUtils]: 4: Hoare triple {15831#true} assume ~id1~0 >= 0; {15831#true} is VALID [2022-02-20 19:42:01,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {15831#true} assume 0 == ~st1~0; {15831#true} is VALID [2022-02-20 19:42:01,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {15831#true} assume ~send1~0 == ~id1~0; {15831#true} is VALID [2022-02-20 19:42:01,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {15831#true} assume 0 == ~mode1~0 % 256; {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:42:01,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:42:01,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:42:01,383 INFO L290 TraceCheckUtils]: 10: Hoare triple {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:42:01,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:42:01,384 INFO L290 TraceCheckUtils]: 12: Hoare triple {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:42:01,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:42:01,385 INFO L290 TraceCheckUtils]: 14: Hoare triple {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:42:01,386 INFO L290 TraceCheckUtils]: 15: Hoare triple {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:42:01,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:42:01,387 INFO L290 TraceCheckUtils]: 17: Hoare triple {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:42:01,387 INFO L290 TraceCheckUtils]: 18: Hoare triple {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:42:01,388 INFO L290 TraceCheckUtils]: 19: Hoare triple {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:42:01,396 INFO L290 TraceCheckUtils]: 20: Hoare triple {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:42:01,397 INFO L290 TraceCheckUtils]: 21: Hoare triple {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:42:01,397 INFO L290 TraceCheckUtils]: 22: Hoare triple {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:42:01,398 INFO L290 TraceCheckUtils]: 23: Hoare triple {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:42:01,398 INFO L290 TraceCheckUtils]: 24: Hoare triple {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:42:01,399 INFO L290 TraceCheckUtils]: 25: Hoare triple {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:42:01,399 INFO L290 TraceCheckUtils]: 26: Hoare triple {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:42:01,400 INFO L290 TraceCheckUtils]: 27: Hoare triple {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1; {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:42:01,400 INFO L290 TraceCheckUtils]: 28: Hoare triple {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == main1_~i2~0#1); {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:42:01,400 INFO L290 TraceCheckUtils]: 29: Hoare triple {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:42:01,401 INFO L290 TraceCheckUtils]: 30: Hoare triple {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main1_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {15833#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:42:01,402 INFO L290 TraceCheckUtils]: 31: Hoare triple {15833#(= (+ (* (- 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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {15832#false} is VALID [2022-02-20 19:42:01,402 INFO L290 TraceCheckUtils]: 32: Hoare triple {15832#false} assume !(node1_~m1~0#1 != ~nomsg~0); {15832#false} is VALID [2022-02-20 19:42:01,402 INFO L290 TraceCheckUtils]: 33: Hoare triple {15832#false} ~mode1~0 := 0; {15832#false} is VALID [2022-02-20 19:42:01,402 INFO L290 TraceCheckUtils]: 34: Hoare triple {15832#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {15832#false} is VALID [2022-02-20 19:42:01,402 INFO L290 TraceCheckUtils]: 35: Hoare triple {15832#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {15832#false} is VALID [2022-02-20 19:42:01,403 INFO L290 TraceCheckUtils]: 36: Hoare triple {15832#false} assume !(node2_~m2~0#1 != ~nomsg~0); {15832#false} is VALID [2022-02-20 19:42:01,403 INFO L290 TraceCheckUtils]: 37: Hoare triple {15832#false} ~mode2~0 := 0; {15832#false} is VALID [2022-02-20 19:42:01,403 INFO L290 TraceCheckUtils]: 38: Hoare triple {15832#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {15832#false} is VALID [2022-02-20 19:42:01,403 INFO L290 TraceCheckUtils]: 39: Hoare triple {15832#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {15832#false} is VALID [2022-02-20 19:42:01,404 INFO L290 TraceCheckUtils]: 40: Hoare triple {15832#false} assume !(node3_~m3~0#1 != ~nomsg~0); {15832#false} is VALID [2022-02-20 19:42:01,404 INFO L290 TraceCheckUtils]: 41: Hoare triple {15832#false} ~mode3~0 := 0; {15832#false} is VALID [2022-02-20 19:42:01,404 INFO L290 TraceCheckUtils]: 42: Hoare triple {15832#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {15832#false} is VALID [2022-02-20 19:42:01,404 INFO L290 TraceCheckUtils]: 43: Hoare triple {15832#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {15832#false} is VALID [2022-02-20 19:42:01,404 INFO L290 TraceCheckUtils]: 44: Hoare triple {15832#false} assume !(node4_~m4~0#1 != ~nomsg~0); {15832#false} is VALID [2022-02-20 19:42:01,405 INFO L290 TraceCheckUtils]: 45: Hoare triple {15832#false} ~mode4~0 := 0; {15832#false} is VALID [2022-02-20 19:42:01,405 INFO L290 TraceCheckUtils]: 46: Hoare triple {15832#false} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {15832#false} is VALID [2022-02-20 19:42:01,405 INFO L290 TraceCheckUtils]: 47: Hoare triple {15832#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {15832#false} is VALID [2022-02-20 19:42:01,405 INFO L290 TraceCheckUtils]: 48: Hoare triple {15832#false} check_#res#1 := check_~tmp~1#1; {15832#false} is VALID [2022-02-20 19:42:01,405 INFO L290 TraceCheckUtils]: 49: Hoare triple {15832#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {15832#false} is VALID [2022-02-20 19:42:01,405 INFO L290 TraceCheckUtils]: 50: Hoare triple {15832#false} assume 0 == assert_~arg#1 % 256; {15832#false} is VALID [2022-02-20 19:42:01,405 INFO L290 TraceCheckUtils]: 51: Hoare triple {15832#false} assume !false; {15832#false} is VALID [2022-02-20 19:42:01,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:42:01,406 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:42:01,406 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593368062] [2022-02-20 19:42:01,406 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593368062] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:42:01,407 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:42:01,407 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:42:01,407 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423745765] [2022-02-20 19:42:01,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:42:01,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 19:42:01,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:42:01,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:01,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:01,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:42:01,440 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:42:01,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:42:01,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:42:01,441 INFO L87 Difference]: Start difference. First operand 1578 states and 2564 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:03,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:03,229 INFO L93 Difference]: Finished difference Result 1660 states and 2692 transitions. [2022-02-20 19:42:03,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:42:03,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 19:42:03,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:42:03,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:03,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:42:03,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:03,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:42:03,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1665 transitions. [2022-02-20 19:42:04,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1665 edges. 1665 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:04,782 INFO L225 Difference]: With dead ends: 1660 [2022-02-20 19:42:04,782 INFO L226 Difference]: Without dead ends: 1616 [2022-02-20 19:42:04,783 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:42:04,783 INFO L933 BasicCegarLoop]: 1592 mSDtfsCounter, 1498 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:42:04,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1498 Valid, 1659 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:42:04,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2022-02-20 19:42:04,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 1614. [2022-02-20 19:42:04,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:42:04,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1616 states. Second operand has 1614 states, 1612 states have (on average 1.6259305210918114) internal successors, (2621), 1613 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:04,825 INFO L74 IsIncluded]: Start isIncluded. First operand 1616 states. Second operand has 1614 states, 1612 states have (on average 1.6259305210918114) internal successors, (2621), 1613 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:04,827 INFO L87 Difference]: Start difference. First operand 1616 states. Second operand has 1614 states, 1612 states have (on average 1.6259305210918114) internal successors, (2621), 1613 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:04,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:04,918 INFO L93 Difference]: Finished difference Result 1616 states and 2622 transitions. [2022-02-20 19:42:04,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2622 transitions. [2022-02-20 19:42:04,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:04,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:04,924 INFO L74 IsIncluded]: Start isIncluded. First operand has 1614 states, 1612 states have (on average 1.6259305210918114) internal successors, (2621), 1613 states have internal predecessors, (2621), 0 states have call successors, (0), 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 1616 states. [2022-02-20 19:42:04,926 INFO L87 Difference]: Start difference. First operand has 1614 states, 1612 states have (on average 1.6259305210918114) internal successors, (2621), 1613 states have internal predecessors, (2621), 0 states have call successors, (0), 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 1616 states. [2022-02-20 19:42:05,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:05,007 INFO L93 Difference]: Finished difference Result 1616 states and 2622 transitions. [2022-02-20 19:42:05,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2622 transitions. [2022-02-20 19:42:05,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:05,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:05,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:42:05,010 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:42:05,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 1612 states have (on average 1.6259305210918114) internal successors, (2621), 1613 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:05,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 2621 transitions. [2022-02-20 19:42:05,146 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 2621 transitions. Word has length 52 [2022-02-20 19:42:05,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:42:05,147 INFO L470 AbstractCegarLoop]: Abstraction has 1614 states and 2621 transitions. [2022-02-20 19:42:05,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:05,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2621 transitions. [2022-02-20 19:42:05,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 19:42:05,148 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:42:05,148 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] [2022-02-20 19:42:05,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:42:05,149 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:42:05,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:42:05,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1780734059, now seen corresponding path program 1 times [2022-02-20 19:42:05,150 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:42:05,150 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748350257] [2022-02-20 19:42:05,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:42:05,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:42:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:42:05,214 INFO L290 TraceCheckUtils]: 0: Hoare triple {22399#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {22399#true} is VALID [2022-02-20 19:42:05,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {22399#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_#t~ret45#1;assume -2147483648 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 2147483647; {22399#true} is VALID [2022-02-20 19:42:05,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {22399#true} assume 0 != main_#t~nondet43#1;havoc main_#t~nondet43#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_#t~post28#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {22399#true} is VALID [2022-02-20 19:42:05,215 INFO L290 TraceCheckUtils]: 3: Hoare triple {22399#true} assume 0 == ~r1~0; {22399#true} is VALID [2022-02-20 19:42:05,215 INFO L290 TraceCheckUtils]: 4: Hoare triple {22399#true} assume ~id1~0 >= 0; {22399#true} is VALID [2022-02-20 19:42:05,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {22399#true} assume 0 == ~st1~0; {22399#true} is VALID [2022-02-20 19:42:05,216 INFO L290 TraceCheckUtils]: 6: Hoare triple {22399#true} assume ~send1~0 == ~id1~0; {22399#true} is VALID [2022-02-20 19:42:05,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {22399#true} assume 0 == ~mode1~0 % 256; {22399#true} is VALID [2022-02-20 19:42:05,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {22399#true} assume ~id2~0 >= 0; {22399#true} is VALID [2022-02-20 19:42:05,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {22399#true} assume 0 == ~st2~0; {22399#true} is VALID [2022-02-20 19:42:05,217 INFO L290 TraceCheckUtils]: 10: Hoare triple {22399#true} assume ~send2~0 == ~id2~0; {22399#true} is VALID [2022-02-20 19:42:05,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {22399#true} assume 0 == ~mode2~0 % 256; {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:05,226 INFO L290 TraceCheckUtils]: 12: Hoare triple {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:05,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:05,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:05,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:05,228 INFO L290 TraceCheckUtils]: 16: Hoare triple {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:05,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:05,229 INFO L290 TraceCheckUtils]: 18: Hoare triple {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:05,230 INFO L290 TraceCheckUtils]: 19: Hoare triple {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:05,231 INFO L290 TraceCheckUtils]: 20: Hoare triple {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:05,231 INFO L290 TraceCheckUtils]: 21: Hoare triple {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:05,231 INFO L290 TraceCheckUtils]: 22: Hoare triple {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:05,232 INFO L290 TraceCheckUtils]: 23: Hoare triple {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:05,233 INFO L290 TraceCheckUtils]: 24: Hoare triple {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:05,233 INFO L290 TraceCheckUtils]: 25: Hoare triple {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:05,234 INFO L290 TraceCheckUtils]: 26: Hoare triple {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:05,234 INFO L290 TraceCheckUtils]: 27: Hoare triple {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1; {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:05,235 INFO L290 TraceCheckUtils]: 28: Hoare triple {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == main1_~i2~0#1); {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:05,235 INFO L290 TraceCheckUtils]: 29: Hoare triple {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:05,236 INFO L290 TraceCheckUtils]: 30: Hoare triple {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(main1_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:05,236 INFO L290 TraceCheckUtils]: 31: Hoare triple {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:05,237 INFO L290 TraceCheckUtils]: 32: Hoare triple {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:05,237 INFO L290 TraceCheckUtils]: 33: Hoare triple {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:05,238 INFO L290 TraceCheckUtils]: 34: Hoare triple {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {22401#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:42:05,238 INFO L290 TraceCheckUtils]: 35: Hoare triple {22401#(= (+ (* (- 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; {22400#false} is VALID [2022-02-20 19:42:05,239 INFO L290 TraceCheckUtils]: 36: Hoare triple {22400#false} assume !(node2_~m2~0#1 != ~nomsg~0); {22400#false} is VALID [2022-02-20 19:42:05,239 INFO L290 TraceCheckUtils]: 37: Hoare triple {22400#false} ~mode2~0 := 0; {22400#false} is VALID [2022-02-20 19:42:05,239 INFO L290 TraceCheckUtils]: 38: Hoare triple {22400#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {22400#false} is VALID [2022-02-20 19:42:05,239 INFO L290 TraceCheckUtils]: 39: Hoare triple {22400#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {22400#false} is VALID [2022-02-20 19:42:05,239 INFO L290 TraceCheckUtils]: 40: Hoare triple {22400#false} assume !(node3_~m3~0#1 != ~nomsg~0); {22400#false} is VALID [2022-02-20 19:42:05,239 INFO L290 TraceCheckUtils]: 41: Hoare triple {22400#false} ~mode3~0 := 0; {22400#false} is VALID [2022-02-20 19:42:05,240 INFO L290 TraceCheckUtils]: 42: Hoare triple {22400#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {22400#false} is VALID [2022-02-20 19:42:05,240 INFO L290 TraceCheckUtils]: 43: Hoare triple {22400#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {22400#false} is VALID [2022-02-20 19:42:05,240 INFO L290 TraceCheckUtils]: 44: Hoare triple {22400#false} assume !(node4_~m4~0#1 != ~nomsg~0); {22400#false} is VALID [2022-02-20 19:42:05,240 INFO L290 TraceCheckUtils]: 45: Hoare triple {22400#false} ~mode4~0 := 0; {22400#false} is VALID [2022-02-20 19:42:05,240 INFO L290 TraceCheckUtils]: 46: Hoare triple {22400#false} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {22400#false} is VALID [2022-02-20 19:42:05,241 INFO L290 TraceCheckUtils]: 47: Hoare triple {22400#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {22400#false} is VALID [2022-02-20 19:42:05,241 INFO L290 TraceCheckUtils]: 48: Hoare triple {22400#false} check_#res#1 := check_~tmp~1#1; {22400#false} is VALID [2022-02-20 19:42:05,241 INFO L290 TraceCheckUtils]: 49: Hoare triple {22400#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {22400#false} is VALID [2022-02-20 19:42:05,241 INFO L290 TraceCheckUtils]: 50: Hoare triple {22400#false} assume 0 == assert_~arg#1 % 256; {22400#false} is VALID [2022-02-20 19:42:05,241 INFO L290 TraceCheckUtils]: 51: Hoare triple {22400#false} assume !false; {22400#false} is VALID [2022-02-20 19:42:05,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:42:05,242 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:42:05,242 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748350257] [2022-02-20 19:42:05,242 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748350257] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:42:05,243 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:42:05,243 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:42:05,243 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102280215] [2022-02-20 19:42:05,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:42:05,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 19:42:05,244 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:42:05,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:05,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:05,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:42:05,278 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:42:05,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:42:05,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:42:05,279 INFO L87 Difference]: Start difference. First operand 1614 states and 2621 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:07,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:07,027 INFO L93 Difference]: Finished difference Result 1762 states and 2853 transitions. [2022-02-20 19:42:07,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:42:07,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 19:42:07,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:42:07,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:07,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:42:07,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:07,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:42:07,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1665 transitions. [2022-02-20 19:42:08,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1665 edges. 1665 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:08,564 INFO L225 Difference]: With dead ends: 1762 [2022-02-20 19:42:08,564 INFO L226 Difference]: Without dead ends: 1682 [2022-02-20 19:42:08,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:42:08,566 INFO L933 BasicCegarLoop]: 1587 mSDtfsCounter, 1494 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 1658 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:42:08,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1494 Valid, 1658 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:42:08,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2022-02-20 19:42:08,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1680. [2022-02-20 19:42:08,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:42:08,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1682 states. Second operand has 1680 states, 1678 states have (on average 1.6233611442193088) internal successors, (2724), 1679 states have internal predecessors, (2724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:08,621 INFO L74 IsIncluded]: Start isIncluded. First operand 1682 states. Second operand has 1680 states, 1678 states have (on average 1.6233611442193088) internal successors, (2724), 1679 states have internal predecessors, (2724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:08,623 INFO L87 Difference]: Start difference. First operand 1682 states. Second operand has 1680 states, 1678 states have (on average 1.6233611442193088) internal successors, (2724), 1679 states have internal predecessors, (2724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:08,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:08,731 INFO L93 Difference]: Finished difference Result 1682 states and 2725 transitions. [2022-02-20 19:42:08,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2725 transitions. [2022-02-20 19:42:08,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:08,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:08,735 INFO L74 IsIncluded]: Start isIncluded. First operand has 1680 states, 1678 states have (on average 1.6233611442193088) internal successors, (2724), 1679 states have internal predecessors, (2724), 0 states have call successors, (0), 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 1682 states. [2022-02-20 19:42:08,737 INFO L87 Difference]: Start difference. First operand has 1680 states, 1678 states have (on average 1.6233611442193088) internal successors, (2724), 1679 states have internal predecessors, (2724), 0 states have call successors, (0), 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 1682 states. [2022-02-20 19:42:08,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:08,832 INFO L93 Difference]: Finished difference Result 1682 states and 2725 transitions. [2022-02-20 19:42:08,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2725 transitions. [2022-02-20 19:42:08,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:08,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:08,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:42:08,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:42:08,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1680 states, 1678 states have (on average 1.6233611442193088) internal successors, (2724), 1679 states have internal predecessors, (2724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:08,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2724 transitions. [2022-02-20 19:42:08,924 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 2724 transitions. Word has length 52 [2022-02-20 19:42:08,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:42:08,925 INFO L470 AbstractCegarLoop]: Abstraction has 1680 states and 2724 transitions. [2022-02-20 19:42:08,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:08,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2724 transitions. [2022-02-20 19:42:08,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 19:42:08,925 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:42:08,926 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:42:08,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:42:08,926 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:42:08,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:42:08,927 INFO L85 PathProgramCache]: Analyzing trace with hash 919948555, now seen corresponding path program 1 times [2022-02-20 19:42:08,927 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:42:08,927 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224897962] [2022-02-20 19:42:08,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:42:08,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:42:08,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:42:09,011 INFO L290 TraceCheckUtils]: 0: Hoare triple {29302#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {29302#true} is VALID [2022-02-20 19:42:09,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {29302#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_#t~ret45#1;assume -2147483648 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 2147483647; {29302#true} is VALID [2022-02-20 19:42:09,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {29302#true} assume 0 != main_#t~nondet43#1;havoc main_#t~nondet43#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_#t~post28#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {29302#true} is VALID [2022-02-20 19:42:09,012 INFO L290 TraceCheckUtils]: 3: Hoare triple {29302#true} assume 0 == ~r1~0; {29302#true} is VALID [2022-02-20 19:42:09,012 INFO L290 TraceCheckUtils]: 4: Hoare triple {29302#true} assume ~id1~0 >= 0; {29302#true} is VALID [2022-02-20 19:42:09,013 INFO L290 TraceCheckUtils]: 5: Hoare triple {29302#true} assume 0 == ~st1~0; {29302#true} is VALID [2022-02-20 19:42:09,013 INFO L290 TraceCheckUtils]: 6: Hoare triple {29302#true} assume ~send1~0 == ~id1~0; {29302#true} is VALID [2022-02-20 19:42:09,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {29302#true} assume 0 == ~mode1~0 % 256; {29302#true} is VALID [2022-02-20 19:42:09,013 INFO L290 TraceCheckUtils]: 8: Hoare triple {29302#true} assume ~id2~0 >= 0; {29302#true} is VALID [2022-02-20 19:42:09,013 INFO L290 TraceCheckUtils]: 9: Hoare triple {29302#true} assume 0 == ~st2~0; {29302#true} is VALID [2022-02-20 19:42:09,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {29302#true} assume ~send2~0 == ~id2~0; {29302#true} is VALID [2022-02-20 19:42:09,014 INFO L290 TraceCheckUtils]: 11: Hoare triple {29302#true} assume 0 == ~mode2~0 % 256; {29302#true} is VALID [2022-02-20 19:42:09,014 INFO L290 TraceCheckUtils]: 12: Hoare triple {29302#true} assume ~id3~0 >= 0; {29302#true} is VALID [2022-02-20 19:42:09,014 INFO L290 TraceCheckUtils]: 13: Hoare triple {29302#true} assume 0 == ~st3~0; {29302#true} is VALID [2022-02-20 19:42:09,014 INFO L290 TraceCheckUtils]: 14: Hoare triple {29302#true} assume ~send3~0 == ~id3~0; {29302#true} is VALID [2022-02-20 19:42:09,015 INFO L290 TraceCheckUtils]: 15: Hoare triple {29302#true} assume 0 == ~mode3~0 % 256; {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:09,015 INFO L290 TraceCheckUtils]: 16: Hoare triple {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:09,016 INFO L290 TraceCheckUtils]: 17: Hoare triple {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:09,016 INFO L290 TraceCheckUtils]: 18: Hoare triple {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:09,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:09,017 INFO L290 TraceCheckUtils]: 20: Hoare triple {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:09,018 INFO L290 TraceCheckUtils]: 21: Hoare triple {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:09,018 INFO L290 TraceCheckUtils]: 22: Hoare triple {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:09,018 INFO L290 TraceCheckUtils]: 23: Hoare triple {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:09,019 INFO L290 TraceCheckUtils]: 24: Hoare triple {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:09,027 INFO L290 TraceCheckUtils]: 25: Hoare triple {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:09,028 INFO L290 TraceCheckUtils]: 26: Hoare triple {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:09,028 INFO L290 TraceCheckUtils]: 27: Hoare triple {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1; {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:09,029 INFO L290 TraceCheckUtils]: 28: Hoare triple {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == main1_~i2~0#1); {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:09,029 INFO L290 TraceCheckUtils]: 29: Hoare triple {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:09,030 INFO L290 TraceCheckUtils]: 30: Hoare triple {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(main1_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:09,030 INFO L290 TraceCheckUtils]: 31: Hoare triple {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:09,031 INFO L290 TraceCheckUtils]: 32: Hoare triple {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:09,031 INFO L290 TraceCheckUtils]: 33: Hoare triple {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:09,032 INFO L290 TraceCheckUtils]: 34: Hoare triple {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:09,033 INFO L290 TraceCheckUtils]: 35: Hoare triple {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:09,035 INFO L290 TraceCheckUtils]: 36: Hoare triple {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:09,036 INFO L290 TraceCheckUtils]: 37: Hoare triple {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:09,038 INFO L290 TraceCheckUtils]: 38: Hoare triple {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {29304#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:42:09,038 INFO L290 TraceCheckUtils]: 39: Hoare triple {29304#(= (+ (* (- 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; {29303#false} is VALID [2022-02-20 19:42:09,039 INFO L290 TraceCheckUtils]: 40: Hoare triple {29303#false} assume !(node3_~m3~0#1 != ~nomsg~0); {29303#false} is VALID [2022-02-20 19:42:09,039 INFO L290 TraceCheckUtils]: 41: Hoare triple {29303#false} ~mode3~0 := 0; {29303#false} is VALID [2022-02-20 19:42:09,043 INFO L290 TraceCheckUtils]: 42: Hoare triple {29303#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {29303#false} is VALID [2022-02-20 19:42:09,043 INFO L290 TraceCheckUtils]: 43: Hoare triple {29303#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {29303#false} is VALID [2022-02-20 19:42:09,043 INFO L290 TraceCheckUtils]: 44: Hoare triple {29303#false} assume !(node4_~m4~0#1 != ~nomsg~0); {29303#false} is VALID [2022-02-20 19:42:09,044 INFO L290 TraceCheckUtils]: 45: Hoare triple {29303#false} ~mode4~0 := 0; {29303#false} is VALID [2022-02-20 19:42:09,044 INFO L290 TraceCheckUtils]: 46: Hoare triple {29303#false} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {29303#false} is VALID [2022-02-20 19:42:09,044 INFO L290 TraceCheckUtils]: 47: Hoare triple {29303#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {29303#false} is VALID [2022-02-20 19:42:09,044 INFO L290 TraceCheckUtils]: 48: Hoare triple {29303#false} check_#res#1 := check_~tmp~1#1; {29303#false} is VALID [2022-02-20 19:42:09,044 INFO L290 TraceCheckUtils]: 49: Hoare triple {29303#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {29303#false} is VALID [2022-02-20 19:42:09,044 INFO L290 TraceCheckUtils]: 50: Hoare triple {29303#false} assume 0 == assert_~arg#1 % 256; {29303#false} is VALID [2022-02-20 19:42:09,045 INFO L290 TraceCheckUtils]: 51: Hoare triple {29303#false} assume !false; {29303#false} is VALID [2022-02-20 19:42:09,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:42:09,045 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:42:09,045 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224897962] [2022-02-20 19:42:09,045 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224897962] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:42:09,046 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:42:09,046 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:42:09,046 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436899999] [2022-02-20 19:42:09,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:42:09,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 19:42:09,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:42:09,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:09,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:09,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:42:09,089 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:42:09,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:42:09,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:42:09,090 INFO L87 Difference]: Start difference. First operand 1680 states and 2724 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:10,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:10,898 INFO L93 Difference]: Finished difference Result 1948 states and 3142 transitions. [2022-02-20 19:42:10,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:42:10,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 19:42:10,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:42:10,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:10,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:42:10,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:10,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:42:10,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1665 transitions. [2022-02-20 19:42:12,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1665 edges. 1665 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:12,436 INFO L225 Difference]: With dead ends: 1948 [2022-02-20 19:42:12,436 INFO L226 Difference]: Without dead ends: 1802 [2022-02-20 19:42:12,436 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:42:12,438 INFO L933 BasicCegarLoop]: 1582 mSDtfsCounter, 1490 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1657 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:42:12,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1490 Valid, 1657 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:42:12,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2022-02-20 19:42:12,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1800. [2022-02-20 19:42:12,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:42:12,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1802 states. Second operand has 1800 states, 1798 states have (on average 1.617352614015573) internal successors, (2908), 1799 states have internal predecessors, (2908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:12,504 INFO L74 IsIncluded]: Start isIncluded. First operand 1802 states. Second operand has 1800 states, 1798 states have (on average 1.617352614015573) internal successors, (2908), 1799 states have internal predecessors, (2908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:12,506 INFO L87 Difference]: Start difference. First operand 1802 states. Second operand has 1800 states, 1798 states have (on average 1.617352614015573) internal successors, (2908), 1799 states have internal predecessors, (2908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:12,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:12,607 INFO L93 Difference]: Finished difference Result 1802 states and 2909 transitions. [2022-02-20 19:42:12,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2909 transitions. [2022-02-20 19:42:12,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:12,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:12,610 INFO L74 IsIncluded]: Start isIncluded. First operand has 1800 states, 1798 states have (on average 1.617352614015573) internal successors, (2908), 1799 states have internal predecessors, (2908), 0 states have call successors, (0), 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 1802 states. [2022-02-20 19:42:12,612 INFO L87 Difference]: Start difference. First operand has 1800 states, 1798 states have (on average 1.617352614015573) internal successors, (2908), 1799 states have internal predecessors, (2908), 0 states have call successors, (0), 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 1802 states. [2022-02-20 19:42:12,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:12,744 INFO L93 Difference]: Finished difference Result 1802 states and 2909 transitions. [2022-02-20 19:42:12,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2909 transitions. [2022-02-20 19:42:12,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:12,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:12,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:42:12,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:42:12,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1800 states, 1798 states have (on average 1.617352614015573) internal successors, (2908), 1799 states have internal predecessors, (2908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:12,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2908 transitions. [2022-02-20 19:42:12,849 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2908 transitions. Word has length 52 [2022-02-20 19:42:12,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:42:12,849 INFO L470 AbstractCegarLoop]: Abstraction has 1800 states and 2908 transitions. [2022-02-20 19:42:12,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:12,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2908 transitions. [2022-02-20 19:42:12,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 19:42:12,850 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:42:12,850 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] [2022-02-20 19:42:12,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:42:12,850 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:42:12,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:42:12,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1515907135, now seen corresponding path program 1 times [2022-02-20 19:42:12,851 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:42:12,851 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480278486] [2022-02-20 19:42:12,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:42:12,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:42:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:42:12,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {36821#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {36821#true} is VALID [2022-02-20 19:42:12,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {36821#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_#t~ret45#1;assume -2147483648 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 2147483647; {36821#true} is VALID [2022-02-20 19:42:12,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {36821#true} assume 0 != main_#t~nondet43#1;havoc main_#t~nondet43#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_#t~post28#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {36821#true} is VALID [2022-02-20 19:42:12,902 INFO L290 TraceCheckUtils]: 3: Hoare triple {36821#true} assume 0 == ~r1~0; {36821#true} is VALID [2022-02-20 19:42:12,902 INFO L290 TraceCheckUtils]: 4: Hoare triple {36821#true} assume ~id1~0 >= 0; {36821#true} is VALID [2022-02-20 19:42:12,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {36821#true} assume 0 == ~st1~0; {36821#true} is VALID [2022-02-20 19:42:12,902 INFO L290 TraceCheckUtils]: 6: Hoare triple {36821#true} assume ~send1~0 == ~id1~0; {36821#true} is VALID [2022-02-20 19:42:12,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {36821#true} assume 0 == ~mode1~0 % 256; {36821#true} is VALID [2022-02-20 19:42:12,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {36821#true} assume ~id2~0 >= 0; {36821#true} is VALID [2022-02-20 19:42:12,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {36821#true} assume 0 == ~st2~0; {36821#true} is VALID [2022-02-20 19:42:12,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {36821#true} assume ~send2~0 == ~id2~0; {36821#true} is VALID [2022-02-20 19:42:12,903 INFO L290 TraceCheckUtils]: 11: Hoare triple {36821#true} assume 0 == ~mode2~0 % 256; {36821#true} is VALID [2022-02-20 19:42:12,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {36821#true} assume ~id3~0 >= 0; {36821#true} is VALID [2022-02-20 19:42:12,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {36821#true} assume 0 == ~st3~0; {36821#true} is VALID [2022-02-20 19:42:12,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {36821#true} assume ~send3~0 == ~id3~0; {36821#true} is VALID [2022-02-20 19:42:12,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {36821#true} assume 0 == ~mode3~0 % 256; {36821#true} is VALID [2022-02-20 19:42:12,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {36821#true} assume ~id4~0 >= 0; {36821#true} is VALID [2022-02-20 19:42:12,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {36821#true} assume 0 == ~st4~0; {36821#true} is VALID [2022-02-20 19:42:12,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {36821#true} assume ~send4~0 == ~id4~0; {36821#true} is VALID [2022-02-20 19:42:12,905 INFO L290 TraceCheckUtils]: 19: Hoare triple {36821#true} assume 0 == ~mode4~0 % 256; {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:12,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:12,906 INFO L290 TraceCheckUtils]: 21: Hoare triple {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:12,906 INFO L290 TraceCheckUtils]: 22: Hoare triple {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:12,907 INFO L290 TraceCheckUtils]: 23: Hoare triple {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:12,907 INFO L290 TraceCheckUtils]: 24: Hoare triple {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:12,908 INFO L290 TraceCheckUtils]: 25: Hoare triple {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:12,908 INFO L290 TraceCheckUtils]: 26: Hoare triple {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:12,909 INFO L290 TraceCheckUtils]: 27: Hoare triple {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1; {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:12,909 INFO L290 TraceCheckUtils]: 28: Hoare triple {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == main1_~i2~0#1); {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:12,910 INFO L290 TraceCheckUtils]: 29: Hoare triple {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:12,910 INFO L290 TraceCheckUtils]: 30: Hoare triple {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(main1_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:12,911 INFO L290 TraceCheckUtils]: 31: Hoare triple {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:12,911 INFO L290 TraceCheckUtils]: 32: Hoare triple {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:12,912 INFO L290 TraceCheckUtils]: 33: Hoare triple {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:12,912 INFO L290 TraceCheckUtils]: 34: Hoare triple {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:12,913 INFO L290 TraceCheckUtils]: 35: Hoare triple {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:12,913 INFO L290 TraceCheckUtils]: 36: Hoare triple {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:12,914 INFO L290 TraceCheckUtils]: 37: Hoare triple {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:12,914 INFO L290 TraceCheckUtils]: 38: Hoare triple {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:12,915 INFO L290 TraceCheckUtils]: 39: Hoare triple {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:12,915 INFO L290 TraceCheckUtils]: 40: Hoare triple {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite7#1 := ~p3_new~0; {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:12,916 INFO L290 TraceCheckUtils]: 41: Hoare triple {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:12,916 INFO L290 TraceCheckUtils]: 42: Hoare triple {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {36823#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:42:12,917 INFO L290 TraceCheckUtils]: 43: Hoare triple {36823#(= (+ (* (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; {36822#false} is VALID [2022-02-20 19:42:12,917 INFO L290 TraceCheckUtils]: 44: Hoare triple {36822#false} assume !(node4_~m4~0#1 != ~nomsg~0); {36822#false} is VALID [2022-02-20 19:42:12,917 INFO L290 TraceCheckUtils]: 45: Hoare triple {36822#false} ~mode4~0 := 0; {36822#false} is VALID [2022-02-20 19:42:12,917 INFO L290 TraceCheckUtils]: 46: Hoare triple {36822#false} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {36822#false} is VALID [2022-02-20 19:42:12,917 INFO L290 TraceCheckUtils]: 47: Hoare triple {36822#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {36822#false} is VALID [2022-02-20 19:42:12,918 INFO L290 TraceCheckUtils]: 48: Hoare triple {36822#false} check_#res#1 := check_~tmp~1#1; {36822#false} is VALID [2022-02-20 19:42:12,918 INFO L290 TraceCheckUtils]: 49: Hoare triple {36822#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {36822#false} is VALID [2022-02-20 19:42:12,918 INFO L290 TraceCheckUtils]: 50: Hoare triple {36822#false} assume 0 == assert_~arg#1 % 256; {36822#false} is VALID [2022-02-20 19:42:12,918 INFO L290 TraceCheckUtils]: 51: Hoare triple {36822#false} assume !false; {36822#false} is VALID [2022-02-20 19:42:12,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:42:12,919 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:42:12,919 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480278486] [2022-02-20 19:42:12,919 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480278486] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:42:12,919 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:42:12,919 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:42:12,919 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873995724] [2022-02-20 19:42:12,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:42:12,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 19:42:12,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:42:12,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:12,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:12,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:42:12,964 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:42:12,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:42:12,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:42:12,965 INFO L87 Difference]: Start difference. First operand 1800 states and 2908 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:14,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:14,819 INFO L93 Difference]: Finished difference Result 2284 states and 3654 transitions. [2022-02-20 19:42:14,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:42:14,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 19:42:14,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:42:14,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:14,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:42:14,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:14,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2022-02-20 19:42:14,829 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1665 transitions. [2022-02-20 19:42:16,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1665 edges. 1665 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:16,362 INFO L225 Difference]: With dead ends: 2284 [2022-02-20 19:42:16,362 INFO L226 Difference]: Without dead ends: 2018 [2022-02-20 19:42:16,363 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:42:16,363 INFO L933 BasicCegarLoop]: 1577 mSDtfsCounter, 1486 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:42:16,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1486 Valid, 1656 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:42:16,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018 states. [2022-02-20 19:42:16,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2018 to 2016. [2022-02-20 19:42:16,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:42:16,468 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2018 states. Second operand has 2016 states, 2014 states have (on average 1.6047666335650448) internal successors, (3232), 2015 states have internal predecessors, (3232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:16,470 INFO L74 IsIncluded]: Start isIncluded. First operand 2018 states. Second operand has 2016 states, 2014 states have (on average 1.6047666335650448) internal successors, (3232), 2015 states have internal predecessors, (3232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:16,472 INFO L87 Difference]: Start difference. First operand 2018 states. Second operand has 2016 states, 2014 states have (on average 1.6047666335650448) internal successors, (3232), 2015 states have internal predecessors, (3232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:16,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:16,642 INFO L93 Difference]: Finished difference Result 2018 states and 3233 transitions. [2022-02-20 19:42:16,642 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 3233 transitions. [2022-02-20 19:42:16,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:16,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:16,648 INFO L74 IsIncluded]: Start isIncluded. First operand has 2016 states, 2014 states have (on average 1.6047666335650448) internal successors, (3232), 2015 states have internal predecessors, (3232), 0 states have call successors, (0), 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 2018 states. [2022-02-20 19:42:16,651 INFO L87 Difference]: Start difference. First operand has 2016 states, 2014 states have (on average 1.6047666335650448) internal successors, (3232), 2015 states have internal predecessors, (3232), 0 states have call successors, (0), 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 2018 states. [2022-02-20 19:42:16,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:16,821 INFO L93 Difference]: Finished difference Result 2018 states and 3233 transitions. [2022-02-20 19:42:16,821 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 3233 transitions. [2022-02-20 19:42:16,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:42:16,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:42:16,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:42:16,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:42:16,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2016 states, 2014 states have (on average 1.6047666335650448) internal successors, (3232), 2015 states have internal predecessors, (3232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:16,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2016 states to 2016 states and 3232 transitions. [2022-02-20 19:42:16,948 INFO L78 Accepts]: Start accepts. Automaton has 2016 states and 3232 transitions. Word has length 52 [2022-02-20 19:42:16,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:42:16,948 INFO L470 AbstractCegarLoop]: Abstraction has 2016 states and 3232 transitions. [2022-02-20 19:42:16,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:16,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2016 states and 3232 transitions. [2022-02-20 19:42:16,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 19:42:16,949 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:42:16,949 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] [2022-02-20 19:42:16,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:42:16,949 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:42:16,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:42:16,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1924545907, now seen corresponding path program 1 times [2022-02-20 19:42:16,950 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:42:16,950 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012184313] [2022-02-20 19:42:16,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:42:16,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:42:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:42:17,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {45464#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {45464#true} is VALID [2022-02-20 19:42:17,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {45464#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_#t~ret45#1;assume -2147483648 <= main_#t~nondet43#1 && main_#t~nondet43#1 <= 2147483647; {45464#true} is VALID [2022-02-20 19:42:17,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {45464#true} assume 0 != main_#t~nondet43#1;havoc main_#t~nondet43#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~ret26#1, main1_#t~ret27#1, main1_#t~post28#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~r1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~id1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~st1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~send1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;~mode1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id4~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st4~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {45464#true} is VALID [2022-02-20 19:42:17,029 INFO L290 TraceCheckUtils]: 3: Hoare triple {45464#true} assume 0 == ~r1~0; {45464#true} is VALID [2022-02-20 19:42:17,029 INFO L290 TraceCheckUtils]: 4: Hoare triple {45464#true} assume ~id1~0 >= 0; {45464#true} is VALID [2022-02-20 19:42:17,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {45464#true} assume 0 == ~st1~0; {45466#(<= ~st1~0 0)} is VALID [2022-02-20 19:42:17,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {45466#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {45466#(<= ~st1~0 0)} is VALID [2022-02-20 19:42:17,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {45466#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {45466#(<= ~st1~0 0)} is VALID [2022-02-20 19:42:17,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {45466#(<= ~st1~0 0)} assume ~id2~0 >= 0; {45466#(<= ~st1~0 0)} is VALID [2022-02-20 19:42:17,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {45466#(<= ~st1~0 0)} assume 0 == ~st2~0; {45467#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:17,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {45467#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {45467#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:17,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {45467#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {45467#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:17,032 INFO L290 TraceCheckUtils]: 12: Hoare triple {45467#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {45467#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:17,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {45467#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {45468#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:17,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {45468#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {45468#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:17,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {45468#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {45468#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:17,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {45468#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {45468#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:17,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {45468#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:17,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:17,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:17,036 INFO L290 TraceCheckUtils]: 20: Hoare triple {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:17,036 INFO L290 TraceCheckUtils]: 21: Hoare triple {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:17,037 INFO L290 TraceCheckUtils]: 22: Hoare triple {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id4~0; {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:17,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0; {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:17,037 INFO L290 TraceCheckUtils]: 24: Hoare triple {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id4~0; {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:17,038 INFO L290 TraceCheckUtils]: 25: Hoare triple {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:17,038 INFO L290 TraceCheckUtils]: 26: Hoare triple {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:17,041 INFO L290 TraceCheckUtils]: 27: Hoare triple {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} main1_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret26#1 && main1_#t~ret26#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret26#1;havoc main1_#t~ret26#1; {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:17,042 INFO L290 TraceCheckUtils]: 28: Hoare triple {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main1_~i2~0#1); {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:17,042 INFO L290 TraceCheckUtils]: 29: Hoare triple {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:17,043 INFO L290 TraceCheckUtils]: 30: Hoare triple {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(main1_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:17,043 INFO L290 TraceCheckUtils]: 31: Hoare triple {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:17,044 INFO L290 TraceCheckUtils]: 32: Hoare triple {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:17,044 INFO L290 TraceCheckUtils]: 33: Hoare triple {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:17,045 INFO L290 TraceCheckUtils]: 34: Hoare triple {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:17,045 INFO L290 TraceCheckUtils]: 35: Hoare triple {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:17,046 INFO L290 TraceCheckUtils]: 36: Hoare triple {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:17,046 INFO L290 TraceCheckUtils]: 37: Hoare triple {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:17,047 INFO L290 TraceCheckUtils]: 38: Hoare triple {45469#(<= (+ ~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_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:17,047 INFO L290 TraceCheckUtils]: 39: Hoare triple {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:17,047 INFO L290 TraceCheckUtils]: 40: Hoare triple {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0);node3_#t~ite7#1 := ~p3_new~0; {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:17,048 INFO L290 TraceCheckUtils]: 41: Hoare triple {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:17,048 INFO L290 TraceCheckUtils]: 42: Hoare triple {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:17,049 INFO L290 TraceCheckUtils]: 43: Hoare triple {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode4~0 % 256); {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:17,049 INFO L290 TraceCheckUtils]: 44: Hoare triple {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0);node4_#t~ite8#1 := ~p4_new~0; {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:17,050 INFO L290 TraceCheckUtils]: 45: Hoare triple {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:17,050 INFO L290 TraceCheckUtils]: 46: Hoare triple {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:42:17,051 INFO L290 TraceCheckUtils]: 47: Hoare triple {45469#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {45465#false} is VALID [2022-02-20 19:42:17,051 INFO L290 TraceCheckUtils]: 48: Hoare triple {45465#false} check_#res#1 := check_~tmp~1#1; {45465#false} is VALID [2022-02-20 19:42:17,051 INFO L290 TraceCheckUtils]: 49: Hoare triple {45465#false} main1_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret27#1 && main1_#t~ret27#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret27#1;havoc main1_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {45465#false} is VALID [2022-02-20 19:42:17,051 INFO L290 TraceCheckUtils]: 50: Hoare triple {45465#false} assume 0 == assert_~arg#1 % 256; {45465#false} is VALID [2022-02-20 19:42:17,052 INFO L290 TraceCheckUtils]: 51: Hoare triple {45465#false} assume !false; {45465#false} is VALID [2022-02-20 19:42:17,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:42:17,052 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:42:17,052 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012184313] [2022-02-20 19:42:17,052 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012184313] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:42:17,053 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:42:17,053 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:42:17,053 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650755587] [2022-02-20 19:42:17,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:42:17,053 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 19:42:17,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:42:17,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:17,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:17,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:42:17,094 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:42:17,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:42:17,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:42:17,094 INFO L87 Difference]: Start difference. First operand 2016 states and 3232 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:22,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:42:22,443 INFO L93 Difference]: Finished difference Result 5872 states and 9128 transitions. [2022-02-20 19:42:22,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 19:42:22,443 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-02-20 19:42:22,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:42:22,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:22,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2089 transitions. [2022-02-20 19:42:22,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:22,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2089 transitions. [2022-02-20 19:42:22,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 2089 transitions. [2022-02-20 19:42:24,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2089 edges. 2089 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:42:25,015 INFO L225 Difference]: With dead ends: 5872 [2022-02-20 19:42:25,015 INFO L226 Difference]: Without dead ends: 5390 [2022-02-20 19:42:25,017 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:42:25,018 INFO L933 BasicCegarLoop]: 1531 mSDtfsCounter, 6521 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6521 SdHoareTripleChecker+Valid, 2068 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:42:25,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6521 Valid, 2068 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:42:25,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5390 states. [2022-02-20 19:42:25,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5390 to 2496. [2022-02-20 19:42:25,703 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:42:25,707 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5390 states. Second operand has 2496 states, 2494 states have (on average 1.578187650360866) internal successors, (3936), 2495 states have internal predecessors, (3936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:25,710 INFO L74 IsIncluded]: Start isIncluded. First operand 5390 states. Second operand has 2496 states, 2494 states have (on average 1.578187650360866) internal successors, (3936), 2495 states have internal predecessors, (3936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:42:25,712 INFO L87 Difference]: Start difference. First operand 5390 states. Second operand has 2496 states, 2494 states have (on average 1.578187650360866) internal successors, (3936), 2495 states have internal predecessors, (3936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)