./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9879b06f-79f5-4e09-8794-7022e7c71744/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9879b06f-79f5-4e09-8794-7022e7c71744/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9879b06f-79f5-4e09-8794-7022e7c71744/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9879b06f-79f5-4e09-8794-7022e7c71744/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label13.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9879b06f-79f5-4e09-8794-7022e7c71744/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9879b06f-79f5-4e09-8794-7022e7c71744/bin/uautomizer-DrprNOufMa --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 dfeefe603ac8e9509c0defeafd3f556115c7ef9469dee8e36ba96447893f8761 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 18:37:22,518 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 18:37:22,519 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 18:37:22,548 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 18:37:22,549 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 18:37:22,550 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 18:37:22,552 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 18:37:22,554 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 18:37:22,556 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 18:37:22,556 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 18:37:22,557 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 18:37:22,558 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 18:37:22,559 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 18:37:22,560 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 18:37:22,561 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 18:37:22,562 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 18:37:22,562 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 18:37:22,563 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 18:37:22,565 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 18:37:22,567 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 18:37:22,568 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 18:37:22,569 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 18:37:22,570 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 18:37:22,571 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 18:37:22,573 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 18:37:22,574 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 18:37:22,574 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 18:37:22,575 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 18:37:22,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 18:37:22,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 18:37:22,576 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 18:37:22,577 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 18:37:22,578 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 18:37:22,578 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 18:37:22,579 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 18:37:22,579 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 18:37:22,580 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 18:37:22,580 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 18:37:22,580 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 18:37:22,580 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 18:37:22,581 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 18:37:22,582 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9879b06f-79f5-4e09-8794-7022e7c71744/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 18:37:22,599 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 18:37:22,599 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 18:37:22,599 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 18:37:22,599 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 18:37:22,600 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 18:37:22,600 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 18:37:22,600 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 18:37:22,601 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 18:37:22,601 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 18:37:22,601 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 18:37:22,601 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 18:37:22,601 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 18:37:22,601 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 18:37:22,601 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 18:37:22,601 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 18:37:22,601 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 18:37:22,601 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 18:37:22,602 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 18:37:22,602 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 18:37:22,602 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 18:37:22,602 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 18:37:22,602 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 18:37:22,602 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 18:37:22,602 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 18:37:22,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 18:37:22,603 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 18:37:22,603 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 18:37:22,603 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 18:37:22,603 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 18:37:22,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 18:37:22,603 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 18:37:22,603 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 18:37:22,603 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 18:37:22,603 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 18:37:22,603 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9879b06f-79f5-4e09-8794-7022e7c71744/bin/uautomizer-DrprNOufMa/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9879b06f-79f5-4e09-8794-7022e7c71744/bin/uautomizer-DrprNOufMa 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 -> dfeefe603ac8e9509c0defeafd3f556115c7ef9469dee8e36ba96447893f8761 [2021-12-06 18:37:22,775 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 18:37:22,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 18:37:22,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 18:37:22,792 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 18:37:22,793 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 18:37:22,794 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9879b06f-79f5-4e09-8794-7022e7c71744/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/eca-rers2012/Problem02_label13.c [2021-12-06 18:37:22,850 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9879b06f-79f5-4e09-8794-7022e7c71744/bin/uautomizer-DrprNOufMa/data/072c893c2/2151ee16ca3648d29e607d2188265bb6/FLAG2faa08c8b [2021-12-06 18:37:23,259 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 18:37:23,260 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9879b06f-79f5-4e09-8794-7022e7c71744/sv-benchmarks/c/eca-rers2012/Problem02_label13.c [2021-12-06 18:37:23,268 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9879b06f-79f5-4e09-8794-7022e7c71744/bin/uautomizer-DrprNOufMa/data/072c893c2/2151ee16ca3648d29e607d2188265bb6/FLAG2faa08c8b [2021-12-06 18:37:23,278 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9879b06f-79f5-4e09-8794-7022e7c71744/bin/uautomizer-DrprNOufMa/data/072c893c2/2151ee16ca3648d29e607d2188265bb6 [2021-12-06 18:37:23,280 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 18:37:23,281 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 18:37:23,282 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 18:37:23,282 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 18:37:23,285 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 18:37:23,285 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:37:23" (1/1) ... [2021-12-06 18:37:23,286 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e7e8588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:23, skipping insertion in model container [2021-12-06 18:37:23,286 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:37:23" (1/1) ... [2021-12-06 18:37:23,291 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 18:37:23,321 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 18:37:23,524 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9879b06f-79f5-4e09-8794-7022e7c71744/sv-benchmarks/c/eca-rers2012/Problem02_label13.c[15197,15210] [2021-12-06 18:37:23,553 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 18:37:23,561 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 18:37:23,618 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9879b06f-79f5-4e09-8794-7022e7c71744/sv-benchmarks/c/eca-rers2012/Problem02_label13.c[15197,15210] [2021-12-06 18:37:23,635 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 18:37:23,649 INFO L208 MainTranslator]: Completed translation [2021-12-06 18:37:23,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:23 WrapperNode [2021-12-06 18:37:23,650 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 18:37:23,651 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 18:37:23,651 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 18:37:23,651 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 18:37:23,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:23" (1/1) ... [2021-12-06 18:37:23,675 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:23" (1/1) ... [2021-12-06 18:37:23,719 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2021-12-06 18:37:23,719 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 18:37:23,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 18:37:23,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 18:37:23,721 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 18:37:23,728 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:23" (1/1) ... [2021-12-06 18:37:23,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:23" (1/1) ... [2021-12-06 18:37:23,734 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:23" (1/1) ... [2021-12-06 18:37:23,734 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:23" (1/1) ... [2021-12-06 18:37:23,757 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:23" (1/1) ... [2021-12-06 18:37:23,768 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:23" (1/1) ... [2021-12-06 18:37:23,773 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:23" (1/1) ... [2021-12-06 18:37:23,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 18:37:23,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 18:37:23,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 18:37:23,779 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 18:37:23,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:23" (1/1) ... [2021-12-06 18:37:23,786 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 18:37:23,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9879b06f-79f5-4e09-8794-7022e7c71744/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:37:23,807 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9879b06f-79f5-4e09-8794-7022e7c71744/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 18:37:23,809 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9879b06f-79f5-4e09-8794-7022e7c71744/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 18:37:23,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 18:37:23,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 18:37:23,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 18:37:23,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 18:37:23,893 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 18:37:23,894 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 18:37:24,473 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 18:37:24,482 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 18:37:24,482 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-06 18:37:24,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:37:24 BoogieIcfgContainer [2021-12-06 18:37:24,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 18:37:24,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 18:37:24,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 18:37:24,489 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 18:37:24,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:37:23" (1/3) ... [2021-12-06 18:37:24,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78838e61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:37:24, skipping insertion in model container [2021-12-06 18:37:24,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:37:23" (2/3) ... [2021-12-06 18:37:24,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78838e61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:37:24, skipping insertion in model container [2021-12-06 18:37:24,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:37:24" (3/3) ... [2021-12-06 18:37:24,491 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem02_label13.c [2021-12-06 18:37:24,496 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 18:37:24,496 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-06 18:37:24,536 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 18:37:24,541 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 [2021-12-06 18:37:24,542 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-06 18:37:24,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:37:24,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-12-06 18:37:24,569 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:37:24,570 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:37:24,571 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:37:24,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:37:24,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1496065885, now seen corresponding path program 1 times [2021-12-06 18:37:24,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:37:24,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384403311] [2021-12-06 18:37:24,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:37:24,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:37:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:37:24,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:37:24,877 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:37:24,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384403311] [2021-12-06 18:37:24,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384403311] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:37:24,879 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:37:24,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 18:37:24,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360664240] [2021-12-06 18:37:24,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:37:24,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 18:37:24,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:37:24,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 18:37:24,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 18:37:24,919 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 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 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:37:25,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:37:25,388 INFO L93 Difference]: Finished difference Result 639 states and 1082 transitions. [2021-12-06 18:37:25,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 18:37:25,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2021-12-06 18:37:25,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:37:25,404 INFO L225 Difference]: With dead ends: 639 [2021-12-06 18:37:25,405 INFO L226 Difference]: Without dead ends: 318 [2021-12-06 18:37:25,409 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 [2021-12-06 18:37:25,413 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 123 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 18:37:25,414 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 136 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 18:37:25,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2021-12-06 18:37:25,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 313. [2021-12-06 18:37:25,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 312 states have (on average 1.4711538461538463) internal successors, (459), 312 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:37:25,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 459 transitions. [2021-12-06 18:37:25,461 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 459 transitions. Word has length 86 [2021-12-06 18:37:25,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:37:25,462 INFO L470 AbstractCegarLoop]: Abstraction has 313 states and 459 transitions. [2021-12-06 18:37:25,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:37:25,462 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 459 transitions. [2021-12-06 18:37:25,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-12-06 18:37:25,465 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:37:25,466 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:37:25,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 18:37:25,466 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:37:25,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:37:25,467 INFO L85 PathProgramCache]: Analyzing trace with hash 259847304, now seen corresponding path program 1 times [2021-12-06 18:37:25,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:37:25,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260832619] [2021-12-06 18:37:25,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:37:25,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:37:25,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:37:25,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:37:25,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:37:25,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260832619] [2021-12-06 18:37:25,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260832619] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:37:25,521 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:37:25,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 18:37:25,521 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228513767] [2021-12-06 18:37:25,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:37:25,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 18:37:25,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:37:25,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 18:37:25,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 18:37:25,523 INFO L87 Difference]: Start difference. First operand 313 states and 459 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:37:25,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:37:25,819 INFO L93 Difference]: Finished difference Result 910 states and 1341 transitions. [2021-12-06 18:37:25,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 18:37:25,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2021-12-06 18:37:25,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:37:25,823 INFO L225 Difference]: With dead ends: 910 [2021-12-06 18:37:25,824 INFO L226 Difference]: Without dead ends: 599 [2021-12-06 18:37:25,825 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 [2021-12-06 18:37:25,826 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 143 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 18:37:25,827 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 115 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 18:37:25,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2021-12-06 18:37:25,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 596. [2021-12-06 18:37:25,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 595 states have (on average 1.2974789915966387) internal successors, (772), 595 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:37:25,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 772 transitions. [2021-12-06 18:37:25,851 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 772 transitions. Word has length 90 [2021-12-06 18:37:25,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:37:25,851 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 772 transitions. [2021-12-06 18:37:25,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:37:25,851 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 772 transitions. [2021-12-06 18:37:25,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-12-06 18:37:25,854 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:37:25,854 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:37:25,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 18:37:25,855 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:37:25,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:37:25,855 INFO L85 PathProgramCache]: Analyzing trace with hash -972479533, now seen corresponding path program 1 times [2021-12-06 18:37:25,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:37:25,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749918256] [2021-12-06 18:37:25,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:37:25,856 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:37:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:37:25,901 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:37:25,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:37:25,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749918256] [2021-12-06 18:37:25,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749918256] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:37:25,902 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:37:25,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 18:37:25,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180558527] [2021-12-06 18:37:25,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:37:25,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 18:37:25,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:37:25,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 18:37:25,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 18:37:25,903 INFO L87 Difference]: Start difference. First operand 596 states and 772 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) [2021-12-06 18:37:26,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:37:26,174 INFO L93 Difference]: Finished difference Result 1477 states and 1967 transitions. [2021-12-06 18:37:26,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 18:37:26,175 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 [2021-12-06 18:37:26,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:37:26,178 INFO L225 Difference]: With dead ends: 1477 [2021-12-06 18:37:26,179 INFO L226 Difference]: Without dead ends: 883 [2021-12-06 18:37:26,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 18:37:26,181 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 144 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 18:37:26,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 255 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 18:37:26,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2021-12-06 18:37:26,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 880. [2021-12-06 18:37:26,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 879 states have (on average 1.235494880546075) internal successors, (1086), 879 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:37:26,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1086 transitions. [2021-12-06 18:37:26,203 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1086 transitions. Word has length 95 [2021-12-06 18:37:26,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:37:26,203 INFO L470 AbstractCegarLoop]: Abstraction has 880 states and 1086 transitions. [2021-12-06 18:37:26,203 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) [2021-12-06 18:37:26,204 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1086 transitions. [2021-12-06 18:37:26,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-12-06 18:37:26,206 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:37:26,206 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:37:26,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 18:37:26,206 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:37:26,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:37:26,207 INFO L85 PathProgramCache]: Analyzing trace with hash 583319838, now seen corresponding path program 1 times [2021-12-06 18:37:26,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:37:26,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238998975] [2021-12-06 18:37:26,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:37:26,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:37:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:37:26,270 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:37:26,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:37:26,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238998975] [2021-12-06 18:37:26,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238998975] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 18:37:26,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820629761] [2021-12-06 18:37:26,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:37:26,271 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:37:26,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9879b06f-79f5-4e09-8794-7022e7c71744/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 18:37:26,272 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9879b06f-79f5-4e09-8794-7022e7c71744/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 18:37:26,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9879b06f-79f5-4e09-8794-7022e7c71744/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 18:37:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:37:26,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 18:37:26,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 18:37:26,487 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-06 18:37:26,487 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 18:37:26,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820629761] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:37:26,487 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 18:37:26,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2021-12-06 18:37:26,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357270033] [2021-12-06 18:37:26,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:37:26,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 18:37:26,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:37:26,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 18:37:26,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:37:26,489 INFO L87 Difference]: Start difference. First operand 880 states and 1086 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:37:26,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:37:26,764 INFO L93 Difference]: Finished difference Result 2457 states and 3050 transitions. [2021-12-06 18:37:26,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 18:37:26,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 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 [2021-12-06 18:37:26,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:37:26,772 INFO L225 Difference]: With dead ends: 2457 [2021-12-06 18:37:26,772 INFO L226 Difference]: Without dead ends: 1579 [2021-12-06 18:37:26,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 18:37:26,775 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 132 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 18:37:26,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 44 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 18:37:26,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2021-12-06 18:37:26,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1019. [2021-12-06 18:37:26,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1018 states have (on average 1.276031434184676) internal successors, (1299), 1018 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:37:26,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1299 transitions. [2021-12-06 18:37:26,802 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1299 transitions. Word has length 95 [2021-12-06 18:37:26,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:37:26,802 INFO L470 AbstractCegarLoop]: Abstraction has 1019 states and 1299 transitions. [2021-12-06 18:37:26,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:37:26,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1299 transitions. [2021-12-06 18:37:26,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-12-06 18:37:26,804 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:37:26,804 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:37:26,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9879b06f-79f5-4e09-8794-7022e7c71744/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 18:37:27,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9879b06f-79f5-4e09-8794-7022e7c71744/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 18:37:27,006 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:37:27,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:37:27,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1162713703, now seen corresponding path program 1 times [2021-12-06 18:37:27,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:37:27,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904961541] [2021-12-06 18:37:27,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:37:27,009 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:37:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:37:27,141 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:37:27,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:37:27,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904961541] [2021-12-06 18:37:27,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904961541] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:37:27,142 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:37:27,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 18:37:27,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598523672] [2021-12-06 18:37:27,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:37:27,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 18:37:27,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:37:27,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 18:37:27,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 18:37:27,146 INFO L87 Difference]: Start difference. First operand 1019 states and 1299 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:37:27,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:37:27,441 INFO L93 Difference]: Finished difference Result 2752 states and 3559 transitions. [2021-12-06 18:37:27,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 18:37:27,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2021-12-06 18:37:27,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:37:27,449 INFO L225 Difference]: With dead ends: 2752 [2021-12-06 18:37:27,449 INFO L226 Difference]: Without dead ends: 1735 [2021-12-06 18:37:27,451 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 [2021-12-06 18:37:27,452 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 191 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 18:37:27,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 71 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 18:37:27,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2021-12-06 18:37:27,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1594. [2021-12-06 18:37:27,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1594 states, 1593 states have (on average 1.2598870056497176) internal successors, (2007), 1593 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:37:27,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 2007 transitions. [2021-12-06 18:37:27,500 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 2007 transitions. Word has length 97 [2021-12-06 18:37:27,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:37:27,500 INFO L470 AbstractCegarLoop]: Abstraction has 1594 states and 2007 transitions. [2021-12-06 18:37:27,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:37:27,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 2007 transitions. [2021-12-06 18:37:27,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-12-06 18:37:27,504 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:37:27,505 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1] [2021-12-06 18:37:27,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 18:37:27,505 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:37:27,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:37:27,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1256318581, now seen corresponding path program 1 times [2021-12-06 18:37:27,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:37:27,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389471519] [2021-12-06 18:37:27,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:37:27,506 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:37:27,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:37:27,558 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 18:37:27,559 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:37:27,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389471519] [2021-12-06 18:37:27,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389471519] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:37:27,559 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:37:27,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 18:37:27,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127034941] [2021-12-06 18:37:27,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:37:27,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 18:37:27,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:37:27,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 18:37:27,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 18:37:27,561 INFO L87 Difference]: Start difference. First operand 1594 states and 2007 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:37:27,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:37:27,851 INFO L93 Difference]: Finished difference Result 2905 states and 3704 transitions. [2021-12-06 18:37:27,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 18:37:27,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2021-12-06 18:37:27,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:37:27,857 INFO L225 Difference]: With dead ends: 2905 [2021-12-06 18:37:27,857 INFO L226 Difference]: Without dead ends: 1313 [2021-12-06 18:37:27,859 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 18:37:27,860 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 143 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 18:37:27,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 277 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 18:37:27,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2021-12-06 18:37:27,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1305. [2021-12-06 18:37:27,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1305 states, 1304 states have (on average 1.2331288343558282) internal successors, (1608), 1304 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:37:27,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 1608 transitions. [2021-12-06 18:37:27,885 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 1608 transitions. Word has length 121 [2021-12-06 18:37:27,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:37:27,885 INFO L470 AbstractCegarLoop]: Abstraction has 1305 states and 1608 transitions. [2021-12-06 18:37:27,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:37:27,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1608 transitions. [2021-12-06 18:37:27,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-12-06 18:37:27,887 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:37:27,888 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2021-12-06 18:37:27,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-06 18:37:27,888 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:37:27,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:37:27,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1853943674, now seen corresponding path program 1 times [2021-12-06 18:37:27,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:37:27,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797895351] [2021-12-06 18:37:27,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:37:27,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:37:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:37:27,920 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-06 18:37:27,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:37:27,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797895351] [2021-12-06 18:37:27,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797895351] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:37:27,920 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:37:27,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 18:37:27,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479025042] [2021-12-06 18:37:27,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:37:27,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 18:37:27,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:37:27,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 18:37:27,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 18:37:27,922 INFO L87 Difference]: Start difference. First operand 1305 states and 1608 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:37:28,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:37:28,202 INFO L93 Difference]: Finished difference Result 3587 states and 4428 transitions. [2021-12-06 18:37:28,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 18:37:28,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 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 122 [2021-12-06 18:37:28,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:37:28,211 INFO L225 Difference]: With dead ends: 3587 [2021-12-06 18:37:28,211 INFO L226 Difference]: Without dead ends: 2284 [2021-12-06 18:37:28,213 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 [2021-12-06 18:37:28,213 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 180 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 18:37:28,214 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 86 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 18:37:28,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2284 states. [2021-12-06 18:37:28,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2284 to 2284. [2021-12-06 18:37:28,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2284 states, 2283 states have (on average 1.1918528252299605) internal successors, (2721), 2283 states have internal predecessors, (2721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:37:28,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 2721 transitions. [2021-12-06 18:37:28,248 INFO L78 Accepts]: Start accepts. Automaton has 2284 states and 2721 transitions. Word has length 122 [2021-12-06 18:37:28,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:37:28,249 INFO L470 AbstractCegarLoop]: Abstraction has 2284 states and 2721 transitions. [2021-12-06 18:37:28,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:37:28,249 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 2721 transitions. [2021-12-06 18:37:28,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-12-06 18:37:28,252 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:37:28,253 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2021-12-06 18:37:28,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 18:37:28,253 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:37:28,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:37:28,253 INFO L85 PathProgramCache]: Analyzing trace with hash -170759385, now seen corresponding path program 1 times [2021-12-06 18:37:28,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:37:28,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389498269] [2021-12-06 18:37:28,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:37:28,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:37:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:37:28,285 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-06 18:37:28,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:37:28,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389498269] [2021-12-06 18:37:28,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389498269] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:37:28,286 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:37:28,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 18:37:28,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150706898] [2021-12-06 18:37:28,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:37:28,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 18:37:28,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:37:28,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 18:37:28,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 18:37:28,288 INFO L87 Difference]: Start difference. First operand 2284 states and 2721 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:37:28,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:37:28,572 INFO L93 Difference]: Finished difference Result 5128 states and 6072 transitions. [2021-12-06 18:37:28,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 18:37:28,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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 141 [2021-12-06 18:37:28,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:37:28,586 INFO L225 Difference]: With dead ends: 5128 [2021-12-06 18:37:28,587 INFO L226 Difference]: Without dead ends: 2846 [2021-12-06 18:37:28,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 18:37:28,591 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 157 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 18:37:28,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 60 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 18:37:28,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2846 states. [2021-12-06 18:37:28,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2846 to 2844. [2021-12-06 18:37:28,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2844 states, 2843 states have (on average 1.1575800211044671) internal successors, (3291), 2843 states have internal predecessors, (3291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:37:28,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2844 states to 2844 states and 3291 transitions. [2021-12-06 18:37:28,641 INFO L78 Accepts]: Start accepts. Automaton has 2844 states and 3291 transitions. Word has length 141 [2021-12-06 18:37:28,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:37:28,641 INFO L470 AbstractCegarLoop]: Abstraction has 2844 states and 3291 transitions. [2021-12-06 18:37:28,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:37:28,641 INFO L276 IsEmpty]: Start isEmpty. Operand 2844 states and 3291 transitions. [2021-12-06 18:37:28,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-12-06 18:37:28,646 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:37:28,646 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-06 18:37:28,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 18:37:28,646 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:37:28,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:37:28,647 INFO L85 PathProgramCache]: Analyzing trace with hash 976898501, now seen corresponding path program 1 times [2021-12-06 18:37:28,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:37:28,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211764444] [2021-12-06 18:37:28,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:37:28,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:37:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:37:28,685 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-12-06 18:37:28,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:37:28,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211764444] [2021-12-06 18:37:28,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211764444] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:37:28,686 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:37:28,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 18:37:28,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871582405] [2021-12-06 18:37:28,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:37:28,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 18:37:28,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:37:28,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 18:37:28,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 18:37:28,687 INFO L87 Difference]: Start difference. First operand 2844 states and 3291 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:37:28,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:37:28,969 INFO L93 Difference]: Finished difference Result 5688 states and 6582 transitions. [2021-12-06 18:37:28,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 18:37:28,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 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 163 [2021-12-06 18:37:28,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:37:28,983 INFO L225 Difference]: With dead ends: 5688 [2021-12-06 18:37:28,983 INFO L226 Difference]: Without dead ends: 2846 [2021-12-06 18:37:28,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 18:37:28,987 INFO L933 BasicCegarLoop]: 242 mSDtfsCounter, 116 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 18:37:28,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 259 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 18:37:28,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2846 states. [2021-12-06 18:37:29,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2846 to 2844. [2021-12-06 18:37:29,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2844 states, 2843 states have (on average 1.1382342595849455) internal successors, (3236), 2843 states have internal predecessors, (3236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:37:29,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2844 states to 2844 states and 3236 transitions. [2021-12-06 18:37:29,044 INFO L78 Accepts]: Start accepts. Automaton has 2844 states and 3236 transitions. Word has length 163 [2021-12-06 18:37:29,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:37:29,045 INFO L470 AbstractCegarLoop]: Abstraction has 2844 states and 3236 transitions. [2021-12-06 18:37:29,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:37:29,045 INFO L276 IsEmpty]: Start isEmpty. Operand 2844 states and 3236 transitions. [2021-12-06 18:37:29,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-12-06 18:37:29,049 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:37:29,050 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2021-12-06 18:37:29,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 18:37:29,050 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:37:29,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:37:29,050 INFO L85 PathProgramCache]: Analyzing trace with hash -30165785, now seen corresponding path program 1 times [2021-12-06 18:37:29,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:37:29,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211115882] [2021-12-06 18:37:29,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:37:29,051 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:37:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 18:37:29,093 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-12-06 18:37:29,093 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 18:37:29,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211115882] [2021-12-06 18:37:29,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211115882] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 18:37:29,094 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 18:37:29,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 18:37:29,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975705148] [2021-12-06 18:37:29,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 18:37:29,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 18:37:29,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 18:37:29,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 18:37:29,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 18:37:29,095 INFO L87 Difference]: Start difference. First operand 2844 states and 3236 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:37:29,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:37:29,406 INFO L93 Difference]: Finished difference Result 6810 states and 7865 transitions. [2021-12-06 18:37:29,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 18:37:29,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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 184 [2021-12-06 18:37:29,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:37:29,426 INFO L225 Difference]: With dead ends: 6810 [2021-12-06 18:37:29,426 INFO L226 Difference]: Without dead ends: 3968 [2021-12-06 18:37:29,430 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 18:37:29,431 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 141 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 18:37:29,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 214 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 18:37:29,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3968 states. [2021-12-06 18:37:29,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3968 to 3966. [2021-12-06 18:37:29,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3966 states, 3965 states have (on average 1.1407313997477933) internal successors, (4523), 3965 states have internal predecessors, (4523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:37:29,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3966 states to 3966 states and 4523 transitions. [2021-12-06 18:37:29,504 INFO L78 Accepts]: Start accepts. Automaton has 3966 states and 4523 transitions. Word has length 184 [2021-12-06 18:37:29,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:37:29,504 INFO L470 AbstractCegarLoop]: Abstraction has 3966 states and 4523 transitions. [2021-12-06 18:37:29,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 18:37:29,504 INFO L276 IsEmpty]: Start isEmpty. Operand 3966 states and 4523 transitions. [2021-12-06 18:37:29,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-12-06 18:37:29,509 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:37:29,509 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-12-06 18:37:29,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-06 18:37:29,510 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:37:29,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:37:29,510 INFO L85 PathProgramCache]: Analyzing trace with hash -372861112, now seen corresponding path program 1 times [2021-12-06 18:37:29,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 18:37:29,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115019055] [2021-12-06 18:37:29,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 18:37:29,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 18:37:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 18:37:29,558 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 18:37:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 18:37:29,653 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 18:37:29,654 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-06 18:37:29,655 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-06 18:37:29,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-06 18:37:29,659 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 18:37:29,662 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 18:37:29,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:37:29 BoogieIcfgContainer [2021-12-06 18:37:29,785 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 18:37:29,785 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 18:37:29,785 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 18:37:29,785 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 18:37:29,786 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:37:24" (3/4) ... [2021-12-06 18:37:29,787 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-06 18:37:29,887 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9879b06f-79f5-4e09-8794-7022e7c71744/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-06 18:37:29,888 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 18:37:29,888 INFO L158 Benchmark]: Toolchain (without parser) took 6607.19ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 74.2MB in the beginning and 66.2MB in the end (delta: 8.0MB). Peak memory consumption was 58.2MB. Max. memory is 16.1GB. [2021-12-06 18:37:29,888 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 71.3MB. Free memory was 49.5MB in the beginning and 49.5MB in the end (delta: 30.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 18:37:29,889 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.78ms. Allocated memory is still 109.1MB. Free memory was 74.0MB in the beginning and 70.0MB in the end (delta: 4.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-06 18:37:29,889 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.06ms. Allocated memory is still 109.1MB. Free memory was 70.0MB in the beginning and 64.3MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-06 18:37:29,889 INFO L158 Benchmark]: Boogie Preprocessor took 57.73ms. Allocated memory is still 109.1MB. Free memory was 64.3MB in the beginning and 60.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-06 18:37:29,890 INFO L158 Benchmark]: RCFGBuilder took 705.85ms. Allocated memory is still 109.1MB. Free memory was 60.1MB in the beginning and 54.6MB in the end (delta: 5.5MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2021-12-06 18:37:29,890 INFO L158 Benchmark]: TraceAbstraction took 5298.91ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 54.6MB in the beginning and 89.2MB in the end (delta: -34.6MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2021-12-06 18:37:29,891 INFO L158 Benchmark]: Witness Printer took 102.74ms. Allocated memory is still 159.4MB. Free memory was 89.2MB in the beginning and 66.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-12-06 18:37:29,892 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 71.3MB. Free memory was 49.5MB in the beginning and 49.5MB in the end (delta: 30.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 367.78ms. Allocated memory is still 109.1MB. Free memory was 74.0MB in the beginning and 70.0MB in the end (delta: 4.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.06ms. Allocated memory is still 109.1MB. Free memory was 70.0MB in the beginning and 64.3MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.73ms. Allocated memory is still 109.1MB. Free memory was 64.3MB in the beginning and 60.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 705.85ms. Allocated memory is still 109.1MB. Free memory was 60.1MB in the beginning and 54.6MB in the end (delta: 5.5MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5298.91ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 54.6MB in the beginning and 89.2MB in the end (delta: -34.6MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. * Witness Printer took 102.74ms. Allocated memory is still 159.4MB. Free memory was 89.2MB in the beginning and 66.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 440]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int e= 5; [L19] int d= 4; [L20] int f= 6; [L21] int c= 3; [L24] int u = 21; [L25] int v = 22; [L26] int w = 23; [L27] int x = 24; [L28] int y = 25; [L29] int z = 26; [L32] int a25 = 0; [L33] int a11 = 0; [L34] int a28 = 7; [L35] int a19 = 1; [L36] int a21 = 1; [L37] int a17 = 8; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L613] int output = -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL, EXPR calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND TRUE (((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1)) [L176] a25 = 1 [L177] a28 = 9 [L178] return 26; VAL [\old(input)=3, \result=26, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL, EXPR calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L247] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L258] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L263] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L269] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L290] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L301] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L303] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L307] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L319] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L338] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L341] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L359] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L364] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [\old(input)=5, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND TRUE ((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1))) [L379] a11 = 1 [L380] a19 = 0 [L381] a25 = 1 [L382] a17 = 7 [L383] a28 = 9 [L384] return -1; VAL [\old(input)=5, \result=-1, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L247] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L258] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L263] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L269] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L290] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L301] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L303] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L307] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L319] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L338] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L341] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L359] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L364] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L385] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L388] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L390] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L399] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L408] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L412] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L414] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L417] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L419] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L424] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L427] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L430] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L433] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L436] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L439] COND TRUE ((((((a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7)) VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L440] reach_error() VAL [\old(input)=5, a=1, a11=1, a17=7, a19=0, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 11, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1470 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1470 mSDsluCounter, 1517 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 166 mSDsCounter, 692 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3772 IncrementalHoareTripleChecker+Invalid, 4464 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 692 mSolverCounterUnsat, 1351 mSDtfsCounter, 3772 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3966occurred in iteration=10, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 726 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1473 NumberOfCodeBlocks, 1473 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1278 ConstructedInterpolants, 0 QuantifiedInterpolants, 2224 SizeOfPredicates, 0 NumberOfNonLiveVariables, 198 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 556/564 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-06 18:37:29,924 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9879b06f-79f5-4e09-8794-7022e7c71744/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE