./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label06.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.8.ufo.UNBOUNDED.pals+Problem12_label06.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 6d316a7ba22efd80f1b38cf51bd9ff0ce90b0827d98cb289348ffc09e69061f8 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:53:25,348 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:53:25,350 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:53:25,385 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:53:25,386 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:53:25,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:53:25,389 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:53:25,391 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:53:25,392 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:53:25,396 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:53:25,396 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:53:25,397 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:53:25,397 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:53:25,399 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:53:25,400 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:53:25,402 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:53:25,403 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:53:25,403 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:53:25,405 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:53:25,409 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:53:25,410 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:53:25,411 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:53:25,412 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:53:25,412 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:53:25,417 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:53:25,417 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:53:25,418 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:53:25,419 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:53:25,419 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:53:25,420 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:53:25,420 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:53:25,421 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:53:25,422 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:53:25,423 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:53:25,424 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:53:25,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:53:25,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:53:25,425 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:53:25,425 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:53:25,426 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:53:25,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:53:25,427 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:53:25,452 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:53:25,452 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:53:25,453 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:53:25,453 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:53:25,453 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:53:25,453 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:53:25,454 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:53:25,454 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:53:25,454 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:53:25,454 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:53:25,455 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:53:25,455 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:53:25,455 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:53:25,456 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:53:25,456 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:53:25,456 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:53:25,456 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:53:25,456 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:53:25,456 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:53:25,457 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:53:25,457 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:53:25,457 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:53:25,457 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:53:25,457 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:53:25,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:53:25,458 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:53:25,458 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:53:25,458 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:53:25,458 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:53:25,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:53:25,458 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:53:25,459 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:53:25,459 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:53:25,459 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 -> 6d316a7ba22efd80f1b38cf51bd9ff0ce90b0827d98cb289348ffc09e69061f8 [2022-02-20 19:53:25,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:53:25,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:53:25,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:53:25,652 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:53:25,653 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:53:25,653 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label06.c [2022-02-20 19:53:25,723 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/253070a57/ed213d3dd8494118b587ebd285dd7092/FLAG6a1b05c75 [2022-02-20 19:53:26,194 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:53:26,194 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label06.c [2022-02-20 19:53:26,230 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/253070a57/ed213d3dd8494118b587ebd285dd7092/FLAG6a1b05c75 [2022-02-20 19:53:26,464 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/253070a57/ed213d3dd8494118b587ebd285dd7092 [2022-02-20 19:53:26,466 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:53:26,468 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:53:26,470 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:53:26,470 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:53:26,473 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:53:26,473 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:53:26" (1/1) ... [2022-02-20 19:53:26,474 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@387e6a94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:26, skipping insertion in model container [2022-02-20 19:53:26,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:53:26" (1/1) ... [2022-02-20 19:53:26,479 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:53:26,571 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:53:26,901 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label06.c[26888,26901] [2022-02-20 19:53:26,941 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.8.ufo.UNBOUNDED.pals+Problem12_label06.c[29705,29718] [2022-02-20 19:53:27,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:53:27,457 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:53:27,502 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.8.ufo.UNBOUNDED.pals+Problem12_label06.c[26888,26901] [2022-02-20 19:53:27,510 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.8.ufo.UNBOUNDED.pals+Problem12_label06.c[29705,29718] [2022-02-20 19:53:27,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:53:27,818 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:53:27,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:27 WrapperNode [2022-02-20 19:53:27,819 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:53:27,820 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:53:27,820 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:53:27,820 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:53:27,825 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:53:27" (1/1) ... [2022-02-20 19:53:27,866 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:53:27" (1/1) ... [2022-02-20 19:53:28,232 INFO L137 Inliner]: procedures = 40, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5279 [2022-02-20 19:53:28,232 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:53:28,233 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:53:28,233 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:53:28,245 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:53:28,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:27" (1/1) ... [2022-02-20 19:53:28,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:27" (1/1) ... [2022-02-20 19:53:28,346 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:27" (1/1) ... [2022-02-20 19:53:28,347 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:27" (1/1) ... [2022-02-20 19:53:28,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:27" (1/1) ... [2022-02-20 19:53:28,574 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:27" (1/1) ... [2022-02-20 19:53:28,591 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:27" (1/1) ... [2022-02-20 19:53:28,626 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:53:28,627 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:53:28,627 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:53:28,627 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:53:28,628 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:27" (1/1) ... [2022-02-20 19:53:28,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:53:28,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:53:28,654 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:53:28,672 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:53:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:53:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:53:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:53:28,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:53:28,814 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:53:28,815 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:53:35,474 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:53:35,484 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:53:35,484 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:53:35,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:53:35 BoogieIcfgContainer [2022-02-20 19:53:35,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:53:35,488 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:53:35,488 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:53:35,490 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:53:35,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:53:26" (1/3) ... [2022-02-20 19:53:35,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c66d88d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:53:35, skipping insertion in model container [2022-02-20 19:53:35,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:27" (2/3) ... [2022-02-20 19:53:35,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c66d88d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:53:35, skipping insertion in model container [2022-02-20 19:53:35,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:53:35" (3/3) ... [2022-02-20 19:53:35,493 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label06.c [2022-02-20 19:53:35,496 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:53:35,496 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:53:35,534 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:53:35,538 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:53:35,538 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:53:35,566 INFO L276 IsEmpty]: Start isEmpty. Operand has 965 states, 962 states have (on average 1.8960498960498962) internal successors, (1824), 964 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have 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:53:35,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 19:53:35,571 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:35,571 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] [2022-02-20 19:53:35,572 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:35,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:35,576 INFO L85 PathProgramCache]: Analyzing trace with hash -25024235, now seen corresponding path program 1 times [2022-02-20 19:53:35,582 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:35,582 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567050215] [2022-02-20 19:53:35,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:35,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:35,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:35,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {968#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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {970#(<= 4 ~a5~0)} is VALID [2022-02-20 19:53:35,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {970#(<= 4 ~a5~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {970#(<= 4 ~a5~0)} is VALID [2022-02-20 19:53:35,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {970#(<= 4 ~a5~0)} assume !(0 != main_#t~nondet62#1);havoc main_#t~nondet62#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet60#1, main2_#t~ret61#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {970#(<= 4 ~a5~0)} is VALID [2022-02-20 19:53:35,851 INFO L290 TraceCheckUtils]: 3: Hoare triple {970#(<= 4 ~a5~0)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet60#1 && main2_#t~nondet60#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet60#1;havoc main2_#t~nondet60#1; {970#(<= 4 ~a5~0)} is VALID [2022-02-20 19:53:35,853 INFO L290 TraceCheckUtils]: 4: Hoare triple {970#(<= 4 ~a5~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~ret57#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {970#(<= 4 ~a5~0)} is VALID [2022-02-20 19:53:35,854 INFO L290 TraceCheckUtils]: 5: Hoare triple {970#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {970#(<= 4 ~a5~0)} is VALID [2022-02-20 19:53:35,854 INFO L290 TraceCheckUtils]: 6: Hoare triple {970#(<= 4 ~a5~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {970#(<= 4 ~a5~0)} is VALID [2022-02-20 19:53:35,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {970#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {970#(<= 4 ~a5~0)} is VALID [2022-02-20 19:53:35,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {970#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {970#(<= 4 ~a5~0)} is VALID [2022-02-20 19:53:35,859 INFO L290 TraceCheckUtils]: 9: Hoare triple {970#(<= 4 ~a5~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {970#(<= 4 ~a5~0)} is VALID [2022-02-20 19:53:35,860 INFO L290 TraceCheckUtils]: 10: Hoare triple {970#(<= 4 ~a5~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {970#(<= 4 ~a5~0)} is VALID [2022-02-20 19:53:35,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {970#(<= 4 ~a5~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {970#(<= 4 ~a5~0)} is VALID [2022-02-20 19:53:35,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {970#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {970#(<= 4 ~a5~0)} is VALID [2022-02-20 19:53:35,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {970#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {970#(<= 4 ~a5~0)} is VALID [2022-02-20 19:53:35,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {970#(<= 4 ~a5~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {970#(<= 4 ~a5~0)} is VALID [2022-02-20 19:53:35,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {970#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {970#(<= 4 ~a5~0)} is VALID [2022-02-20 19:53:35,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {970#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {970#(<= 4 ~a5~0)} is VALID [2022-02-20 19:53:35,863 INFO L290 TraceCheckUtils]: 17: Hoare triple {970#(<= 4 ~a5~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {970#(<= 4 ~a5~0)} is VALID [2022-02-20 19:53:35,863 INFO L290 TraceCheckUtils]: 18: Hoare triple {970#(<= 4 ~a5~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {970#(<= 4 ~a5~0)} is VALID [2022-02-20 19:53:35,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {970#(<= 4 ~a5~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {970#(<= 4 ~a5~0)} is VALID [2022-02-20 19:53:35,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {970#(<= 4 ~a5~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {970#(<= 4 ~a5~0)} is VALID [2022-02-20 19:53:35,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {970#(<= 4 ~a5~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {970#(<= 4 ~a5~0)} is VALID [2022-02-20 19:53:35,866 INFO L290 TraceCheckUtils]: 22: Hoare triple {970#(<= 4 ~a5~0)} assume (((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {969#false} is VALID [2022-02-20 19:53:35,866 INFO L290 TraceCheckUtils]: 23: Hoare triple {969#false} assume !false; {969#false} is VALID [2022-02-20 19:53:35,867 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:53:35,868 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:35,868 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567050215] [2022-02-20 19:53:35,868 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567050215] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:35,869 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:35,869 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:53:35,870 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796068843] [2022-02-20 19:53:35,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:35,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-20 19:53:35,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:35,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have 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:53:35,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:35,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:53:35,910 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:35,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:53:35,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:53:35,932 INFO L87 Difference]: Start difference. First operand has 965 states, 962 states have (on average 1.8960498960498962) internal successors, (1824), 964 states have internal predecessors, (1824), 0 states have call successors, (0), 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 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have 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:53:41,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:41,448 INFO L93 Difference]: Finished difference Result 2616 states and 5018 transitions. [2022-02-20 19:53:41,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:53:41,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-20 19:53:41,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:41,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have 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:53:41,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5018 transitions. [2022-02-20 19:53:41,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have 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:53:41,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5018 transitions. [2022-02-20 19:53:41,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 5018 transitions. [2022-02-20 19:53:45,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5018 edges. 5018 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:45,198 INFO L225 Difference]: With dead ends: 2616 [2022-02-20 19:53:45,198 INFO L226 Difference]: Without dead ends: 1650 [2022-02-20 19:53:45,205 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:53:45,210 INFO L933 BasicCegarLoop]: 399 mSDtfsCounter, 1126 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2437 mSolverCounterSat, 771 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1126 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 3208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 771 IncrementalHoareTripleChecker+Valid, 2437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:53:45,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1126 Valid, 410 Invalid, 3208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [771 Valid, 2437 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-02-20 19:53:45,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2022-02-20 19:53:45,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1650. [2022-02-20 19:53:45,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:45,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1650 states. Second operand has 1650 states, 1648 states have (on average 1.8385922330097086) internal successors, (3030), 1649 states have internal predecessors, (3030), 0 states have call successors, (0), 0 states have 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:53:45,300 INFO L74 IsIncluded]: Start isIncluded. First operand 1650 states. Second operand has 1650 states, 1648 states have (on average 1.8385922330097086) internal successors, (3030), 1649 states have internal predecessors, (3030), 0 states have call successors, (0), 0 states have 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:53:45,310 INFO L87 Difference]: Start difference. First operand 1650 states. Second operand has 1650 states, 1648 states have (on average 1.8385922330097086) internal successors, (3030), 1649 states have internal predecessors, (3030), 0 states have call successors, (0), 0 states have 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:53:45,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:45,401 INFO L93 Difference]: Finished difference Result 1650 states and 3030 transitions. [2022-02-20 19:53:45,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 3030 transitions. [2022-02-20 19:53:45,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:45,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:45,415 INFO L74 IsIncluded]: Start isIncluded. First operand has 1650 states, 1648 states have (on average 1.8385922330097086) internal successors, (3030), 1649 states have internal predecessors, (3030), 0 states have call successors, (0), 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 1650 states. [2022-02-20 19:53:45,418 INFO L87 Difference]: Start difference. First operand has 1650 states, 1648 states have (on average 1.8385922330097086) internal successors, (3030), 1649 states have internal predecessors, (3030), 0 states have call successors, (0), 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 1650 states. [2022-02-20 19:53:45,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:45,510 INFO L93 Difference]: Finished difference Result 1650 states and 3030 transitions. [2022-02-20 19:53:45,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 3030 transitions. [2022-02-20 19:53:45,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:45,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:45,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:53:45,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:53:45,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1650 states, 1648 states have (on average 1.8385922330097086) internal successors, (3030), 1649 states have internal predecessors, (3030), 0 states have call successors, (0), 0 states have 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:53:45,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1650 states and 3030 transitions. [2022-02-20 19:53:45,611 INFO L78 Accepts]: Start accepts. Automaton has 1650 states and 3030 transitions. Word has length 24 [2022-02-20 19:53:45,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:53:45,612 INFO L470 AbstractCegarLoop]: Abstraction has 1650 states and 3030 transitions. [2022-02-20 19:53:45,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have 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:53:45,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 3030 transitions. [2022-02-20 19:53:45,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 19:53:45,614 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:45,614 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] [2022-02-20 19:53:45,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:53:45,619 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:45,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:45,620 INFO L85 PathProgramCache]: Analyzing trace with hash 2117945689, now seen corresponding path program 1 times [2022-02-20 19:53:45,621 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:45,621 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732646227] [2022-02-20 19:53:45,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:45,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:45,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {8603#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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {8603#true} is VALID [2022-02-20 19:53:45,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {8603#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {8603#true} is VALID [2022-02-20 19:53:45,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {8603#true} assume 0 != main_#t~nondet62#1;havoc main_#t~nondet62#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {8603#true} is VALID [2022-02-20 19:53:45,756 INFO L290 TraceCheckUtils]: 3: Hoare triple {8603#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {8605#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:53:45,756 INFO L290 TraceCheckUtils]: 4: Hoare triple {8605#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {8606#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:53:45,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {8606#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {8607#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:53:45,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {8607#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {8604#false} is VALID [2022-02-20 19:53:45,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {8604#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {8604#false} is VALID [2022-02-20 19:53:45,759 INFO L290 TraceCheckUtils]: 8: Hoare triple {8604#false} assume !false;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; {8604#false} is VALID [2022-02-20 19:53:45,759 INFO L290 TraceCheckUtils]: 9: Hoare triple {8604#false} assume !(0 != ~mode1~0 % 256); {8604#false} is VALID [2022-02-20 19:53:45,759 INFO L290 TraceCheckUtils]: 10: Hoare triple {8604#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {8604#false} is VALID [2022-02-20 19:53:45,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {8604#false} ~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; {8604#false} is VALID [2022-02-20 19:53:45,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {8604#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; {8604#false} is VALID [2022-02-20 19:53:45,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {8604#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {8604#false} is VALID [2022-02-20 19:53:45,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {8604#false} assume !(node2_~m2~0#1 != ~nomsg~0); {8604#false} is VALID [2022-02-20 19:53:45,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {8604#false} ~mode2~0 := 0; {8604#false} is VALID [2022-02-20 19:53:45,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {8604#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; {8604#false} is VALID [2022-02-20 19:53:45,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {8604#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {8604#false} is VALID [2022-02-20 19:53:45,761 INFO L290 TraceCheckUtils]: 18: Hoare triple {8604#false} assume !(node3_~m3~0#1 != ~nomsg~0); {8604#false} is VALID [2022-02-20 19:53:45,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {8604#false} ~mode3~0 := 0; {8604#false} is VALID [2022-02-20 19:53:45,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {8604#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; {8604#false} is VALID [2022-02-20 19:53:45,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {8604#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {8604#false} is VALID [2022-02-20 19:53:45,762 INFO L290 TraceCheckUtils]: 22: Hoare triple {8604#false} assume !(node4_~m4~0#1 != ~nomsg~0); {8604#false} is VALID [2022-02-20 19:53:45,763 INFO L290 TraceCheckUtils]: 23: Hoare triple {8604#false} ~mode4~0 := 0; {8604#false} is VALID [2022-02-20 19:53:45,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {8604#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {8604#false} is VALID [2022-02-20 19:53:45,765 INFO L290 TraceCheckUtils]: 25: Hoare triple {8604#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {8604#false} is VALID [2022-02-20 19:53:45,765 INFO L290 TraceCheckUtils]: 26: Hoare triple {8604#false} assume !(node5_~m5~0#1 != ~nomsg~0); {8604#false} is VALID [2022-02-20 19:53:45,766 INFO L290 TraceCheckUtils]: 27: Hoare triple {8604#false} ~mode5~0 := 0; {8604#false} is VALID [2022-02-20 19:53:45,766 INFO L290 TraceCheckUtils]: 28: Hoare triple {8604#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {8604#false} is VALID [2022-02-20 19:53:45,766 INFO L290 TraceCheckUtils]: 29: Hoare triple {8604#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {8604#false} is VALID [2022-02-20 19:53:45,766 INFO L290 TraceCheckUtils]: 30: Hoare triple {8604#false} assume !(node6_~m6~0#1 != ~nomsg~0); {8604#false} is VALID [2022-02-20 19:53:45,768 INFO L290 TraceCheckUtils]: 31: Hoare triple {8604#false} ~mode6~0 := 0; {8604#false} is VALID [2022-02-20 19:53:45,768 INFO L290 TraceCheckUtils]: 32: Hoare triple {8604#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {8604#false} is VALID [2022-02-20 19:53:45,768 INFO L290 TraceCheckUtils]: 33: Hoare triple {8604#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {8604#false} is VALID [2022-02-20 19:53:45,769 INFO L290 TraceCheckUtils]: 34: Hoare triple {8604#false} assume !(node7_~m7~0#1 != ~nomsg~0); {8604#false} is VALID [2022-02-20 19:53:45,769 INFO L290 TraceCheckUtils]: 35: Hoare triple {8604#false} ~mode7~0 := 0; {8604#false} is VALID [2022-02-20 19:53:45,769 INFO L290 TraceCheckUtils]: 36: Hoare triple {8604#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {8604#false} is VALID [2022-02-20 19:53:45,769 INFO L290 TraceCheckUtils]: 37: Hoare triple {8604#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {8604#false} is VALID [2022-02-20 19:53:45,770 INFO L290 TraceCheckUtils]: 38: Hoare triple {8604#false} assume !(node8_~m8~0#1 != ~nomsg~0); {8604#false} is VALID [2022-02-20 19:53:45,770 INFO L290 TraceCheckUtils]: 39: Hoare triple {8604#false} ~mode8~0 := 0; {8604#false} is VALID [2022-02-20 19:53:45,770 INFO L290 TraceCheckUtils]: 40: Hoare triple {8604#false} assume { :end_inline_node8 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {8604#false} is VALID [2022-02-20 19:53:45,770 INFO L290 TraceCheckUtils]: 41: Hoare triple {8604#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {8604#false} is VALID [2022-02-20 19:53:45,771 INFO L290 TraceCheckUtils]: 42: Hoare triple {8604#false} check_#res#1 := check_~tmp~1#1; {8604#false} is VALID [2022-02-20 19:53:45,771 INFO L290 TraceCheckUtils]: 43: Hoare triple {8604#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#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; {8604#false} is VALID [2022-02-20 19:53:45,771 INFO L290 TraceCheckUtils]: 44: Hoare triple {8604#false} assume 0 == assert_~arg#1 % 256; {8604#false} is VALID [2022-02-20 19:53:45,771 INFO L290 TraceCheckUtils]: 45: Hoare triple {8604#false} assume !false; {8604#false} is VALID [2022-02-20 19:53:45,772 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:53:45,772 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:45,772 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732646227] [2022-02-20 19:53:45,772 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732646227] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:45,773 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:45,773 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:53:45,773 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076474286] [2022-02-20 19:53:45,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:45,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2022-02-20 19:53:45,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:45,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:53:45,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:45,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:53:45,800 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:45,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:53:45,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:53:45,802 INFO L87 Difference]: Start difference. First operand 1650 states and 3030 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:53:49,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:49,766 INFO L93 Difference]: Finished difference Result 1732 states and 3158 transitions. [2022-02-20 19:53:49,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:53:49,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2022-02-20 19:53:49,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:49,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:53:49,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1819 transitions. [2022-02-20 19:53:49,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:53:49,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1819 transitions. [2022-02-20 19:53:49,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1819 transitions. [2022-02-20 19:53:51,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1819 edges. 1819 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:51,138 INFO L225 Difference]: With dead ends: 1732 [2022-02-20 19:53:51,138 INFO L226 Difference]: Without dead ends: 1650 [2022-02-20 19:53:51,139 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:53:51,140 INFO L933 BasicCegarLoop]: 1689 mSDtfsCounter, 3 mSDsluCounter, 5003 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6692 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:53:51,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6692 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:53:51,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2022-02-20 19:53:51,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1650. [2022-02-20 19:53:51,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:51,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1650 states. Second operand has 1650 states, 1648 states have (on average 1.8015776699029127) internal successors, (2969), 1649 states have internal predecessors, (2969), 0 states have call successors, (0), 0 states have 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:53:51,169 INFO L74 IsIncluded]: Start isIncluded. First operand 1650 states. Second operand has 1650 states, 1648 states have (on average 1.8015776699029127) internal successors, (2969), 1649 states have internal predecessors, (2969), 0 states have call successors, (0), 0 states have 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:53:51,171 INFO L87 Difference]: Start difference. First operand 1650 states. Second operand has 1650 states, 1648 states have (on average 1.8015776699029127) internal successors, (2969), 1649 states have internal predecessors, (2969), 0 states have call successors, (0), 0 states have 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:53:51,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:51,265 INFO L93 Difference]: Finished difference Result 1650 states and 2969 transitions. [2022-02-20 19:53:51,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2969 transitions. [2022-02-20 19:53:51,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:51,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:51,271 INFO L74 IsIncluded]: Start isIncluded. First operand has 1650 states, 1648 states have (on average 1.8015776699029127) internal successors, (2969), 1649 states have internal predecessors, (2969), 0 states have call successors, (0), 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 1650 states. [2022-02-20 19:53:51,273 INFO L87 Difference]: Start difference. First operand has 1650 states, 1648 states have (on average 1.8015776699029127) internal successors, (2969), 1649 states have internal predecessors, (2969), 0 states have call successors, (0), 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 1650 states. [2022-02-20 19:53:51,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:51,360 INFO L93 Difference]: Finished difference Result 1650 states and 2969 transitions. [2022-02-20 19:53:51,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2969 transitions. [2022-02-20 19:53:51,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:51,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:51,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:53:51,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:53:51,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1650 states, 1648 states have (on average 1.8015776699029127) internal successors, (2969), 1649 states have internal predecessors, (2969), 0 states have call successors, (0), 0 states have 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:53:51,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1650 states and 2969 transitions. [2022-02-20 19:53:51,456 INFO L78 Accepts]: Start accepts. Automaton has 1650 states and 2969 transitions. Word has length 46 [2022-02-20 19:53:51,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:53:51,456 INFO L470 AbstractCegarLoop]: Abstraction has 1650 states and 2969 transitions. [2022-02-20 19:53:51,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:53:51,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2969 transitions. [2022-02-20 19:53:51,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-02-20 19:53:51,459 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:51,460 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:51,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:53:51,463 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:51,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:51,463 INFO L85 PathProgramCache]: Analyzing trace with hash -39136641, now seen corresponding path program 1 times [2022-02-20 19:53:51,463 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:51,463 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387172241] [2022-02-20 19:53:51,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:51,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:51,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {15352#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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {15354#(<= ~a5~0 4)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {15354#(<= ~a5~0 4)} assume !(0 != main_#t~nondet62#1);havoc main_#t~nondet62#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet60#1, main2_#t~ret61#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,640 INFO L290 TraceCheckUtils]: 3: Hoare triple {15354#(<= ~a5~0 4)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet60#1 && main2_#t~nondet60#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet60#1;havoc main2_#t~nondet60#1; {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,640 INFO L290 TraceCheckUtils]: 4: Hoare triple {15354#(<= ~a5~0 4)} 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~ret57#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,641 INFO L290 TraceCheckUtils]: 5: Hoare triple {15354#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,641 INFO L290 TraceCheckUtils]: 6: Hoare triple {15354#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {15354#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {15354#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {15354#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,643 INFO L290 TraceCheckUtils]: 10: Hoare triple {15354#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,643 INFO L290 TraceCheckUtils]: 11: Hoare triple {15354#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {15354#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {15354#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {15354#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {15354#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,645 INFO L290 TraceCheckUtils]: 16: Hoare triple {15354#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,645 INFO L290 TraceCheckUtils]: 17: Hoare triple {15354#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,645 INFO L290 TraceCheckUtils]: 18: Hoare triple {15354#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,646 INFO L290 TraceCheckUtils]: 19: Hoare triple {15354#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,646 INFO L290 TraceCheckUtils]: 20: Hoare triple {15354#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,646 INFO L290 TraceCheckUtils]: 21: Hoare triple {15354#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,647 INFO L290 TraceCheckUtils]: 22: Hoare triple {15354#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,647 INFO L290 TraceCheckUtils]: 23: Hoare triple {15354#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,647 INFO L290 TraceCheckUtils]: 24: Hoare triple {15354#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,648 INFO L290 TraceCheckUtils]: 25: Hoare triple {15354#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,648 INFO L290 TraceCheckUtils]: 26: Hoare triple {15354#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,649 INFO L290 TraceCheckUtils]: 27: Hoare triple {15354#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,653 INFO L290 TraceCheckUtils]: 28: Hoare triple {15354#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,654 INFO L290 TraceCheckUtils]: 29: Hoare triple {15354#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,654 INFO L290 TraceCheckUtils]: 30: Hoare triple {15354#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,654 INFO L290 TraceCheckUtils]: 31: Hoare triple {15354#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,655 INFO L290 TraceCheckUtils]: 32: Hoare triple {15354#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,655 INFO L290 TraceCheckUtils]: 33: Hoare triple {15354#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,655 INFO L290 TraceCheckUtils]: 34: Hoare triple {15354#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,657 INFO L290 TraceCheckUtils]: 35: Hoare triple {15354#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,657 INFO L290 TraceCheckUtils]: 36: Hoare triple {15354#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,658 INFO L290 TraceCheckUtils]: 37: Hoare triple {15354#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,658 INFO L290 TraceCheckUtils]: 38: Hoare triple {15354#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,658 INFO L290 TraceCheckUtils]: 39: Hoare triple {15354#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,659 INFO L290 TraceCheckUtils]: 40: Hoare triple {15354#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,659 INFO L290 TraceCheckUtils]: 41: Hoare triple {15354#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,659 INFO L290 TraceCheckUtils]: 42: Hoare triple {15354#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,660 INFO L290 TraceCheckUtils]: 43: Hoare triple {15354#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,661 INFO L290 TraceCheckUtils]: 44: Hoare triple {15354#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,661 INFO L290 TraceCheckUtils]: 45: Hoare triple {15354#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,661 INFO L290 TraceCheckUtils]: 46: Hoare triple {15354#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,662 INFO L290 TraceCheckUtils]: 47: Hoare triple {15354#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,663 INFO L290 TraceCheckUtils]: 48: Hoare triple {15354#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,670 INFO L290 TraceCheckUtils]: 49: Hoare triple {15354#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,670 INFO L290 TraceCheckUtils]: 50: Hoare triple {15354#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,671 INFO L290 TraceCheckUtils]: 51: Hoare triple {15354#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,673 INFO L290 TraceCheckUtils]: 52: Hoare triple {15354#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,673 INFO L290 TraceCheckUtils]: 53: Hoare triple {15354#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,674 INFO L290 TraceCheckUtils]: 54: Hoare triple {15354#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,674 INFO L290 TraceCheckUtils]: 55: Hoare triple {15354#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,674 INFO L290 TraceCheckUtils]: 56: Hoare triple {15354#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,675 INFO L290 TraceCheckUtils]: 57: Hoare triple {15354#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,675 INFO L290 TraceCheckUtils]: 58: Hoare triple {15354#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,676 INFO L290 TraceCheckUtils]: 59: Hoare triple {15354#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,676 INFO L290 TraceCheckUtils]: 60: Hoare triple {15354#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,676 INFO L290 TraceCheckUtils]: 61: Hoare triple {15354#(<= ~a5~0 4)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,677 INFO L290 TraceCheckUtils]: 62: Hoare triple {15354#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,677 INFO L290 TraceCheckUtils]: 63: Hoare triple {15354#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,677 INFO L290 TraceCheckUtils]: 64: Hoare triple {15354#(<= ~a5~0 4)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,678 INFO L290 TraceCheckUtils]: 65: Hoare triple {15354#(<= ~a5~0 4)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,678 INFO L290 TraceCheckUtils]: 66: Hoare triple {15354#(<= ~a5~0 4)} assume !((((189 < ~a2~0 && 281 >= ~a2~0) && 4 == calculate_output_~input#1 && ((12 == ~a7~0 && 255 < ~a17~0) || (13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a7~0))) && 4 == ~a5~0) && 14 == ~a24~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,678 INFO L290 TraceCheckUtils]: 67: Hoare triple {15354#(<= ~a5~0 4)} assume !(((13 == ~a24~0 && (2 == calculate_output_~input#1 && (13 == ~a7~0 || 14 == ~a7~0)) && 3 == ~a5~0) && ~a17~0 <= -108) && 189 < ~a2~0 && 281 >= ~a2~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,679 INFO L290 TraceCheckUtils]: 68: Hoare triple {15354#(<= ~a5~0 4)} assume !((((((12 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a7~0) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a7~0)) && 1 == calculate_output_~input#1) && 14 == ~a24~0) && 189 < ~a2~0 && 281 >= ~a2~0) && 5 == ~a5~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,679 INFO L290 TraceCheckUtils]: 69: Hoare triple {15354#(<= ~a5~0 4)} assume !((((189 < ~a2~0 && 281 >= ~a2~0) && (((~a17~0 <= -108 && 13 == ~a7~0) || (~a17~0 <= -108 && 14 == ~a7~0)) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 12 == ~a7~0)) && 4 == calculate_output_~input#1) && 3 == ~a5~0) && 14 == ~a24~0); {15354#(<= ~a5~0 4)} is VALID [2022-02-20 19:53:51,680 INFO L290 TraceCheckUtils]: 70: Hoare triple {15354#(<= ~a5~0 4)} assume 6 == ~a5~0 && (13 == ~a24~0 && 6 == calculate_output_~input#1 && (((13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || (14 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0)) || (255 < ~a17~0 && 12 == ~a7~0))) && ~a2~0 <= 189;~a2~0 := 236 + (if (if 9 * ~a2~0 < 0 && 0 != 9 * ~a2~0 % 10 then 1 + 9 * ~a2~0 / 10 else 9 * ~a2~0 / 10) < 0 && 0 != (if 9 * ~a2~0 < 0 && 0 != 9 * ~a2~0 % 10 then 1 + 9 * ~a2~0 / 10 else 9 * ~a2~0 / 10) % 45 then (if 9 * ~a2~0 < 0 && 0 != 9 * ~a2~0 % 10 then 1 + 9 * ~a2~0 / 10 else 9 * ~a2~0 / 10) % 45 - 45 else (if 9 * ~a2~0 < 0 && 0 != 9 * ~a2~0 % 10 then 1 + 9 * ~a2~0 / 10 else 9 * ~a2~0 / 10) % 45);~a17~0 := 357533 + (if -100855 + ~a17~0 - 172157 < 0 && 0 != (-100855 + ~a17~0 - 172157) % 5 then 1 + (-100855 + ~a17~0 - 172157) / 5 else (-100855 + ~a17~0 - 172157) / 5);~a7~0 := 13;~a24~0 := 14;~a5~0 := 3;calculate_output_#res#1 := 23; {15353#false} is VALID [2022-02-20 19:53:51,680 INFO L290 TraceCheckUtils]: 71: Hoare triple {15353#false} main2_#t~ret61#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main2_#t~ret61#1 && main2_#t~ret61#1 <= 2147483647;main2_~output~0#1 := main2_#t~ret61#1;havoc main2_#t~ret61#1; {15353#false} is VALID [2022-02-20 19:53:51,680 INFO L290 TraceCheckUtils]: 72: Hoare triple {15353#false} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet60#1 && main2_#t~nondet60#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet60#1;havoc main2_#t~nondet60#1; {15353#false} is VALID [2022-02-20 19:53:51,680 INFO L290 TraceCheckUtils]: 73: Hoare triple {15353#false} 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~ret57#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {15353#false} is VALID [2022-02-20 19:53:51,680 INFO L290 TraceCheckUtils]: 74: Hoare triple {15353#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15353#false} is VALID [2022-02-20 19:53:51,681 INFO L290 TraceCheckUtils]: 75: Hoare triple {15353#false} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {15353#false} is VALID [2022-02-20 19:53:51,681 INFO L290 TraceCheckUtils]: 76: Hoare triple {15353#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15353#false} is VALID [2022-02-20 19:53:51,681 INFO L290 TraceCheckUtils]: 77: Hoare triple {15353#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15353#false} is VALID [2022-02-20 19:53:51,681 INFO L290 TraceCheckUtils]: 78: Hoare triple {15353#false} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {15353#false} is VALID [2022-02-20 19:53:51,681 INFO L290 TraceCheckUtils]: 79: Hoare triple {15353#false} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15353#false} is VALID [2022-02-20 19:53:51,681 INFO L290 TraceCheckUtils]: 80: Hoare triple {15353#false} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15353#false} is VALID [2022-02-20 19:53:51,681 INFO L290 TraceCheckUtils]: 81: Hoare triple {15353#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {15353#false} is VALID [2022-02-20 19:53:51,682 INFO L290 TraceCheckUtils]: 82: Hoare triple {15353#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15353#false} is VALID [2022-02-20 19:53:51,682 INFO L290 TraceCheckUtils]: 83: Hoare triple {15353#false} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {15353#false} is VALID [2022-02-20 19:53:51,682 INFO L290 TraceCheckUtils]: 84: Hoare triple {15353#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15353#false} is VALID [2022-02-20 19:53:51,682 INFO L290 TraceCheckUtils]: 85: Hoare triple {15353#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {15353#false} is VALID [2022-02-20 19:53:51,682 INFO L290 TraceCheckUtils]: 86: Hoare triple {15353#false} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {15353#false} is VALID [2022-02-20 19:53:51,682 INFO L290 TraceCheckUtils]: 87: Hoare triple {15353#false} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {15353#false} is VALID [2022-02-20 19:53:51,682 INFO L290 TraceCheckUtils]: 88: Hoare triple {15353#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {15353#false} is VALID [2022-02-20 19:53:51,683 INFO L290 TraceCheckUtils]: 89: Hoare triple {15353#false} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {15353#false} is VALID [2022-02-20 19:53:51,683 INFO L290 TraceCheckUtils]: 90: Hoare triple {15353#false} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {15353#false} is VALID [2022-02-20 19:53:51,683 INFO L290 TraceCheckUtils]: 91: Hoare triple {15353#false} assume (((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {15353#false} is VALID [2022-02-20 19:53:51,683 INFO L290 TraceCheckUtils]: 92: Hoare triple {15353#false} assume !false; {15353#false} is VALID [2022-02-20 19:53:51,684 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:53:51,684 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:51,684 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387172241] [2022-02-20 19:53:51,685 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387172241] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:51,685 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:51,685 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:53:51,685 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607871980] [2022-02-20 19:53:51,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:51,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2022-02-20 19:53:51,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:51,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:53:51,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:51,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:53:51,751 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:51,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:53:51,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:53:51,752 INFO L87 Difference]: Start difference. First operand 1650 states and 2969 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:53:56,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:56,271 INFO L93 Difference]: Finished difference Result 3905 states and 7084 transitions. [2022-02-20 19:53:56,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:53:56,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2022-02-20 19:53:56,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:56,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:53:56,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4406 transitions. [2022-02-20 19:53:56,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:53:56,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4406 transitions. [2022-02-20 19:53:56,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4406 transitions. [2022-02-20 19:53:59,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4406 edges. 4406 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:59,551 INFO L225 Difference]: With dead ends: 3905 [2022-02-20 19:53:59,551 INFO L226 Difference]: Without dead ends: 2401 [2022-02-20 19:53:59,554 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:53:59,559 INFO L933 BasicCegarLoop]: 633 mSDtfsCounter, 970 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 864 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 2859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:53:59,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [970 Valid, 639 Invalid, 2859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-02-20 19:53:59,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states. [2022-02-20 19:53:59,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 2401. [2022-02-20 19:53:59,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:59,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2401 states. Second operand has 2401 states, 2399 states have (on average 1.4355981659024593) internal successors, (3444), 2400 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have 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:53:59,721 INFO L74 IsIncluded]: Start isIncluded. First operand 2401 states. Second operand has 2401 states, 2399 states have (on average 1.4355981659024593) internal successors, (3444), 2400 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have 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:53:59,723 INFO L87 Difference]: Start difference. First operand 2401 states. Second operand has 2401 states, 2399 states have (on average 1.4355981659024593) internal successors, (3444), 2400 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have 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:54:00,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:00,019 INFO L93 Difference]: Finished difference Result 2401 states and 3444 transitions. [2022-02-20 19:54:00,019 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 3444 transitions. [2022-02-20 19:54:00,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:00,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:00,033 INFO L74 IsIncluded]: Start isIncluded. First operand has 2401 states, 2399 states have (on average 1.4355981659024593) internal successors, (3444), 2400 states have internal predecessors, (3444), 0 states have call successors, (0), 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 2401 states. [2022-02-20 19:54:00,035 INFO L87 Difference]: Start difference. First operand has 2401 states, 2399 states have (on average 1.4355981659024593) internal successors, (3444), 2400 states have internal predecessors, (3444), 0 states have call successors, (0), 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 2401 states. [2022-02-20 19:54:00,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:00,355 INFO L93 Difference]: Finished difference Result 2401 states and 3444 transitions. [2022-02-20 19:54:00,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 3444 transitions. [2022-02-20 19:54:00,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:00,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:00,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:00,358 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:00,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2401 states, 2399 states have (on average 1.4355981659024593) internal successors, (3444), 2400 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have 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:54:00,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2401 states and 3444 transitions. [2022-02-20 19:54:00,680 INFO L78 Accepts]: Start accepts. Automaton has 2401 states and 3444 transitions. Word has length 93 [2022-02-20 19:54:00,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:00,681 INFO L470 AbstractCegarLoop]: Abstraction has 2401 states and 3444 transitions. [2022-02-20 19:54:00,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:54:00,682 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 3444 transitions. [2022-02-20 19:54:00,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-02-20 19:54:00,696 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:00,696 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:00,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:54:00,697 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:00,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:00,697 INFO L85 PathProgramCache]: Analyzing trace with hash 39614916, now seen corresponding path program 1 times [2022-02-20 19:54:00,697 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:00,697 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918018801] [2022-02-20 19:54:00,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:00,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:00,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {26529#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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:00,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:00,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !(0 != main_#t~nondet62#1);havoc main_#t~nondet62#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet60#1, main2_#t~ret61#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:00,981 INFO L290 TraceCheckUtils]: 3: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet60#1 && main2_#t~nondet60#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet60#1;havoc main2_#t~nondet60#1; {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:00,981 INFO L290 TraceCheckUtils]: 4: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !(((((1 != main2_~input~0#1 && 2 != main2_~input~0#1) && 3 != main2_~input~0#1) && 4 != main2_~input~0#1) && 5 != main2_~input~0#1) && 6 != main2_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main2_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret57#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:00,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:00,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:00,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:00,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:00,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:00,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:00,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:00,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:00,986 INFO L290 TraceCheckUtils]: 13: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:00,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:00,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:00,993 INFO L290 TraceCheckUtils]: 16: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:00,993 INFO L290 TraceCheckUtils]: 17: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:00,994 INFO L290 TraceCheckUtils]: 18: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:00,994 INFO L290 TraceCheckUtils]: 19: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:00,995 INFO L290 TraceCheckUtils]: 20: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:00,995 INFO L290 TraceCheckUtils]: 21: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:00,996 INFO L290 TraceCheckUtils]: 22: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:00,997 INFO L290 TraceCheckUtils]: 23: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:00,997 INFO L290 TraceCheckUtils]: 24: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:00,998 INFO L290 TraceCheckUtils]: 25: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:00,998 INFO L290 TraceCheckUtils]: 26: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:00,998 INFO L290 TraceCheckUtils]: 27: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:00,999 INFO L290 TraceCheckUtils]: 28: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:00,999 INFO L290 TraceCheckUtils]: 29: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,000 INFO L290 TraceCheckUtils]: 30: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,000 INFO L290 TraceCheckUtils]: 31: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,001 INFO L290 TraceCheckUtils]: 32: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,001 INFO L290 TraceCheckUtils]: 33: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,001 INFO L290 TraceCheckUtils]: 34: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,002 INFO L290 TraceCheckUtils]: 35: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,002 INFO L290 TraceCheckUtils]: 36: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,010 INFO L290 TraceCheckUtils]: 37: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,011 INFO L290 TraceCheckUtils]: 38: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,011 INFO L290 TraceCheckUtils]: 39: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,015 INFO L290 TraceCheckUtils]: 40: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,015 INFO L290 TraceCheckUtils]: 41: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,016 INFO L290 TraceCheckUtils]: 42: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,016 INFO L290 TraceCheckUtils]: 43: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,017 INFO L290 TraceCheckUtils]: 44: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,017 INFO L290 TraceCheckUtils]: 45: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,018 INFO L290 TraceCheckUtils]: 46: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,018 INFO L290 TraceCheckUtils]: 47: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,019 INFO L290 TraceCheckUtils]: 48: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,019 INFO L290 TraceCheckUtils]: 49: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,020 INFO L290 TraceCheckUtils]: 50: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,020 INFO L290 TraceCheckUtils]: 51: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,021 INFO L290 TraceCheckUtils]: 52: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,022 INFO L290 TraceCheckUtils]: 53: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,022 INFO L290 TraceCheckUtils]: 54: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,023 INFO L290 TraceCheckUtils]: 55: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,023 INFO L290 TraceCheckUtils]: 56: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,024 INFO L290 TraceCheckUtils]: 57: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,024 INFO L290 TraceCheckUtils]: 58: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,025 INFO L290 TraceCheckUtils]: 59: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,025 INFO L290 TraceCheckUtils]: 60: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,032 INFO L290 TraceCheckUtils]: 61: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,032 INFO L290 TraceCheckUtils]: 62: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,033 INFO L290 TraceCheckUtils]: 63: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,033 INFO L290 TraceCheckUtils]: 64: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,034 INFO L290 TraceCheckUtils]: 65: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,034 INFO L290 TraceCheckUtils]: 66: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((189 < ~a2~0 && 281 >= ~a2~0) && 4 == calculate_output_~input#1 && ((12 == ~a7~0 && 255 < ~a17~0) || (13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a7~0))) && 4 == ~a5~0) && 14 == ~a24~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,035 INFO L290 TraceCheckUtils]: 67: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !(((13 == ~a24~0 && (2 == calculate_output_~input#1 && (13 == ~a7~0 || 14 == ~a7~0)) && 3 == ~a5~0) && ~a17~0 <= -108) && 189 < ~a2~0 && 281 >= ~a2~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,035 INFO L290 TraceCheckUtils]: 68: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((((12 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a7~0) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a7~0)) && 1 == calculate_output_~input#1) && 14 == ~a24~0) && 189 < ~a2~0 && 281 >= ~a2~0) && 5 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,036 INFO L290 TraceCheckUtils]: 69: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((((189 < ~a2~0 && 281 >= ~a2~0) && (((~a17~0 <= -108 && 13 == ~a7~0) || (~a17~0 <= -108 && 14 == ~a7~0)) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 12 == ~a7~0)) && 4 == calculate_output_~input#1) && 3 == ~a5~0) && 14 == ~a24~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,036 INFO L290 TraceCheckUtils]: 70: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !(6 == ~a5~0 && (13 == ~a24~0 && 6 == calculate_output_~input#1 && (((13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || (14 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0)) || (255 < ~a17~0 && 12 == ~a7~0))) && ~a2~0 <= 189); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,037 INFO L290 TraceCheckUtils]: 71: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume !((13 == ~a24~0 && (189 < ~a2~0 && 281 >= ~a2~0) && (((13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a7~0)) || (255 < ~a17~0 && 12 == ~a7~0)) && 3 == calculate_output_~input#1) && 6 == ~a5~0); {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:01,037 INFO L290 TraceCheckUtils]: 72: Hoare triple {26531#(and (<= ~a2~0 170) (<= (+ ~a17~0 124) 0))} assume 4 == ~a5~0 && ~a2~0 <= 189 && ((1 == calculate_output_~input#1 && (13 == ~a7~0 || 14 == ~a7~0)) && ~a17~0 <= -108) && 15 == ~a24~0;~a7~0 := 12;~a24~0 := 13;~a5~0 := 3;calculate_output_#res#1 := -1; {26532#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} is VALID [2022-02-20 19:54:01,038 INFO L290 TraceCheckUtils]: 73: Hoare triple {26532#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} main2_#t~ret61#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main2_#t~ret61#1 && main2_#t~ret61#1 <= 2147483647;main2_~output~0#1 := main2_#t~ret61#1;havoc main2_#t~ret61#1; {26532#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} is VALID [2022-02-20 19:54:01,038 INFO L290 TraceCheckUtils]: 74: Hoare triple {26532#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet60#1 && main2_#t~nondet60#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet60#1;havoc main2_#t~nondet60#1; {26532#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} is VALID [2022-02-20 19:54:01,039 INFO L290 TraceCheckUtils]: 75: Hoare triple {26532#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~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~ret57#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {26532#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} is VALID [2022-02-20 19:54:01,039 INFO L290 TraceCheckUtils]: 76: Hoare triple {26532#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {26532#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} is VALID [2022-02-20 19:54:01,040 INFO L290 TraceCheckUtils]: 77: Hoare triple {26532#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {26532#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} is VALID [2022-02-20 19:54:01,040 INFO L290 TraceCheckUtils]: 78: Hoare triple {26532#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {26532#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} is VALID [2022-02-20 19:54:01,041 INFO L290 TraceCheckUtils]: 79: Hoare triple {26532#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {26532#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} is VALID [2022-02-20 19:54:01,041 INFO L290 TraceCheckUtils]: 80: Hoare triple {26532#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {26532#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} is VALID [2022-02-20 19:54:01,042 INFO L290 TraceCheckUtils]: 81: Hoare triple {26532#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {26532#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} is VALID [2022-02-20 19:54:01,042 INFO L290 TraceCheckUtils]: 82: Hoare triple {26532#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {26532#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} is VALID [2022-02-20 19:54:01,046 INFO L290 TraceCheckUtils]: 83: Hoare triple {26532#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {26532#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} is VALID [2022-02-20 19:54:01,047 INFO L290 TraceCheckUtils]: 84: Hoare triple {26532#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {26532#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} is VALID [2022-02-20 19:54:01,049 INFO L290 TraceCheckUtils]: 85: Hoare triple {26532#(and (<= ~a2~0 170) (= 0 (+ (- 13) ~a24~0)) (<= (+ ~a17~0 124) 0) (= 3 ~a5~0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {26533#(not (= ~a7~0 13))} is VALID [2022-02-20 19:54:01,049 INFO L290 TraceCheckUtils]: 86: Hoare triple {26533#(not (= ~a7~0 13))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {26533#(not (= ~a7~0 13))} is VALID [2022-02-20 19:54:01,051 INFO L290 TraceCheckUtils]: 87: Hoare triple {26533#(not (= ~a7~0 13))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {26533#(not (= ~a7~0 13))} is VALID [2022-02-20 19:54:01,051 INFO L290 TraceCheckUtils]: 88: Hoare triple {26533#(not (= ~a7~0 13))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {26533#(not (= ~a7~0 13))} is VALID [2022-02-20 19:54:01,051 INFO L290 TraceCheckUtils]: 89: Hoare triple {26533#(not (= ~a7~0 13))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {26533#(not (= ~a7~0 13))} is VALID [2022-02-20 19:54:01,051 INFO L290 TraceCheckUtils]: 90: Hoare triple {26533#(not (= ~a7~0 13))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {26533#(not (= ~a7~0 13))} is VALID [2022-02-20 19:54:01,052 INFO L290 TraceCheckUtils]: 91: Hoare triple {26533#(not (= ~a7~0 13))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {26533#(not (= ~a7~0 13))} is VALID [2022-02-20 19:54:01,055 INFO L290 TraceCheckUtils]: 92: Hoare triple {26533#(not (= ~a7~0 13))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {26533#(not (= ~a7~0 13))} is VALID [2022-02-20 19:54:01,056 INFO L290 TraceCheckUtils]: 93: Hoare triple {26533#(not (= ~a7~0 13))} assume (((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {26530#false} is VALID [2022-02-20 19:54:01,056 INFO L290 TraceCheckUtils]: 94: Hoare triple {26530#false} assume !false; {26530#false} is VALID [2022-02-20 19:54:01,057 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:54:01,057 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:01,058 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918018801] [2022-02-20 19:54:01,058 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918018801] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 19:54:01,058 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593925142] [2022-02-20 19:54:01,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:01,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:54:01,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:54:01,060 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 19:54:01,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 19:54:01,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:01,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 19:54:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:01,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:54:01,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {26529#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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {26529#true} is VALID [2022-02-20 19:54:01,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {26529#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {26529#true} is VALID [2022-02-20 19:54:01,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {26529#true} assume !(0 != main_#t~nondet62#1);havoc main_#t~nondet62#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet60#1, main2_#t~ret61#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {26529#true} is VALID [2022-02-20 19:54:01,477 INFO L290 TraceCheckUtils]: 3: Hoare triple {26529#true} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet60#1 && main2_#t~nondet60#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet60#1;havoc main2_#t~nondet60#1; {26529#true} is VALID [2022-02-20 19:54:01,478 INFO L290 TraceCheckUtils]: 4: Hoare triple {26529#true} 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~ret57#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {26529#true} is VALID [2022-02-20 19:54:01,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {26529#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,478 INFO L290 TraceCheckUtils]: 6: Hoare triple {26529#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,478 INFO L290 TraceCheckUtils]: 7: Hoare triple {26529#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {26529#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {26529#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,478 INFO L290 TraceCheckUtils]: 10: Hoare triple {26529#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,479 INFO L290 TraceCheckUtils]: 11: Hoare triple {26529#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,479 INFO L290 TraceCheckUtils]: 12: Hoare triple {26529#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,479 INFO L290 TraceCheckUtils]: 13: Hoare triple {26529#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {26529#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,479 INFO L290 TraceCheckUtils]: 15: Hoare triple {26529#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,479 INFO L290 TraceCheckUtils]: 16: Hoare triple {26529#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,479 INFO L290 TraceCheckUtils]: 17: Hoare triple {26529#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,479 INFO L290 TraceCheckUtils]: 18: Hoare triple {26529#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,480 INFO L290 TraceCheckUtils]: 19: Hoare triple {26529#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,480 INFO L290 TraceCheckUtils]: 20: Hoare triple {26529#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,480 INFO L290 TraceCheckUtils]: 21: Hoare triple {26529#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,480 INFO L290 TraceCheckUtils]: 22: Hoare triple {26529#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,480 INFO L290 TraceCheckUtils]: 23: Hoare triple {26529#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,480 INFO L290 TraceCheckUtils]: 24: Hoare triple {26529#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,480 INFO L290 TraceCheckUtils]: 25: Hoare triple {26529#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,480 INFO L290 TraceCheckUtils]: 26: Hoare triple {26529#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,481 INFO L290 TraceCheckUtils]: 27: Hoare triple {26529#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,481 INFO L290 TraceCheckUtils]: 28: Hoare triple {26529#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,481 INFO L290 TraceCheckUtils]: 29: Hoare triple {26529#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,481 INFO L290 TraceCheckUtils]: 30: Hoare triple {26529#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,481 INFO L290 TraceCheckUtils]: 31: Hoare triple {26529#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,481 INFO L290 TraceCheckUtils]: 32: Hoare triple {26529#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,481 INFO L290 TraceCheckUtils]: 33: Hoare triple {26529#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,481 INFO L290 TraceCheckUtils]: 34: Hoare triple {26529#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,482 INFO L290 TraceCheckUtils]: 35: Hoare triple {26529#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,482 INFO L290 TraceCheckUtils]: 36: Hoare triple {26529#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,482 INFO L290 TraceCheckUtils]: 37: Hoare triple {26529#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,482 INFO L290 TraceCheckUtils]: 38: Hoare triple {26529#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,482 INFO L290 TraceCheckUtils]: 39: Hoare triple {26529#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,482 INFO L290 TraceCheckUtils]: 40: Hoare triple {26529#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,482 INFO L290 TraceCheckUtils]: 41: Hoare triple {26529#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,482 INFO L290 TraceCheckUtils]: 42: Hoare triple {26529#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,483 INFO L290 TraceCheckUtils]: 43: Hoare triple {26529#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,483 INFO L290 TraceCheckUtils]: 44: Hoare triple {26529#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,483 INFO L290 TraceCheckUtils]: 45: Hoare triple {26529#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,483 INFO L290 TraceCheckUtils]: 46: Hoare triple {26529#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,483 INFO L290 TraceCheckUtils]: 47: Hoare triple {26529#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,483 INFO L290 TraceCheckUtils]: 48: Hoare triple {26529#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,484 INFO L290 TraceCheckUtils]: 49: Hoare triple {26529#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,485 INFO L290 TraceCheckUtils]: 50: Hoare triple {26529#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,485 INFO L290 TraceCheckUtils]: 51: Hoare triple {26529#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,485 INFO L290 TraceCheckUtils]: 52: Hoare triple {26529#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,485 INFO L290 TraceCheckUtils]: 53: Hoare triple {26529#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,485 INFO L290 TraceCheckUtils]: 54: Hoare triple {26529#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,485 INFO L290 TraceCheckUtils]: 55: Hoare triple {26529#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,485 INFO L290 TraceCheckUtils]: 56: Hoare triple {26529#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,485 INFO L290 TraceCheckUtils]: 57: Hoare triple {26529#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,486 INFO L290 TraceCheckUtils]: 58: Hoare triple {26529#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,486 INFO L290 TraceCheckUtils]: 59: Hoare triple {26529#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,486 INFO L290 TraceCheckUtils]: 60: Hoare triple {26529#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,486 INFO L290 TraceCheckUtils]: 61: Hoare triple {26529#true} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,486 INFO L290 TraceCheckUtils]: 62: Hoare triple {26529#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,486 INFO L290 TraceCheckUtils]: 63: Hoare triple {26529#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,486 INFO L290 TraceCheckUtils]: 64: Hoare triple {26529#true} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,486 INFO L290 TraceCheckUtils]: 65: Hoare triple {26529#true} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,487 INFO L290 TraceCheckUtils]: 66: Hoare triple {26529#true} assume !((((189 < ~a2~0 && 281 >= ~a2~0) && 4 == calculate_output_~input#1 && ((12 == ~a7~0 && 255 < ~a17~0) || (13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a7~0))) && 4 == ~a5~0) && 14 == ~a24~0); {26529#true} is VALID [2022-02-20 19:54:01,487 INFO L290 TraceCheckUtils]: 67: Hoare triple {26529#true} assume !(((13 == ~a24~0 && (2 == calculate_output_~input#1 && (13 == ~a7~0 || 14 == ~a7~0)) && 3 == ~a5~0) && ~a17~0 <= -108) && 189 < ~a2~0 && 281 >= ~a2~0); {26529#true} is VALID [2022-02-20 19:54:01,487 INFO L290 TraceCheckUtils]: 68: Hoare triple {26529#true} assume !((((((12 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a7~0) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a7~0)) && 1 == calculate_output_~input#1) && 14 == ~a24~0) && 189 < ~a2~0 && 281 >= ~a2~0) && 5 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,487 INFO L290 TraceCheckUtils]: 69: Hoare triple {26529#true} assume !((((189 < ~a2~0 && 281 >= ~a2~0) && (((~a17~0 <= -108 && 13 == ~a7~0) || (~a17~0 <= -108 && 14 == ~a7~0)) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 12 == ~a7~0)) && 4 == calculate_output_~input#1) && 3 == ~a5~0) && 14 == ~a24~0); {26529#true} is VALID [2022-02-20 19:54:01,487 INFO L290 TraceCheckUtils]: 70: Hoare triple {26529#true} assume !(6 == ~a5~0 && (13 == ~a24~0 && 6 == calculate_output_~input#1 && (((13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || (14 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0)) || (255 < ~a17~0 && 12 == ~a7~0))) && ~a2~0 <= 189); {26529#true} is VALID [2022-02-20 19:54:01,487 INFO L290 TraceCheckUtils]: 71: Hoare triple {26529#true} assume !((13 == ~a24~0 && (189 < ~a2~0 && 281 >= ~a2~0) && (((13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a7~0)) || (255 < ~a17~0 && 12 == ~a7~0)) && 3 == calculate_output_~input#1) && 6 == ~a5~0); {26529#true} is VALID [2022-02-20 19:54:01,488 INFO L290 TraceCheckUtils]: 72: Hoare triple {26529#true} assume 4 == ~a5~0 && ~a2~0 <= 189 && ((1 == calculate_output_~input#1 && (13 == ~a7~0 || 14 == ~a7~0)) && ~a17~0 <= -108) && 15 == ~a24~0;~a7~0 := 12;~a24~0 := 13;~a5~0 := 3;calculate_output_#res#1 := -1; {26753#(<= (+ ~a17~0 108) 0)} is VALID [2022-02-20 19:54:01,488 INFO L290 TraceCheckUtils]: 73: Hoare triple {26753#(<= (+ ~a17~0 108) 0)} main2_#t~ret61#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main2_#t~ret61#1 && main2_#t~ret61#1 <= 2147483647;main2_~output~0#1 := main2_#t~ret61#1;havoc main2_#t~ret61#1; {26753#(<= (+ ~a17~0 108) 0)} is VALID [2022-02-20 19:54:01,488 INFO L290 TraceCheckUtils]: 74: Hoare triple {26753#(<= (+ ~a17~0 108) 0)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet60#1 && main2_#t~nondet60#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet60#1;havoc main2_#t~nondet60#1; {26753#(<= (+ ~a17~0 108) 0)} is VALID [2022-02-20 19:54:01,489 INFO L290 TraceCheckUtils]: 75: Hoare triple {26753#(<= (+ ~a17~0 108) 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~ret57#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {26753#(<= (+ ~a17~0 108) 0)} is VALID [2022-02-20 19:54:01,489 INFO L290 TraceCheckUtils]: 76: Hoare triple {26753#(<= (+ ~a17~0 108) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {26753#(<= (+ ~a17~0 108) 0)} is VALID [2022-02-20 19:54:01,489 INFO L290 TraceCheckUtils]: 77: Hoare triple {26753#(<= (+ ~a17~0 108) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {26753#(<= (+ ~a17~0 108) 0)} is VALID [2022-02-20 19:54:01,489 INFO L290 TraceCheckUtils]: 78: Hoare triple {26753#(<= (+ ~a17~0 108) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {26753#(<= (+ ~a17~0 108) 0)} is VALID [2022-02-20 19:54:01,490 INFO L290 TraceCheckUtils]: 79: Hoare triple {26753#(<= (+ ~a17~0 108) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {26753#(<= (+ ~a17~0 108) 0)} is VALID [2022-02-20 19:54:01,490 INFO L290 TraceCheckUtils]: 80: Hoare triple {26753#(<= (+ ~a17~0 108) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {26753#(<= (+ ~a17~0 108) 0)} is VALID [2022-02-20 19:54:01,490 INFO L290 TraceCheckUtils]: 81: Hoare triple {26753#(<= (+ ~a17~0 108) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {26753#(<= (+ ~a17~0 108) 0)} is VALID [2022-02-20 19:54:01,491 INFO L290 TraceCheckUtils]: 82: Hoare triple {26753#(<= (+ ~a17~0 108) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {26753#(<= (+ ~a17~0 108) 0)} is VALID [2022-02-20 19:54:01,493 INFO L290 TraceCheckUtils]: 83: Hoare triple {26753#(<= (+ ~a17~0 108) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {26753#(<= (+ ~a17~0 108) 0)} is VALID [2022-02-20 19:54:01,493 INFO L290 TraceCheckUtils]: 84: Hoare triple {26753#(<= (+ ~a17~0 108) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {26753#(<= (+ ~a17~0 108) 0)} is VALID [2022-02-20 19:54:01,494 INFO L290 TraceCheckUtils]: 85: Hoare triple {26753#(<= (+ ~a17~0 108) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {26753#(<= (+ ~a17~0 108) 0)} is VALID [2022-02-20 19:54:01,494 INFO L290 TraceCheckUtils]: 86: Hoare triple {26753#(<= (+ ~a17~0 108) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {26753#(<= (+ ~a17~0 108) 0)} is VALID [2022-02-20 19:54:01,494 INFO L290 TraceCheckUtils]: 87: Hoare triple {26753#(<= (+ ~a17~0 108) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {26753#(<= (+ ~a17~0 108) 0)} is VALID [2022-02-20 19:54:01,495 INFO L290 TraceCheckUtils]: 88: Hoare triple {26753#(<= (+ ~a17~0 108) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {26753#(<= (+ ~a17~0 108) 0)} is VALID [2022-02-20 19:54:01,495 INFO L290 TraceCheckUtils]: 89: Hoare triple {26753#(<= (+ ~a17~0 108) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {26753#(<= (+ ~a17~0 108) 0)} is VALID [2022-02-20 19:54:01,495 INFO L290 TraceCheckUtils]: 90: Hoare triple {26753#(<= (+ ~a17~0 108) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {26753#(<= (+ ~a17~0 108) 0)} is VALID [2022-02-20 19:54:01,495 INFO L290 TraceCheckUtils]: 91: Hoare triple {26753#(<= (+ ~a17~0 108) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {26753#(<= (+ ~a17~0 108) 0)} is VALID [2022-02-20 19:54:01,496 INFO L290 TraceCheckUtils]: 92: Hoare triple {26753#(<= (+ ~a17~0 108) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {26753#(<= (+ ~a17~0 108) 0)} is VALID [2022-02-20 19:54:01,496 INFO L290 TraceCheckUtils]: 93: Hoare triple {26753#(<= (+ ~a17~0 108) 0)} assume (((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {26530#false} is VALID [2022-02-20 19:54:01,496 INFO L290 TraceCheckUtils]: 94: Hoare triple {26530#false} assume !false; {26530#false} is VALID [2022-02-20 19:54:01,497 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:54:01,498 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:54:01,499 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593925142] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:01,499 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 19:54:01,499 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-02-20 19:54:01,499 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775273523] [2022-02-20 19:54:01,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:01,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2022-02-20 19:54:01,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:01,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have 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:54:01,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:01,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:54:01,572 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:01,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:54:01,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:54:01,575 INFO L87 Difference]: Start difference. First operand 2401 states and 3444 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have 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:54:08,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:08,095 INFO L93 Difference]: Finished difference Result 6909 states and 9945 transitions. [2022-02-20 19:54:08,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:54:08,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2022-02-20 19:54:08,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:08,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have 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:54:08,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4503 transitions. [2022-02-20 19:54:08,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have 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:54:08,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4503 transitions. [2022-02-20 19:54:08,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4503 transitions. [2022-02-20 19:54:11,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4503 edges. 4503 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:12,116 INFO L225 Difference]: With dead ends: 6909 [2022-02-20 19:54:12,116 INFO L226 Difference]: Without dead ends: 4654 [2022-02-20 19:54:12,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:54:12,148 INFO L933 BasicCegarLoop]: 802 mSDtfsCounter, 938 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2273 mSolverCounterSat, 684 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 2957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 684 IncrementalHoareTripleChecker+Valid, 2273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:12,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [938 Valid, 809 Invalid, 2957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [684 Valid, 2273 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-02-20 19:54:12,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4654 states. [2022-02-20 19:54:12,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4654 to 4654. [2022-02-20 19:54:12,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:12,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4654 states. Second operand has 4654 states, 4652 states have (on average 1.2942820292347377) internal successors, (6021), 4653 states have internal predecessors, (6021), 0 states have call successors, (0), 0 states have 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:54:12,254 INFO L74 IsIncluded]: Start isIncluded. First operand 4654 states. Second operand has 4654 states, 4652 states have (on average 1.2942820292347377) internal successors, (6021), 4653 states have internal predecessors, (6021), 0 states have call successors, (0), 0 states have 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:54:12,259 INFO L87 Difference]: Start difference. First operand 4654 states. Second operand has 4654 states, 4652 states have (on average 1.2942820292347377) internal successors, (6021), 4653 states have internal predecessors, (6021), 0 states have call successors, (0), 0 states have 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:54:12,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:12,913 INFO L93 Difference]: Finished difference Result 4654 states and 6021 transitions. [2022-02-20 19:54:12,913 INFO L276 IsEmpty]: Start isEmpty. Operand 4654 states and 6021 transitions. [2022-02-20 19:54:12,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:12,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:12,924 INFO L74 IsIncluded]: Start isIncluded. First operand has 4654 states, 4652 states have (on average 1.2942820292347377) internal successors, (6021), 4653 states have internal predecessors, (6021), 0 states have call successors, (0), 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 4654 states. [2022-02-20 19:54:12,929 INFO L87 Difference]: Start difference. First operand has 4654 states, 4652 states have (on average 1.2942820292347377) internal successors, (6021), 4653 states have internal predecessors, (6021), 0 states have call successors, (0), 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 4654 states. [2022-02-20 19:54:13,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:13,471 INFO L93 Difference]: Finished difference Result 4654 states and 6021 transitions. [2022-02-20 19:54:13,471 INFO L276 IsEmpty]: Start isEmpty. Operand 4654 states and 6021 transitions. [2022-02-20 19:54:13,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:13,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:13,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:13,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:13,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4654 states, 4652 states have (on average 1.2942820292347377) internal successors, (6021), 4653 states have internal predecessors, (6021), 0 states have call successors, (0), 0 states have 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:54:14,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4654 states to 4654 states and 6021 transitions. [2022-02-20 19:54:14,103 INFO L78 Accepts]: Start accepts. Automaton has 4654 states and 6021 transitions. Word has length 95 [2022-02-20 19:54:14,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:14,104 INFO L470 AbstractCegarLoop]: Abstraction has 4654 states and 6021 transitions. [2022-02-20 19:54:14,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have 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:54:14,104 INFO L276 IsEmpty]: Start isEmpty. Operand 4654 states and 6021 transitions. [2022-02-20 19:54:14,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-02-20 19:54:14,105 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:14,105 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:14,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 19:54:14,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:54:14,319 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:14,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:14,320 INFO L85 PathProgramCache]: Analyzing trace with hash -514955373, now seen corresponding path program 1 times [2022-02-20 19:54:14,320 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:14,320 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439918724] [2022-02-20 19:54:14,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:14,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:14,478 INFO L290 TraceCheckUtils]: 0: Hoare triple {47789#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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !(0 != main_#t~nondet62#1);havoc main_#t~nondet62#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet60#1, main2_#t~ret61#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,480 INFO L290 TraceCheckUtils]: 3: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet60#1 && main2_#t~nondet60#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet60#1;havoc main2_#t~nondet60#1; {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,480 INFO L290 TraceCheckUtils]: 4: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !(((((1 != main2_~input~0#1 && 2 != main2_~input~0#1) && 3 != main2_~input~0#1) && 4 != main2_~input~0#1) && 5 != main2_~input~0#1) && 6 != main2_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main2_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret57#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,481 INFO L290 TraceCheckUtils]: 6: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,483 INFO L290 TraceCheckUtils]: 10: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,483 INFO L290 TraceCheckUtils]: 11: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,484 INFO L290 TraceCheckUtils]: 13: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,486 INFO L290 TraceCheckUtils]: 16: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,486 INFO L290 TraceCheckUtils]: 17: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,487 INFO L290 TraceCheckUtils]: 18: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,487 INFO L290 TraceCheckUtils]: 19: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,490 INFO L290 TraceCheckUtils]: 20: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,491 INFO L290 TraceCheckUtils]: 21: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,491 INFO L290 TraceCheckUtils]: 22: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,494 INFO L290 TraceCheckUtils]: 24: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,494 INFO L290 TraceCheckUtils]: 25: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,495 INFO L290 TraceCheckUtils]: 26: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,495 INFO L290 TraceCheckUtils]: 27: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,496 INFO L290 TraceCheckUtils]: 28: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,496 INFO L290 TraceCheckUtils]: 29: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,497 INFO L290 TraceCheckUtils]: 30: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,497 INFO L290 TraceCheckUtils]: 31: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,498 INFO L290 TraceCheckUtils]: 32: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,498 INFO L290 TraceCheckUtils]: 33: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,498 INFO L290 TraceCheckUtils]: 34: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,499 INFO L290 TraceCheckUtils]: 35: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,499 INFO L290 TraceCheckUtils]: 36: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,500 INFO L290 TraceCheckUtils]: 37: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,500 INFO L290 TraceCheckUtils]: 38: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,501 INFO L290 TraceCheckUtils]: 39: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,501 INFO L290 TraceCheckUtils]: 40: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,502 INFO L290 TraceCheckUtils]: 41: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,502 INFO L290 TraceCheckUtils]: 42: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,503 INFO L290 TraceCheckUtils]: 43: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,503 INFO L290 TraceCheckUtils]: 44: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,503 INFO L290 TraceCheckUtils]: 45: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,504 INFO L290 TraceCheckUtils]: 46: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,504 INFO L290 TraceCheckUtils]: 47: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,505 INFO L290 TraceCheckUtils]: 48: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,505 INFO L290 TraceCheckUtils]: 49: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,506 INFO L290 TraceCheckUtils]: 50: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,506 INFO L290 TraceCheckUtils]: 51: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,507 INFO L290 TraceCheckUtils]: 52: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,507 INFO L290 TraceCheckUtils]: 53: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,508 INFO L290 TraceCheckUtils]: 54: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,508 INFO L290 TraceCheckUtils]: 55: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:54:14,508 INFO L290 TraceCheckUtils]: 56: Hoare triple {47791#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ ~a5~0 (- 4)) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {47792#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:54:14,509 INFO L290 TraceCheckUtils]: 57: Hoare triple {47792#(not (= 0 (+ (- 13) ~a24~0)))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {47792#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:54:14,509 INFO L290 TraceCheckUtils]: 58: Hoare triple {47792#(not (= 0 (+ (- 13) ~a24~0)))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {47792#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:54:14,510 INFO L290 TraceCheckUtils]: 59: Hoare triple {47792#(not (= 0 (+ (- 13) ~a24~0)))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {47792#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:54:14,510 INFO L290 TraceCheckUtils]: 60: Hoare triple {47792#(not (= 0 (+ (- 13) ~a24~0)))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {47792#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:54:14,510 INFO L290 TraceCheckUtils]: 61: Hoare triple {47792#(not (= 0 (+ (- 13) ~a24~0)))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {47792#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:54:14,511 INFO L290 TraceCheckUtils]: 62: Hoare triple {47792#(not (= 0 (+ (- 13) ~a24~0)))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {47792#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:54:14,511 INFO L290 TraceCheckUtils]: 63: Hoare triple {47792#(not (= 0 (+ (- 13) ~a24~0)))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {47792#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:54:14,512 INFO L290 TraceCheckUtils]: 64: Hoare triple {47792#(not (= 0 (+ (- 13) ~a24~0)))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {47792#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:54:14,512 INFO L290 TraceCheckUtils]: 65: Hoare triple {47792#(not (= 0 (+ (- 13) ~a24~0)))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {47792#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:54:14,512 INFO L290 TraceCheckUtils]: 66: Hoare triple {47792#(not (= 0 (+ (- 13) ~a24~0)))} assume !((((189 < ~a2~0 && 281 >= ~a2~0) && 4 == calculate_output_~input#1 && ((12 == ~a7~0 && 255 < ~a17~0) || (13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a7~0))) && 4 == ~a5~0) && 14 == ~a24~0); {47792#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:54:14,513 INFO L290 TraceCheckUtils]: 67: Hoare triple {47792#(not (= 0 (+ (- 13) ~a24~0)))} assume !(((13 == ~a24~0 && (2 == calculate_output_~input#1 && (13 == ~a7~0 || 14 == ~a7~0)) && 3 == ~a5~0) && ~a17~0 <= -108) && 189 < ~a2~0 && 281 >= ~a2~0); {47792#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:54:14,513 INFO L290 TraceCheckUtils]: 68: Hoare triple {47792#(not (= 0 (+ (- 13) ~a24~0)))} assume !((((((12 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a7~0) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a7~0)) && 1 == calculate_output_~input#1) && 14 == ~a24~0) && 189 < ~a2~0 && 281 >= ~a2~0) && 5 == ~a5~0); {47792#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:54:14,514 INFO L290 TraceCheckUtils]: 69: Hoare triple {47792#(not (= 0 (+ (- 13) ~a24~0)))} assume !((((189 < ~a2~0 && 281 >= ~a2~0) && (((~a17~0 <= -108 && 13 == ~a7~0) || (~a17~0 <= -108 && 14 == ~a7~0)) || ((-108 < ~a17~0 && 111 >= ~a17~0) && 12 == ~a7~0)) && 4 == calculate_output_~input#1) && 3 == ~a5~0) && 14 == ~a24~0); {47792#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:54:14,514 INFO L290 TraceCheckUtils]: 70: Hoare triple {47792#(not (= 0 (+ (- 13) ~a24~0)))} assume !(6 == ~a5~0 && (13 == ~a24~0 && 6 == calculate_output_~input#1 && (((13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || (14 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0)) || (255 < ~a17~0 && 12 == ~a7~0))) && ~a2~0 <= 189); {47792#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:54:14,515 INFO L290 TraceCheckUtils]: 71: Hoare triple {47792#(not (= 0 (+ (- 13) ~a24~0)))} assume !((13 == ~a24~0 && (189 < ~a2~0 && 281 >= ~a2~0) && (((13 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0) || ((111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a7~0)) || (255 < ~a17~0 && 12 == ~a7~0)) && 3 == calculate_output_~input#1) && 6 == ~a5~0); {47792#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:54:14,515 INFO L290 TraceCheckUtils]: 72: Hoare triple {47792#(not (= 0 (+ (- 13) ~a24~0)))} assume !(4 == ~a5~0 && ~a2~0 <= 189 && ((1 == calculate_output_~input#1 && (13 == ~a7~0 || 14 == ~a7~0)) && ~a17~0 <= -108) && 15 == ~a24~0); {47792#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:54:14,516 INFO L290 TraceCheckUtils]: 73: Hoare triple {47792#(not (= 0 (+ (- 13) ~a24~0)))} assume !(15 == ~a24~0 && (((189 < ~a2~0 && 281 >= ~a2~0) && 1 == calculate_output_~input#1 && 4 == ~a5~0) && 13 == ~a7~0) && 255 < ~a17~0); {47792#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:54:14,516 INFO L290 TraceCheckUtils]: 74: Hoare triple {47792#(not (= 0 (+ (- 13) ~a24~0)))} assume !(4 == ~a5~0 && (189 < ~a2~0 && 281 >= ~a2~0) && 14 == ~a24~0 && (((-108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a7~0) || (12 == ~a7~0 && 111 < ~a17~0 && 255 >= ~a17~0)) && 4 == calculate_output_~input#1); {47792#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:54:14,516 INFO L290 TraceCheckUtils]: 75: Hoare triple {47792#(not (= 0 (+ (- 13) ~a24~0)))} assume !(((5 == ~a5~0 && ~a2~0 <= 189 && 1 == calculate_output_~input#1 && 15 == ~a24~0) && 255 < ~a17~0) && 14 == ~a7~0); {47792#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:54:14,517 INFO L290 TraceCheckUtils]: 76: Hoare triple {47792#(not (= 0 (+ (- 13) ~a24~0)))} assume !((~a17~0 <= -108 && (189 < ~a2~0 && 281 >= ~a2~0) && ((14 == ~a7~0 || 12 == ~a7~0 || 13 == ~a7~0) && 1 == calculate_output_~input#1) && 15 == ~a24~0) && 5 == ~a5~0); {47792#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:54:14,517 INFO L290 TraceCheckUtils]: 77: Hoare triple {47792#(not (= 0 (+ (- 13) ~a24~0)))} assume !((~a17~0 <= -108 && ((189 < ~a2~0 && 281 >= ~a2~0) && (12 == ~a7~0 || 13 == ~a7~0) && 5 == calculate_output_~input#1) && 13 == ~a24~0) && 6 == ~a5~0); {47792#(not (= 0 (+ (- 13) ~a24~0)))} is VALID [2022-02-20 19:54:14,518 INFO L290 TraceCheckUtils]: 78: Hoare triple {47792#(not (= 0 (+ (- 13) ~a24~0)))} assume (13 == ~a24~0 && ~a17~0 <= -108 && (4 == ~a5~0 && 2 == calculate_output_~input#1) && 189 < ~a2~0 && 281 >= ~a2~0) && 12 == ~a7~0;~a17~0 := (if (if (if 9 * (~a17~0 - 0) < 0 && 0 != 9 * (~a17~0 - 0) % 10 then 1 + 9 * (~a17~0 - 0) / 10 else 9 * (~a17~0 - 0) / 10) < 0 && 0 != (if 9 * (~a17~0 - 0) < 0 && 0 != 9 * (~a17~0 - 0) % 10 then 1 + 9 * (~a17~0 - 0) / 10 else 9 * (~a17~0 - 0) / 10) % 5 then 1 + (if 9 * (~a17~0 - 0) < 0 && 0 != 9 * (~a17~0 - 0) % 10 then 1 + 9 * (~a17~0 - 0) / 10 else 9 * (~a17~0 - 0) / 10) / 5 else (if 9 * (~a17~0 - 0) < 0 && 0 != 9 * (~a17~0 - 0) % 10 then 1 + 9 * (~a17~0 - 0) / 10 else 9 * (~a17~0 - 0) / 10) / 5) < 0 && 0 != (if (if 9 * (~a17~0 - 0) < 0 && 0 != 9 * (~a17~0 - 0) % 10 then 1 + 9 * (~a17~0 - 0) / 10 else 9 * (~a17~0 - 0) / 10) < 0 && 0 != (if 9 * (~a17~0 - 0) < 0 && 0 != 9 * (~a17~0 - 0) % 10 then 1 + 9 * (~a17~0 - 0) / 10 else 9 * (~a17~0 - 0) / 10) % 5 then 1 + (if 9 * (~a17~0 - 0) < 0 && 0 != 9 * (~a17~0 - 0) % 10 then 1 + 9 * (~a17~0 - 0) / 10 else 9 * (~a17~0 - 0) / 10) / 5 else (if 9 * (~a17~0 - 0) < 0 && 0 != 9 * (~a17~0 - 0) % 10 then 1 + 9 * (~a17~0 - 0) / 10 else 9 * (~a17~0 - 0) / 10) / 5) % 109 then (if (if 9 * (~a17~0 - 0) < 0 && 0 != 9 * (~a17~0 - 0) % 10 then 1 + 9 * (~a17~0 - 0) / 10 else 9 * (~a17~0 - 0) / 10) < 0 && 0 != (if 9 * (~a17~0 - 0) < 0 && 0 != 9 * (~a17~0 - 0) % 10 then 1 + 9 * (~a17~0 - 0) / 10 else 9 * (~a17~0 - 0) / 10) % 5 then 1 + (if 9 * (~a17~0 - 0) < 0 && 0 != 9 * (~a17~0 - 0) % 10 then 1 + 9 * (~a17~0 - 0) / 10 else 9 * (~a17~0 - 0) / 10) / 5 else (if 9 * (~a17~0 - 0) < 0 && 0 != 9 * (~a17~0 - 0) % 10 then 1 + 9 * (~a17~0 - 0) / 10 else 9 * (~a17~0 - 0) / 10) / 5) % 109 - 109 else (if (if 9 * (~a17~0 - 0) < 0 && 0 != 9 * (~a17~0 - 0) % 10 then 1 + 9 * (~a17~0 - 0) / 10 else 9 * (~a17~0 - 0) / 10) < 0 && 0 != (if 9 * (~a17~0 - 0) < 0 && 0 != 9 * (~a17~0 - 0) % 10 then 1 + 9 * (~a17~0 - 0) / 10 else 9 * (~a17~0 - 0) / 10) % 5 then 1 + (if 9 * (~a17~0 - 0) < 0 && 0 != 9 * (~a17~0 - 0) % 10 then 1 + 9 * (~a17~0 - 0) / 10 else 9 * (~a17~0 - 0) / 10) / 5 else (if 9 * (~a17~0 - 0) < 0 && 0 != 9 * (~a17~0 - 0) % 10 then 1 + 9 * (~a17~0 - 0) / 10 else 9 * (~a17~0 - 0) / 10) / 5) % 109) - -93;~a7~0 := 14;~a24~0 := 15;~a5~0 := 3;calculate_output_#res#1 := -1; {47790#false} is VALID [2022-02-20 19:54:14,518 INFO L290 TraceCheckUtils]: 79: Hoare triple {47790#false} main2_#t~ret61#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main2_#t~ret61#1 && main2_#t~ret61#1 <= 2147483647;main2_~output~0#1 := main2_#t~ret61#1;havoc main2_#t~ret61#1; {47790#false} is VALID [2022-02-20 19:54:14,519 INFO L290 TraceCheckUtils]: 80: Hoare triple {47790#false} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet60#1 && main2_#t~nondet60#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet60#1;havoc main2_#t~nondet60#1; {47790#false} is VALID [2022-02-20 19:54:14,519 INFO L290 TraceCheckUtils]: 81: Hoare triple {47790#false} 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~ret57#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {47790#false} is VALID [2022-02-20 19:54:14,519 INFO L290 TraceCheckUtils]: 82: Hoare triple {47790#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {47790#false} is VALID [2022-02-20 19:54:14,519 INFO L290 TraceCheckUtils]: 83: Hoare triple {47790#false} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {47790#false} is VALID [2022-02-20 19:54:14,519 INFO L290 TraceCheckUtils]: 84: Hoare triple {47790#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {47790#false} is VALID [2022-02-20 19:54:14,519 INFO L290 TraceCheckUtils]: 85: Hoare triple {47790#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {47790#false} is VALID [2022-02-20 19:54:14,519 INFO L290 TraceCheckUtils]: 86: Hoare triple {47790#false} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {47790#false} is VALID [2022-02-20 19:54:14,519 INFO L290 TraceCheckUtils]: 87: Hoare triple {47790#false} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {47790#false} is VALID [2022-02-20 19:54:14,520 INFO L290 TraceCheckUtils]: 88: Hoare triple {47790#false} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {47790#false} is VALID [2022-02-20 19:54:14,520 INFO L290 TraceCheckUtils]: 89: Hoare triple {47790#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {47790#false} is VALID [2022-02-20 19:54:14,520 INFO L290 TraceCheckUtils]: 90: Hoare triple {47790#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {47790#false} is VALID [2022-02-20 19:54:14,520 INFO L290 TraceCheckUtils]: 91: Hoare triple {47790#false} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {47790#false} is VALID [2022-02-20 19:54:14,520 INFO L290 TraceCheckUtils]: 92: Hoare triple {47790#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {47790#false} is VALID [2022-02-20 19:54:14,520 INFO L290 TraceCheckUtils]: 93: Hoare triple {47790#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {47790#false} is VALID [2022-02-20 19:54:14,520 INFO L290 TraceCheckUtils]: 94: Hoare triple {47790#false} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {47790#false} is VALID [2022-02-20 19:54:14,520 INFO L290 TraceCheckUtils]: 95: Hoare triple {47790#false} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {47790#false} is VALID [2022-02-20 19:54:14,520 INFO L290 TraceCheckUtils]: 96: Hoare triple {47790#false} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {47790#false} is VALID [2022-02-20 19:54:14,521 INFO L290 TraceCheckUtils]: 97: Hoare triple {47790#false} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {47790#false} is VALID [2022-02-20 19:54:14,521 INFO L290 TraceCheckUtils]: 98: Hoare triple {47790#false} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {47790#false} is VALID [2022-02-20 19:54:14,521 INFO L290 TraceCheckUtils]: 99: Hoare triple {47790#false} assume (((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {47790#false} is VALID [2022-02-20 19:54:14,521 INFO L290 TraceCheckUtils]: 100: Hoare triple {47790#false} assume !false; {47790#false} is VALID [2022-02-20 19:54:14,522 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:54:14,522 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:14,522 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439918724] [2022-02-20 19:54:14,522 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439918724] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:14,522 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:14,522 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:54:14,522 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726046635] [2022-02-20 19:54:14,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:14,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2022-02-20 19:54:14,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:14,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have 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:54:14,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:14,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:54:14,604 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:14,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:54:14,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:54:14,604 INFO L87 Difference]: Start difference. First operand 4654 states and 6021 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have 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:54:29,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:29,335 INFO L93 Difference]: Finished difference Result 14419 states and 18475 transitions. [2022-02-20 19:54:29,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 19:54:29,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2022-02-20 19:54:29,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:29,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have 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:54:29,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5302 transitions. [2022-02-20 19:54:29,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have 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:54:29,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5302 transitions. [2022-02-20 19:54:29,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 5302 transitions. [2022-02-20 19:54:33,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5302 edges. 5302 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.