./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.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_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/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_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/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_a388d153-e777-4dd3-889b-e643deee1edd/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 d6dd7af8c681da9a32811252853803422c95f4df19741eb4bc23f2d0511fe647 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-07 01:13:14,484 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-07 01:13:14,485 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-07 01:13:14,512 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-07 01:13:14,512 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-07 01:13:14,513 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-07 01:13:14,514 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-07 01:13:14,516 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-07 01:13:14,517 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-07 01:13:14,518 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-07 01:13:14,519 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-07 01:13:14,527 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-07 01:13:14,527 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-07 01:13:14,528 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-07 01:13:14,529 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-07 01:13:14,530 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-07 01:13:14,531 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-07 01:13:14,532 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-07 01:13:14,533 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-07 01:13:14,535 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-07 01:13:14,536 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-07 01:13:14,538 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-07 01:13:14,539 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-07 01:13:14,539 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-07 01:13:14,542 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-07 01:13:14,542 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-07 01:13:14,543 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-07 01:13:14,548 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-07 01:13:14,548 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-07 01:13:14,549 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-07 01:13:14,549 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-07 01:13:14,550 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-07 01:13:14,551 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-07 01:13:14,552 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-07 01:13:14,552 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-07 01:13:14,553 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-07 01:13:14,553 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-07 01:13:14,554 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-07 01:13:14,554 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-07 01:13:14,555 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-07 01:13:14,555 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-07 01:13:14,556 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-07 01:13:14,572 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-07 01:13:14,572 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-07 01:13:14,572 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-07 01:13:14,573 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-07 01:13:14,573 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-07 01:13:14,573 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-07 01:13:14,574 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-07 01:13:14,574 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-07 01:13:14,574 INFO L138 SettingsManager]: * Use SBE=true [2021-12-07 01:13:14,574 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-07 01:13:14,574 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-07 01:13:14,574 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-07 01:13:14,574 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-07 01:13:14,574 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-07 01:13:14,575 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-07 01:13:14,575 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-07 01:13:14,575 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-07 01:13:14,575 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-07 01:13:14,575 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-07 01:13:14,575 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-07 01:13:14,575 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-07 01:13:14,575 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-07 01:13:14,575 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-07 01:13:14,576 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-07 01:13:14,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 01:13:14,576 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-07 01:13:14,576 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-07 01:13:14,576 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-07 01:13:14,576 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-07 01:13:14,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-07 01:13:14,576 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-07 01:13:14,576 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-07 01:13:14,577 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-07 01:13:14,577 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-07 01:13:14,577 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_a388d153-e777-4dd3-889b-e643deee1edd/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_a388d153-e777-4dd3-889b-e643deee1edd/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 -> d6dd7af8c681da9a32811252853803422c95f4df19741eb4bc23f2d0511fe647 [2021-12-07 01:13:14,753 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-07 01:13:14,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-07 01:13:14,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-07 01:13:14,773 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-07 01:13:14,774 INFO L275 PluginConnector]: CDTParser initialized [2021-12-07 01:13:14,775 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2021-12-07 01:13:14,816 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/data/7f52a9645/bfcb210e602340518b2c17717fbc7146/FLAG14a20c4b0 [2021-12-07 01:13:15,215 INFO L306 CDTParser]: Found 1 translation units. [2021-12-07 01:13:15,216 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2021-12-07 01:13:15,223 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/data/7f52a9645/bfcb210e602340518b2c17717fbc7146/FLAG14a20c4b0 [2021-12-07 01:13:15,235 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/data/7f52a9645/bfcb210e602340518b2c17717fbc7146 [2021-12-07 01:13:15,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-07 01:13:15,238 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-07 01:13:15,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-07 01:13:15,239 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-07 01:13:15,242 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-07 01:13:15,242 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:13:15" (1/1) ... [2021-12-07 01:13:15,243 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7780172a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:13:15, skipping insertion in model container [2021-12-07 01:13:15,243 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:13:15" (1/1) ... [2021-12-07 01:13:15,248 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-07 01:13:15,278 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-07 01:13:15,456 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_a388d153-e777-4dd3-889b-e643deee1edd/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c[11956,11969] [2021-12-07 01:13:15,459 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 01:13:15,469 INFO L203 MainTranslator]: Completed pre-run [2021-12-07 01:13:15,523 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_a388d153-e777-4dd3-889b-e643deee1edd/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c[11956,11969] [2021-12-07 01:13:15,523 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 01:13:15,539 INFO L208 MainTranslator]: Completed translation [2021-12-07 01:13:15,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:13:15 WrapperNode [2021-12-07 01:13:15,540 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-07 01:13:15,541 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-07 01:13:15,541 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-07 01:13:15,541 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-07 01:13:15,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:13:15" (1/1) ... [2021-12-07 01:13:15,557 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:13:15" (1/1) ... [2021-12-07 01:13:15,591 INFO L137 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 413 [2021-12-07 01:13:15,591 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-07 01:13:15,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-07 01:13:15,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-07 01:13:15,592 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-07 01:13:15,601 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:13:15" (1/1) ... [2021-12-07 01:13:15,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:13:15" (1/1) ... [2021-12-07 01:13:15,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:13:15" (1/1) ... [2021-12-07 01:13:15,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:13:15" (1/1) ... [2021-12-07 01:13:15,618 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:13:15" (1/1) ... [2021-12-07 01:13:15,626 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:13:15" (1/1) ... [2021-12-07 01:13:15,629 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:13:15" (1/1) ... [2021-12-07 01:13:15,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-07 01:13:15,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-07 01:13:15,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-07 01:13:15,635 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-07 01:13:15,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:13:15" (1/1) ... [2021-12-07 01:13:15,642 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 01:13:15,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:13:15,661 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-07 01:13:15,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-07 01:13:15,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-07 01:13:15,691 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2021-12-07 01:13:15,691 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2021-12-07 01:13:15,691 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2021-12-07 01:13:15,691 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2021-12-07 01:13:15,691 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2021-12-07 01:13:15,691 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2021-12-07 01:13:15,691 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2021-12-07 01:13:15,692 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2021-12-07 01:13:15,692 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2021-12-07 01:13:15,692 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2021-12-07 01:13:15,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-07 01:13:15,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-07 01:13:15,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-07 01:13:15,778 INFO L236 CfgBuilder]: Building ICFG [2021-12-07 01:13:15,779 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-07 01:13:16,146 INFO L277 CfgBuilder]: Performing block encoding [2021-12-07 01:13:16,155 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-07 01:13:16,155 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-07 01:13:16,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:13:16 BoogieIcfgContainer [2021-12-07 01:13:16,157 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-07 01:13:16,159 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-07 01:13:16,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-07 01:13:16,161 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-07 01:13:16,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:13:15" (1/3) ... [2021-12-07 01:13:16,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e370225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:13:16, skipping insertion in model container [2021-12-07 01:13:16,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:13:15" (2/3) ... [2021-12-07 01:13:16,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e370225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:13:16, skipping insertion in model container [2021-12-07 01:13:16,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:13:16" (3/3) ... [2021-12-07 01:13:16,163 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2021-12-07 01:13:16,167 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-07 01:13:16,167 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-07 01:13:16,207 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-07 01:13:16,213 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-07 01:13:16,213 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-07 01:13:16,233 INFO L276 IsEmpty]: Start isEmpty. Operand has 184 states, 145 states have (on average 1.606896551724138) internal successors, (233), 149 states have internal predecessors, (233), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2021-12-07 01:13:16,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-07 01:13:16,240 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:16,241 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:13:16,241 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:16,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:16,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1605485676, now seen corresponding path program 1 times [2021-12-07 01:13:16,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:16,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235705757] [2021-12-07 01:13:16,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:16,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:16,399 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-07 01:13:16,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:16,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235705757] [2021-12-07 01:13:16,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235705757] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:13:16,401 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:13:16,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:13:16,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950366262] [2021-12-07 01:13:16,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:13:16,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:13:16,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:16,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:13:16,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:13:16,429 INFO L87 Difference]: Start difference. First operand has 184 states, 145 states have (on average 1.606896551724138) internal successors, (233), 149 states have internal predecessors, (233), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:13:16,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:16,511 INFO L93 Difference]: Finished difference Result 373 states and 637 transitions. [2021-12-07 01:13:16,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:13:16,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-07 01:13:16,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:16,521 INFO L225 Difference]: With dead ends: 373 [2021-12-07 01:13:16,521 INFO L226 Difference]: Without dead ends: 188 [2021-12-07 01:13:16,526 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:13:16,528 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 18 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:16,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 826 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:13:16,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-12-07 01:13:16,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2021-12-07 01:13:16,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 147 states have (on average 1.530612244897959) internal successors, (225), 150 states have internal predecessors, (225), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2021-12-07 01:13:16,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 289 transitions. [2021-12-07 01:13:16,574 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 289 transitions. Word has length 15 [2021-12-07 01:13:16,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:16,574 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 289 transitions. [2021-12-07 01:13:16,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:13:16,574 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 289 transitions. [2021-12-07 01:13:16,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-07 01:13:16,576 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:16,576 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:13:16,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-07 01:13:16,577 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:16,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:16,577 INFO L85 PathProgramCache]: Analyzing trace with hash -621436427, now seen corresponding path program 1 times [2021-12-07 01:13:16,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:16,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072203352] [2021-12-07 01:13:16,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:16,578 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:16,613 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-07 01:13:16,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:16,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072203352] [2021-12-07 01:13:16,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072203352] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:13:16,614 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:13:16,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:13:16,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460740907] [2021-12-07 01:13:16,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:13:16,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:13:16,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:16,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:13:16,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:13:16,616 INFO L87 Difference]: Start difference. First operand 186 states and 289 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:13:16,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:16,655 INFO L93 Difference]: Finished difference Result 385 states and 601 transitions. [2021-12-07 01:13:16,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:13:16,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-07 01:13:16,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:16,658 INFO L225 Difference]: With dead ends: 385 [2021-12-07 01:13:16,658 INFO L226 Difference]: Without dead ends: 202 [2021-12-07 01:13:16,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:13:16,660 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 25 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:16,661 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 835 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:13:16,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-12-07 01:13:16,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 199. [2021-12-07 01:13:16,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 158 states have (on average 1.5126582278481013) internal successors, (239), 161 states have internal predecessors, (239), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2021-12-07 01:13:16,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 305 transitions. [2021-12-07 01:13:16,678 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 305 transitions. Word has length 16 [2021-12-07 01:13:16,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:16,678 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 305 transitions. [2021-12-07 01:13:16,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:13:16,678 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 305 transitions. [2021-12-07 01:13:16,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-07 01:13:16,680 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:16,680 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] [2021-12-07 01:13:16,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-07 01:13:16,680 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:16,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:16,681 INFO L85 PathProgramCache]: Analyzing trace with hash -741910715, now seen corresponding path program 1 times [2021-12-07 01:13:16,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:16,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117396087] [2021-12-07 01:13:16,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:16,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:16,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:13:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:16,725 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-07 01:13:16,725 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:16,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117396087] [2021-12-07 01:13:16,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117396087] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:13:16,725 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:13:16,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 01:13:16,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285169026] [2021-12-07 01:13:16,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:13:16,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:13:16,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:16,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:13:16,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:13:16,727 INFO L87 Difference]: Start difference. First operand 199 states and 305 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-07 01:13:16,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:16,744 INFO L93 Difference]: Finished difference Result 417 states and 647 transitions. [2021-12-07 01:13:16,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:13:16,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-12-07 01:13:16,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:16,747 INFO L225 Difference]: With dead ends: 417 [2021-12-07 01:13:16,747 INFO L226 Difference]: Without dead ends: 228 [2021-12-07 01:13:16,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-07 01:13:16,749 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 22 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:16,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 564 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:13:16,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-12-07 01:13:16,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 201. [2021-12-07 01:13:16,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 160 states have (on average 1.50625) internal successors, (241), 163 states have internal predecessors, (241), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2021-12-07 01:13:16,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 307 transitions. [2021-12-07 01:13:16,765 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 307 transitions. Word has length 23 [2021-12-07 01:13:16,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:16,765 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 307 transitions. [2021-12-07 01:13:16,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-07 01:13:16,765 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 307 transitions. [2021-12-07 01:13:16,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-07 01:13:16,766 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:16,767 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] [2021-12-07 01:13:16,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-07 01:13:16,767 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:16,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:16,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1197019830, now seen corresponding path program 1 times [2021-12-07 01:13:16,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:16,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863875529] [2021-12-07 01:13:16,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:16,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:16,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:13:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:16,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:13:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:16,819 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-07 01:13:16,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:16,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863875529] [2021-12-07 01:13:16,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863875529] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:13:16,819 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:13:16,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:13:16,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724814457] [2021-12-07 01:13:16,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:13:16,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:13:16,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:16,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:13:16,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:13:16,821 INFO L87 Difference]: Start difference. First operand 201 states and 307 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-07 01:13:16,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:16,852 INFO L93 Difference]: Finished difference Result 457 states and 714 transitions. [2021-12-07 01:13:16,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:13:16,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2021-12-07 01:13:16,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:16,855 INFO L225 Difference]: With dead ends: 457 [2021-12-07 01:13:16,855 INFO L226 Difference]: Without dead ends: 307 [2021-12-07 01:13:16,856 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:13:16,857 INFO L933 BasicCegarLoop]: 300 mSDtfsCounter, 132 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:16,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 870 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:13:16,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-12-07 01:13:16,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 201. [2021-12-07 01:13:16,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 160 states have (on average 1.48125) internal successors, (237), 163 states have internal predecessors, (237), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2021-12-07 01:13:16,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 303 transitions. [2021-12-07 01:13:16,871 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 303 transitions. Word has length 31 [2021-12-07 01:13:16,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:16,871 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 303 transitions. [2021-12-07 01:13:16,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-07 01:13:16,871 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 303 transitions. [2021-12-07 01:13:16,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-07 01:13:16,873 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:16,873 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] [2021-12-07 01:13:16,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-07 01:13:16,873 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:16,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:16,873 INFO L85 PathProgramCache]: Analyzing trace with hash -422396736, now seen corresponding path program 1 times [2021-12-07 01:13:16,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:16,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548615517] [2021-12-07 01:13:16,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:16,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:16,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:13:16,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:16,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:13:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:16,925 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-07 01:13:16,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:16,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548615517] [2021-12-07 01:13:16,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548615517] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:13:16,926 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:13:16,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-07 01:13:16,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553144845] [2021-12-07 01:13:16,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:13:16,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:13:16,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:16,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:13:16,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:13:16,928 INFO L87 Difference]: Start difference. First operand 201 states and 303 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-07 01:13:16,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:16,951 INFO L93 Difference]: Finished difference Result 392 states and 595 transitions. [2021-12-07 01:13:16,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:13:16,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2021-12-07 01:13:16,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:16,953 INFO L225 Difference]: With dead ends: 392 [2021-12-07 01:13:16,953 INFO L226 Difference]: Without dead ends: 203 [2021-12-07 01:13:16,954 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-07 01:13:16,955 INFO L933 BasicCegarLoop]: 278 mSDtfsCounter, 0 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:16,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1104 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:13:16,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-12-07 01:13:16,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2021-12-07 01:13:16,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 160 states have (on average 1.475) internal successors, (236), 163 states have internal predecessors, (236), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2021-12-07 01:13:16,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 302 transitions. [2021-12-07 01:13:16,965 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 302 transitions. Word has length 32 [2021-12-07 01:13:16,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:16,966 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 302 transitions. [2021-12-07 01:13:16,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-07 01:13:16,966 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 302 transitions. [2021-12-07 01:13:16,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-07 01:13:16,967 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:16,967 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] [2021-12-07 01:13:16,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-07 01:13:16,967 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:16,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:16,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1664815819, now seen corresponding path program 1 times [2021-12-07 01:13:16,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:16,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861282130] [2021-12-07 01:13:16,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:16,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:16,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:16,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:13:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:17,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:13:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:17,009 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:13:17,009 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:17,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861282130] [2021-12-07 01:13:17,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861282130] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:13:17,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743575081] [2021-12-07 01:13:17,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:17,010 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:13:17,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:13:17,011 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:13:17,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-07 01:13:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:17,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-07 01:13:17,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:13:17,144 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:13:17,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:13:17,207 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:13:17,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743575081] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:13:17,208 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:13:17,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-12-07 01:13:17,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325691919] [2021-12-07 01:13:17,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:13:17,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:13:17,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:17,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:13:17,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:13:17,210 INFO L87 Difference]: Start difference. First operand 201 states and 302 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-07 01:13:17,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:17,253 INFO L93 Difference]: Finished difference Result 450 states and 691 transitions. [2021-12-07 01:13:17,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:13:17,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2021-12-07 01:13:17,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:17,257 INFO L225 Difference]: With dead ends: 450 [2021-12-07 01:13:17,258 INFO L226 Difference]: Without dead ends: 260 [2021-12-07 01:13:17,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:13:17,260 INFO L933 BasicCegarLoop]: 286 mSDtfsCounter, 66 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:17,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 1084 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:13:17,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-12-07 01:13:17,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 254. [2021-12-07 01:13:17,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 203 states have (on average 1.4532019704433496) internal successors, (295), 206 states have internal predecessors, (295), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2021-12-07 01:13:17,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 381 transitions. [2021-12-07 01:13:17,276 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 381 transitions. Word has length 35 [2021-12-07 01:13:17,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:17,276 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 381 transitions. [2021-12-07 01:13:17,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-07 01:13:17,277 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 381 transitions. [2021-12-07 01:13:17,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-07 01:13:17,278 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:17,278 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:13:17,310 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-07 01:13:17,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:13:17,479 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:17,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:17,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1225495307, now seen corresponding path program 2 times [2021-12-07 01:13:17,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:17,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998168628] [2021-12-07 01:13:17,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:17,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:17,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:13:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:17,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:13:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:17,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:13:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:17,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:13:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:17,533 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-12-07 01:13:17,533 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:17,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998168628] [2021-12-07 01:13:17,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998168628] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:13:17,534 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:13:17,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:13:17,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534042578] [2021-12-07 01:13:17,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:13:17,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:13:17,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:17,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:13:17,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:13:17,535 INFO L87 Difference]: Start difference. First operand 254 states and 381 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-07 01:13:17,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:17,570 INFO L93 Difference]: Finished difference Result 518 states and 788 transitions. [2021-12-07 01:13:17,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:13:17,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2021-12-07 01:13:17,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:17,574 INFO L225 Difference]: With dead ends: 518 [2021-12-07 01:13:17,574 INFO L226 Difference]: Without dead ends: 293 [2021-12-07 01:13:17,575 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:13:17,576 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 24 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:17,576 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 827 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:13:17,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-12-07 01:13:17,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 290. [2021-12-07 01:13:17,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 235 states have (on average 1.4127659574468086) internal successors, (332), 238 states have internal predecessors, (332), 46 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2021-12-07 01:13:17,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 424 transitions. [2021-12-07 01:13:17,594 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 424 transitions. Word has length 57 [2021-12-07 01:13:17,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:17,595 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 424 transitions. [2021-12-07 01:13:17,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-07 01:13:17,595 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 424 transitions. [2021-12-07 01:13:17,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-07 01:13:17,597 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:17,597 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:13:17,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-07 01:13:17,597 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:17,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:17,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1867707356, now seen corresponding path program 1 times [2021-12-07 01:13:17,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:17,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593746770] [2021-12-07 01:13:17,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:17,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:17,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:13:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:17,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:13:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:17,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:13:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:17,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:13:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:17,659 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-12-07 01:13:17,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:17,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593746770] [2021-12-07 01:13:17,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593746770] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:13:17,660 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:13:17,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:13:17,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159462661] [2021-12-07 01:13:17,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:13:17,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:13:17,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:17,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:13:17,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:13:17,662 INFO L87 Difference]: Start difference. First operand 290 states and 424 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-07 01:13:17,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:17,690 INFO L93 Difference]: Finished difference Result 555 states and 835 transitions. [2021-12-07 01:13:17,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:13:17,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2021-12-07 01:13:17,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:17,693 INFO L225 Difference]: With dead ends: 555 [2021-12-07 01:13:17,693 INFO L226 Difference]: Without dead ends: 299 [2021-12-07 01:13:17,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:13:17,695 INFO L933 BasicCegarLoop]: 277 mSDtfsCounter, 19 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:17,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 813 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:13:17,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-12-07 01:13:17,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2021-12-07 01:13:17,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 241 states have (on average 1.4107883817427387) internal successors, (340), 244 states have internal predecessors, (340), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2021-12-07 01:13:17,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 432 transitions. [2021-12-07 01:13:17,718 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 432 transitions. Word has length 57 [2021-12-07 01:13:17,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:17,718 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 432 transitions. [2021-12-07 01:13:17,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-07 01:13:17,719 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 432 transitions. [2021-12-07 01:13:17,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-07 01:13:17,720 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:17,720 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 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] [2021-12-07 01:13:17,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-07 01:13:17,721 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:17,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:17,721 INFO L85 PathProgramCache]: Analyzing trace with hash -917641064, now seen corresponding path program 1 times [2021-12-07 01:13:17,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:17,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459966981] [2021-12-07 01:13:17,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:17,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:17,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:17,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:13:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:17,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:13:17,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:17,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:13:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:17,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:13:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:17,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:13:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:17,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:13:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:17,785 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-07 01:13:17,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:17,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459966981] [2021-12-07 01:13:17,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459966981] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:13:17,785 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:13:17,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-07 01:13:17,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065304775] [2021-12-07 01:13:17,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:13:17,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:13:17,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:17,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:13:17,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:13:17,787 INFO L87 Difference]: Start difference. First operand 297 states and 432 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-07 01:13:17,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:17,804 INFO L93 Difference]: Finished difference Result 543 states and 803 transitions. [2021-12-07 01:13:17,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:13:17,805 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 75 [2021-12-07 01:13:17,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:17,806 INFO L225 Difference]: With dead ends: 543 [2021-12-07 01:13:17,807 INFO L226 Difference]: Without dead ends: 299 [2021-12-07 01:13:17,807 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-07 01:13:17,808 INFO L933 BasicCegarLoop]: 278 mSDtfsCounter, 0 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:17,808 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1103 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:13:17,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-12-07 01:13:17,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2021-12-07 01:13:17,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 241 states have (on average 1.3983402489626555) internal successors, (337), 244 states have internal predecessors, (337), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2021-12-07 01:13:17,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 429 transitions. [2021-12-07 01:13:17,820 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 429 transitions. Word has length 75 [2021-12-07 01:13:17,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:17,820 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 429 transitions. [2021-12-07 01:13:17,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-07 01:13:17,820 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 429 transitions. [2021-12-07 01:13:17,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-12-07 01:13:17,821 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:17,821 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:13:17,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-07 01:13:17,821 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:17,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:17,822 INFO L85 PathProgramCache]: Analyzing trace with hash -276575053, now seen corresponding path program 1 times [2021-12-07 01:13:17,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:17,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420964439] [2021-12-07 01:13:17,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:17,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:17,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:13:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:17,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:13:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:17,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:13:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:17,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:13:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:17,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:13:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:17,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:13:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:17,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:13:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:17,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:13:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:17,885 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-12-07 01:13:17,885 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:17,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420964439] [2021-12-07 01:13:17,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420964439] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:13:17,886 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:13:17,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:13:17,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191744964] [2021-12-07 01:13:17,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:13:17,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:13:17,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:17,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:13:17,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:13:17,887 INFO L87 Difference]: Start difference. First operand 297 states and 429 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-07 01:13:17,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:17,918 INFO L93 Difference]: Finished difference Result 580 states and 859 transitions. [2021-12-07 01:13:17,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:13:17,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 104 [2021-12-07 01:13:17,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:17,921 INFO L225 Difference]: With dead ends: 580 [2021-12-07 01:13:17,921 INFO L226 Difference]: Without dead ends: 341 [2021-12-07 01:13:17,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:13:17,922 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 25 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:17,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 827 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:13:17,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-12-07 01:13:17,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 338. [2021-12-07 01:13:17,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 278 states have (on average 1.3633093525179856) internal successors, (379), 281 states have internal predecessors, (379), 49 states have call successors, (49), 10 states have call predecessors, (49), 10 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2021-12-07 01:13:17,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 477 transitions. [2021-12-07 01:13:17,934 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 477 transitions. Word has length 104 [2021-12-07 01:13:17,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:17,935 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 477 transitions. [2021-12-07 01:13:17,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-07 01:13:17,935 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 477 transitions. [2021-12-07 01:13:17,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-12-07 01:13:17,936 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:17,936 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:13:17,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-07 01:13:17,936 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:17,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:17,936 INFO L85 PathProgramCache]: Analyzing trace with hash -92526865, now seen corresponding path program 1 times [2021-12-07 01:13:17,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:17,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825728400] [2021-12-07 01:13:17,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:17,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:17,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:13:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:17,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:13:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:17,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:13:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:17,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:13:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:17,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:13:17,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:17,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:13:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:17,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:13:17,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:17,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:13:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:17,995 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-12-07 01:13:17,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:17,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825728400] [2021-12-07 01:13:17,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825728400] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:13:17,995 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:13:17,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:13:17,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011484766] [2021-12-07 01:13:17,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:13:17,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:13:17,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:17,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:13:17,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:13:17,997 INFO L87 Difference]: Start difference. First operand 338 states and 477 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-07 01:13:18,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:18,030 INFO L93 Difference]: Finished difference Result 606 states and 879 transitions. [2021-12-07 01:13:18,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 01:13:18,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 105 [2021-12-07 01:13:18,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:18,033 INFO L225 Difference]: With dead ends: 606 [2021-12-07 01:13:18,033 INFO L226 Difference]: Without dead ends: 332 [2021-12-07 01:13:18,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:13:18,035 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 15 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:18,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 786 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:13:18,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-12-07 01:13:18,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2021-12-07 01:13:18,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 273 states have (on average 1.3443223443223444) internal successors, (367), 276 states have internal predecessors, (367), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2021-12-07 01:13:18,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 463 transitions. [2021-12-07 01:13:18,052 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 463 transitions. Word has length 105 [2021-12-07 01:13:18,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:18,053 INFO L470 AbstractCegarLoop]: Abstraction has 332 states and 463 transitions. [2021-12-07 01:13:18,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-07 01:13:18,053 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 463 transitions. [2021-12-07 01:13:18,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-12-07 01:13:18,055 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:18,055 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-07 01:13:18,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-07 01:13:18,055 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:18,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:18,056 INFO L85 PathProgramCache]: Analyzing trace with hash -440553643, now seen corresponding path program 1 times [2021-12-07 01:13:18,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:18,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135795431] [2021-12-07 01:13:18,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:18,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:18,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:13:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:13:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:13:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:13:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:13:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:13:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:13:18,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:13:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:13:18,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:13:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,150 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2021-12-07 01:13:18,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:18,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135795431] [2021-12-07 01:13:18,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135795431] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:13:18,150 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:13:18,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-07 01:13:18,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372402295] [2021-12-07 01:13:18,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:13:18,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:13:18,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:18,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:13:18,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:13:18,151 INFO L87 Difference]: Start difference. First operand 332 states and 463 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-07 01:13:18,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:18,169 INFO L93 Difference]: Finished difference Result 581 states and 828 transitions. [2021-12-07 01:13:18,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:13:18,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 124 [2021-12-07 01:13:18,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:18,171 INFO L225 Difference]: With dead ends: 581 [2021-12-07 01:13:18,171 INFO L226 Difference]: Without dead ends: 334 [2021-12-07 01:13:18,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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-07 01:13:18,173 INFO L933 BasicCegarLoop]: 274 mSDtfsCounter, 0 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:18,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1087 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:13:18,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-12-07 01:13:18,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2021-12-07 01:13:18,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 273 states have (on average 1.3333333333333333) internal successors, (364), 276 states have internal predecessors, (364), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2021-12-07 01:13:18,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 460 transitions. [2021-12-07 01:13:18,184 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 460 transitions. Word has length 124 [2021-12-07 01:13:18,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:18,184 INFO L470 AbstractCegarLoop]: Abstraction has 332 states and 460 transitions. [2021-12-07 01:13:18,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-07 01:13:18,185 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 460 transitions. [2021-12-07 01:13:18,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-12-07 01:13:18,186 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:18,186 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 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, 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-07 01:13:18,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-07 01:13:18,186 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:18,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:18,186 INFO L85 PathProgramCache]: Analyzing trace with hash -37757066, now seen corresponding path program 1 times [2021-12-07 01:13:18,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:18,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454984085] [2021-12-07 01:13:18,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:18,187 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:13:18,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:13:18,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:13:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:13:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:13:18,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:13:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:13:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:13:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:13:18,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:13:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:13:18,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,267 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2021-12-07 01:13:18,267 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:18,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454984085] [2021-12-07 01:13:18,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454984085] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:13:18,267 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:13:18,268 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:13:18,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680294652] [2021-12-07 01:13:18,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:13:18,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:13:18,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:18,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:13:18,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:13:18,269 INFO L87 Difference]: Start difference. First operand 332 states and 460 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-07 01:13:18,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:18,302 INFO L93 Difference]: Finished difference Result 544 states and 788 transitions. [2021-12-07 01:13:18,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 01:13:18,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 157 [2021-12-07 01:13:18,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:18,304 INFO L225 Difference]: With dead ends: 544 [2021-12-07 01:13:18,304 INFO L226 Difference]: Without dead ends: 330 [2021-12-07 01:13:18,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:13:18,305 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 13 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:18,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 754 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:13:18,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-12-07 01:13:18,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2021-12-07 01:13:18,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 272 states have (on average 1.3308823529411764) internal successors, (362), 275 states have internal predecessors, (362), 47 states have call successors, (47), 10 states have call predecessors, (47), 10 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2021-12-07 01:13:18,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 456 transitions. [2021-12-07 01:13:18,316 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 456 transitions. Word has length 157 [2021-12-07 01:13:18,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:18,317 INFO L470 AbstractCegarLoop]: Abstraction has 330 states and 456 transitions. [2021-12-07 01:13:18,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-07 01:13:18,317 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 456 transitions. [2021-12-07 01:13:18,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-12-07 01:13:18,318 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:18,319 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:13:18,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-07 01:13:18,319 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:18,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:18,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1460013805, now seen corresponding path program 1 times [2021-12-07 01:13:18,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:18,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426191523] [2021-12-07 01:13:18,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:18,319 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:13:18,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:13:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:13:18,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:13:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:13:18,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:13:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:13:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:13:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:13:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:13:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:13:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:13:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:13:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,413 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2021-12-07 01:13:18,413 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:18,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426191523] [2021-12-07 01:13:18,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426191523] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:13:18,414 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:13:18,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:13:18,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045884120] [2021-12-07 01:13:18,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:13:18,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:13:18,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:18,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:13:18,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:13:18,415 INFO L87 Difference]: Start difference. First operand 330 states and 456 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-07 01:13:18,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:18,451 INFO L93 Difference]: Finished difference Result 484 states and 684 transitions. [2021-12-07 01:13:18,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:13:18,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 172 [2021-12-07 01:13:18,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:18,455 INFO L225 Difference]: With dead ends: 484 [2021-12-07 01:13:18,455 INFO L226 Difference]: Without dead ends: 313 [2021-12-07 01:13:18,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:13:18,456 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 35 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:18,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 735 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:13:18,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2021-12-07 01:13:18,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2021-12-07 01:13:18,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 258 states have (on average 1.321705426356589) internal successors, (341), 261 states have internal predecessors, (341), 44 states have call successors, (44), 10 states have call predecessors, (44), 10 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2021-12-07 01:13:18,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 429 transitions. [2021-12-07 01:13:18,472 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 429 transitions. Word has length 172 [2021-12-07 01:13:18,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:18,472 INFO L470 AbstractCegarLoop]: Abstraction has 313 states and 429 transitions. [2021-12-07 01:13:18,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-07 01:13:18,473 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 429 transitions. [2021-12-07 01:13:18,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-12-07 01:13:18,474 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:18,475 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:13:18,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-07 01:13:18,475 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:18,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:18,475 INFO L85 PathProgramCache]: Analyzing trace with hash 409048779, now seen corresponding path program 1 times [2021-12-07 01:13:18,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:18,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074233721] [2021-12-07 01:13:18,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:18,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:18,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:13:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:13:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:13:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:13:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:13:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:13:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:13:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:13:18,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:13:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:13:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:13:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:13:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:13:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,570 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2021-12-07 01:13:18,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:18,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074233721] [2021-12-07 01:13:18,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074233721] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:13:18,571 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:13:18,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:13:18,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270653816] [2021-12-07 01:13:18,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:13:18,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:13:18,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:18,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:13:18,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:13:18,572 INFO L87 Difference]: Start difference. First operand 313 states and 429 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-07 01:13:18,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:18,606 INFO L93 Difference]: Finished difference Result 467 states and 657 transitions. [2021-12-07 01:13:18,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:13:18,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 174 [2021-12-07 01:13:18,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:18,608 INFO L225 Difference]: With dead ends: 467 [2021-12-07 01:13:18,609 INFO L226 Difference]: Without dead ends: 294 [2021-12-07 01:13:18,609 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:13:18,610 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 30 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:18,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 739 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:13:18,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-12-07 01:13:18,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2021-12-07 01:13:18,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 242 states have (on average 1.3140495867768596) internal successors, (318), 245 states have internal predecessors, (318), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2021-12-07 01:13:18,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 400 transitions. [2021-12-07 01:13:18,620 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 400 transitions. Word has length 174 [2021-12-07 01:13:18,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:18,621 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 400 transitions. [2021-12-07 01:13:18,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-07 01:13:18,621 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 400 transitions. [2021-12-07 01:13:18,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-12-07 01:13:18,622 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:18,622 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:13:18,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-07 01:13:18,623 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:18,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:18,623 INFO L85 PathProgramCache]: Analyzing trace with hash 222848508, now seen corresponding path program 1 times [2021-12-07 01:13:18,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:18,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605383547] [2021-12-07 01:13:18,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:18,623 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:18,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:13:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:13:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:13:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:13:18,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:13:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:13:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:13:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:13:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:13:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:13:18,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:13:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:13:18,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:13:18,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,711 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2021-12-07 01:13:18,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:18,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605383547] [2021-12-07 01:13:18,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605383547] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:13:18,712 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:13:18,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-07 01:13:18,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304673370] [2021-12-07 01:13:18,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:13:18,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:13:18,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:18,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:13:18,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:13:18,713 INFO L87 Difference]: Start difference. First operand 294 states and 400 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2021-12-07 01:13:18,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:18,733 INFO L93 Difference]: Finished difference Result 447 states and 627 transitions. [2021-12-07 01:13:18,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:13:18,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 175 [2021-12-07 01:13:18,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:18,736 INFO L225 Difference]: With dead ends: 447 [2021-12-07 01:13:18,737 INFO L226 Difference]: Without dead ends: 294 [2021-12-07 01:13:18,737 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-07 01:13:18,738 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 0 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:18,738 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1065 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:13:18,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-12-07 01:13:18,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2021-12-07 01:13:18,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 242 states have (on average 1.2892561983471074) internal successors, (312), 245 states have internal predecessors, (312), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2021-12-07 01:13:18,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 394 transitions. [2021-12-07 01:13:18,752 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 394 transitions. Word has length 175 [2021-12-07 01:13:18,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:18,753 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 394 transitions. [2021-12-07 01:13:18,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2021-12-07 01:13:18,753 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 394 transitions. [2021-12-07 01:13:18,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2021-12-07 01:13:18,756 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:18,756 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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-07 01:13:18,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-07 01:13:18,756 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:18,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:18,757 INFO L85 PathProgramCache]: Analyzing trace with hash 312728436, now seen corresponding path program 1 times [2021-12-07 01:13:18,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:18,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396860137] [2021-12-07 01:13:18,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:18,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:13:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:13:18,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:13:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:13:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:13:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:13:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:13:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:13:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:13:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:13:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:13:18,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:13:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,856 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2021-12-07 01:13:18,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:18,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396860137] [2021-12-07 01:13:18,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396860137] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:13:18,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361452339] [2021-12-07 01:13:18,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:18,856 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:13:18,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:13:18,857 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:13:18,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-07 01:13:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:18,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-07 01:13:18,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:13:19,106 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2021-12-07 01:13:19,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:13:19,283 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2021-12-07 01:13:19,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361452339] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-07 01:13:19,284 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-07 01:13:19,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2021-12-07 01:13:19,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128890108] [2021-12-07 01:13:19,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:13:19,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:13:19,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:19,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:13:19,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:13:19,286 INFO L87 Difference]: Start difference. First operand 294 states and 394 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-07 01:13:19,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:19,323 INFO L93 Difference]: Finished difference Result 468 states and 649 transitions. [2021-12-07 01:13:19,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 01:13:19,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 182 [2021-12-07 01:13:19,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:19,327 INFO L225 Difference]: With dead ends: 468 [2021-12-07 01:13:19,327 INFO L226 Difference]: Without dead ends: 273 [2021-12-07 01:13:19,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:13:19,329 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 35 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:19,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 505 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:13:19,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-12-07 01:13:19,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2021-12-07 01:13:19,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 224 states have (on average 1.28125) internal successors, (287), 227 states have internal predecessors, (287), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2021-12-07 01:13:19,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 363 transitions. [2021-12-07 01:13:19,344 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 363 transitions. Word has length 182 [2021-12-07 01:13:19,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:19,345 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 363 transitions. [2021-12-07 01:13:19,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-07 01:13:19,345 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 363 transitions. [2021-12-07 01:13:19,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2021-12-07 01:13:19,348 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:19,349 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 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, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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-07 01:13:19,380 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-07 01:13:19,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:13:19,550 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:19,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:19,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1687421607, now seen corresponding path program 1 times [2021-12-07 01:13:19,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:19,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597764016] [2021-12-07 01:13:19,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:19,554 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:19,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:13:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:19,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:13:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:19,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:13:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:19,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:13:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:19,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:13:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:19,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:13:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:19,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:13:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:19,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:13:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:19,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:13:19,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:19,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:13:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:19,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:19,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:13:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:19,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:13:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:19,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:13:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:19,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:19,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:13:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:19,766 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2021-12-07 01:13:19,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:19,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597764016] [2021-12-07 01:13:19,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597764016] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:13:19,766 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:13:19,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:13:19,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593568187] [2021-12-07 01:13:19,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:13:19,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:13:19,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:19,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:13:19,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:13:19,768 INFO L87 Difference]: Start difference. First operand 273 states and 363 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2021-12-07 01:13:19,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:19,790 INFO L93 Difference]: Finished difference Result 425 states and 591 transitions. [2021-12-07 01:13:19,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:13:19,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 206 [2021-12-07 01:13:19,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:19,793 INFO L225 Difference]: With dead ends: 425 [2021-12-07 01:13:19,793 INFO L226 Difference]: Without dead ends: 279 [2021-12-07 01:13:19,794 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:13:19,794 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 6 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:19,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 779 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:13:19,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-12-07 01:13:19,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2021-12-07 01:13:19,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 227 states have (on average 1.277533039647577) internal successors, (290), 230 states have internal predecessors, (290), 38 states have call successors, (38), 11 states have call predecessors, (38), 11 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2021-12-07 01:13:19,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 366 transitions. [2021-12-07 01:13:19,807 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 366 transitions. Word has length 206 [2021-12-07 01:13:19,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:19,808 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 366 transitions. [2021-12-07 01:13:19,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2021-12-07 01:13:19,808 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 366 transitions. [2021-12-07 01:13:19,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2021-12-07 01:13:19,811 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:19,811 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 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, 3, 3, 3, 3, 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] [2021-12-07 01:13:19,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-07 01:13:19,811 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:19,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:19,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1286095815, now seen corresponding path program 1 times [2021-12-07 01:13:19,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:19,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910258255] [2021-12-07 01:13:19,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:19,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:19,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:13:19,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:19,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:13:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:19,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:13:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:19,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:13:19,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:19,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:13:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:19,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:13:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:19,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:13:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:19,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:13:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:19,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:13:19,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:19,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:13:19,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:19,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:19,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:19,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:13:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:19,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:13:19,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:19,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:13:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:19,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:19,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:19,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:13:19,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:19,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-07 01:13:19,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:19,934 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2021-12-07 01:13:19,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:19,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910258255] [2021-12-07 01:13:19,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910258255] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:13:19,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503753603] [2021-12-07 01:13:19,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:19,935 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:13:19,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:13:19,936 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:13:19,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-07 01:13:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:20,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-07 01:13:20,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:13:20,215 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2021-12-07 01:13:20,215 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:13:20,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503753603] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:13:20,216 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 01:13:20,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-12-07 01:13:20,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15632086] [2021-12-07 01:13:20,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:13:20,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:13:20,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:20,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:13:20,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:13:20,218 INFO L87 Difference]: Start difference. First operand 277 states and 366 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2021-12-07 01:13:20,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:20,240 INFO L93 Difference]: Finished difference Result 434 states and 598 transitions. [2021-12-07 01:13:20,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:13:20,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 215 [2021-12-07 01:13:20,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:20,243 INFO L225 Difference]: With dead ends: 434 [2021-12-07 01:13:20,243 INFO L226 Difference]: Without dead ends: 284 [2021-12-07 01:13:20,244 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-07 01:13:20,245 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 7 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:20,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 784 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:13:20,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-12-07 01:13:20,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2021-12-07 01:13:20,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 231 states have (on average 1.2727272727272727) internal successors, (294), 234 states have internal predecessors, (294), 38 states have call successors, (38), 12 states have call predecessors, (38), 12 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2021-12-07 01:13:20,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 370 transitions. [2021-12-07 01:13:20,257 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 370 transitions. Word has length 215 [2021-12-07 01:13:20,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:20,258 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 370 transitions. [2021-12-07 01:13:20,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2021-12-07 01:13:20,258 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 370 transitions. [2021-12-07 01:13:20,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2021-12-07 01:13:20,261 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:20,261 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 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, 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] [2021-12-07 01:13:20,283 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-07 01:13:20,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:13:20,462 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:20,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:20,462 INFO L85 PathProgramCache]: Analyzing trace with hash -690820591, now seen corresponding path program 1 times [2021-12-07 01:13:20,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:20,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511525191] [2021-12-07 01:13:20,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:20,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:20,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:13:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:20,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:13:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:20,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:13:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:20,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:13:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:20,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:13:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:20,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:13:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:20,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:13:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:20,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:13:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:20,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:13:20,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:20,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:13:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:20,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:20,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:13:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:20,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:13:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:20,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:13:20,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:20,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:20,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:13:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:20,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-07 01:13:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:20,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-07 01:13:20,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:20,576 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2021-12-07 01:13:20,576 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:20,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511525191] [2021-12-07 01:13:20,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511525191] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:13:20,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183472749] [2021-12-07 01:13:20,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:20,576 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:13:20,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:13:20,577 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:13:20,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-07 01:13:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:20,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-07 01:13:20,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:13:20,870 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2021-12-07 01:13:20,870 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:13:20,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183472749] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:13:20,871 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 01:13:20,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-12-07 01:13:20,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603708050] [2021-12-07 01:13:20,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:13:20,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:13:20,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:20,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:13:20,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:13:20,873 INFO L87 Difference]: Start difference. First operand 282 states and 370 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2021-12-07 01:13:20,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:20,896 INFO L93 Difference]: Finished difference Result 436 states and 596 transitions. [2021-12-07 01:13:20,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 01:13:20,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 225 [2021-12-07 01:13:20,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:20,899 INFO L225 Difference]: With dead ends: 436 [2021-12-07 01:13:20,899 INFO L226 Difference]: Without dead ends: 281 [2021-12-07 01:13:20,900 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-07 01:13:20,901 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 7 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:20,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 770 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:13:20,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-12-07 01:13:20,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2021-12-07 01:13:20,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 231 states have (on average 1.2597402597402598) internal successors, (291), 233 states have internal predecessors, (291), 37 states have call successors, (37), 12 states have call predecessors, (37), 12 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2021-12-07 01:13:20,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 365 transitions. [2021-12-07 01:13:20,913 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 365 transitions. Word has length 225 [2021-12-07 01:13:20,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:20,913 INFO L470 AbstractCegarLoop]: Abstraction has 281 states and 365 transitions. [2021-12-07 01:13:20,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2021-12-07 01:13:20,914 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 365 transitions. [2021-12-07 01:13:20,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2021-12-07 01:13:20,915 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:20,915 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 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] [2021-12-07 01:13:20,937 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-07 01:13:21,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:13:21,116 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:21,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:21,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1815976528, now seen corresponding path program 1 times [2021-12-07 01:13:21,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:21,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374060528] [2021-12-07 01:13:21,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:21,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:13:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:13:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:13:21,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:13:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:13:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:13:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:13:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:13:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:13:21,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:13:21,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:13:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:13:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:13:21,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:13:21,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-07 01:13:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-07 01:13:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-07 01:13:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,239 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2021-12-07 01:13:21,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:21,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374060528] [2021-12-07 01:13:21,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374060528] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:13:21,240 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:13:21,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:13:21,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013026979] [2021-12-07 01:13:21,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:13:21,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:13:21,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:21,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:13:21,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:13:21,241 INFO L87 Difference]: Start difference. First operand 281 states and 365 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2021-12-07 01:13:21,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:21,398 INFO L93 Difference]: Finished difference Result 478 states and 656 transitions. [2021-12-07 01:13:21,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 01:13:21,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 234 [2021-12-07 01:13:21,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:21,400 INFO L225 Difference]: With dead ends: 478 [2021-12-07 01:13:21,401 INFO L226 Difference]: Without dead ends: 324 [2021-12-07 01:13:21,401 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:13:21,401 INFO L933 BasicCegarLoop]: 313 mSDtfsCounter, 185 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:21,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 643 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:13:21,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-12-07 01:13:21,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 280. [2021-12-07 01:13:21,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 231 states have (on average 1.2554112554112553) internal successors, (290), 232 states have internal predecessors, (290), 36 states have call successors, (36), 12 states have call predecessors, (36), 12 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2021-12-07 01:13:21,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 362 transitions. [2021-12-07 01:13:21,414 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 362 transitions. Word has length 234 [2021-12-07 01:13:21,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:21,414 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 362 transitions. [2021-12-07 01:13:21,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2021-12-07 01:13:21,414 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 362 transitions. [2021-12-07 01:13:21,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2021-12-07 01:13:21,416 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:21,416 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 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] [2021-12-07 01:13:21,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-07 01:13:21,416 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:21,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:21,416 INFO L85 PathProgramCache]: Analyzing trace with hash 869606888, now seen corresponding path program 1 times [2021-12-07 01:13:21,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:21,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106358081] [2021-12-07 01:13:21,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:21,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:13:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:13:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:13:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:13:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:13:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:13:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:13:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:13:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:13:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:13:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:21,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:13:21,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:13:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:13:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:13:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-07 01:13:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-07 01:13:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-07 01:13:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,540 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2021-12-07 01:13:21,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:21,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106358081] [2021-12-07 01:13:21,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106358081] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:13:21,540 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:13:21,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-07 01:13:21,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166526199] [2021-12-07 01:13:21,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:13:21,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:13:21,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:21,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:13:21,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:13:21,541 INFO L87 Difference]: Start difference. First operand 280 states and 362 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-07 01:13:21,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:21,870 INFO L93 Difference]: Finished difference Result 657 states and 878 transitions. [2021-12-07 01:13:21,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-07 01:13:21,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 237 [2021-12-07 01:13:21,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:21,873 INFO L225 Difference]: With dead ends: 657 [2021-12-07 01:13:21,873 INFO L226 Difference]: Without dead ends: 504 [2021-12-07 01:13:21,874 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:13:21,875 INFO L933 BasicCegarLoop]: 329 mSDtfsCounter, 419 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:21,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [440 Valid, 851 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-07 01:13:21,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2021-12-07 01:13:21,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 441. [2021-12-07 01:13:21,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 362 states have (on average 1.3011049723756907) internal successors, (471), 364 states have internal predecessors, (471), 54 states have call successors, (54), 24 states have call predecessors, (54), 24 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2021-12-07 01:13:21,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 579 transitions. [2021-12-07 01:13:21,899 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 579 transitions. Word has length 237 [2021-12-07 01:13:21,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:21,900 INFO L470 AbstractCegarLoop]: Abstraction has 441 states and 579 transitions. [2021-12-07 01:13:21,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-07 01:13:21,900 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 579 transitions. [2021-12-07 01:13:21,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2021-12-07 01:13:21,902 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:21,902 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:13:21,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-07 01:13:21,903 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:21,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:21,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1758726155, now seen corresponding path program 1 times [2021-12-07 01:13:21,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:21,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24174532] [2021-12-07 01:13:21,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:21,903 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:21,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:13:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:13:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:13:21,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:13:21,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:13:21,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:13:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:13:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:13:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:13:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:13:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:21,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:13:21,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:13:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:13:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:21,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:13:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-07 01:13:22,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-07 01:13:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-07 01:13:22,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2021-12-07 01:13:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2021-12-07 01:13:22,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2021-12-07 01:13:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,025 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2021-12-07 01:13:22,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:22,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24174532] [2021-12-07 01:13:22,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24174532] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:13:22,025 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:13:22,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:13:22,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102404772] [2021-12-07 01:13:22,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:13:22,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:13:22,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:22,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:13:22,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:13:22,026 INFO L87 Difference]: Start difference. First operand 441 states and 579 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-07 01:13:22,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:22,257 INFO L93 Difference]: Finished difference Result 932 states and 1277 transitions. [2021-12-07 01:13:22,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:13:22,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 264 [2021-12-07 01:13:22,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:22,262 INFO L225 Difference]: With dead ends: 932 [2021-12-07 01:13:22,262 INFO L226 Difference]: Without dead ends: 695 [2021-12-07 01:13:22,263 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:13:22,264 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 217 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:22,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 617 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 01:13:22,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2021-12-07 01:13:22,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 533. [2021-12-07 01:13:22,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 444 states have (on average 1.3108108108108107) internal successors, (582), 447 states have internal predecessors, (582), 59 states have call successors, (59), 29 states have call predecessors, (59), 29 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2021-12-07 01:13:22,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 700 transitions. [2021-12-07 01:13:22,296 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 700 transitions. Word has length 264 [2021-12-07 01:13:22,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:22,297 INFO L470 AbstractCegarLoop]: Abstraction has 533 states and 700 transitions. [2021-12-07 01:13:22,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-07 01:13:22,297 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 700 transitions. [2021-12-07 01:13:22,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2021-12-07 01:13:22,298 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:22,299 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:13:22,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-07 01:13:22,299 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:22,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:22,299 INFO L85 PathProgramCache]: Analyzing trace with hash -378112666, now seen corresponding path program 1 times [2021-12-07 01:13:22,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:22,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429907250] [2021-12-07 01:13:22,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:22,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:13:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:13:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:13:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:13:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:13:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:13:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:13:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:13:22,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:13:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:13:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:13:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:13:22,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:13:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:13:22,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-07 01:13:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-07 01:13:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-07 01:13:22,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2021-12-07 01:13:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2021-12-07 01:13:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2021-12-07 01:13:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,407 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2021-12-07 01:13:22,407 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:22,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429907250] [2021-12-07 01:13:22,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429907250] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:13:22,407 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:13:22,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:13:22,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206293745] [2021-12-07 01:13:22,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:13:22,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:13:22,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:22,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:13:22,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:13:22,409 INFO L87 Difference]: Start difference. First operand 533 states and 700 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 3 states have internal predecessors, (87), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-07 01:13:22,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:22,645 INFO L93 Difference]: Finished difference Result 1127 states and 1536 transitions. [2021-12-07 01:13:22,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:13:22,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 3 states have internal predecessors, (87), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 265 [2021-12-07 01:13:22,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:22,650 INFO L225 Difference]: With dead ends: 1127 [2021-12-07 01:13:22,650 INFO L226 Difference]: Without dead ends: 833 [2021-12-07 01:13:22,651 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:13:22,652 INFO L933 BasicCegarLoop]: 298 mSDtfsCounter, 220 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:22,652 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 651 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 01:13:22,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2021-12-07 01:13:22,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 655. [2021-12-07 01:13:22,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 554 states have (on average 1.3212996389891696) internal successors, (732), 559 states have internal predecessors, (732), 65 states have call successors, (65), 35 states have call predecessors, (65), 35 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2021-12-07 01:13:22,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 862 transitions. [2021-12-07 01:13:22,679 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 862 transitions. Word has length 265 [2021-12-07 01:13:22,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:22,679 INFO L470 AbstractCegarLoop]: Abstraction has 655 states and 862 transitions. [2021-12-07 01:13:22,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 3 states have internal predecessors, (87), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-07 01:13:22,679 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 862 transitions. [2021-12-07 01:13:22,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2021-12-07 01:13:22,681 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:22,681 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:13:22,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-07 01:13:22,681 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:22,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:22,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1594763960, now seen corresponding path program 1 times [2021-12-07 01:13:22,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:22,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512259298] [2021-12-07 01:13:22,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:22,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:22,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:13:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:13:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:13:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:13:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:13:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:13:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:13:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:13:22,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:13:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:13:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:13:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:13:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:13:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:13:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-07 01:13:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-07 01:13:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-07 01:13:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-12-07 01:13:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2021-12-07 01:13:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2021-12-07 01:13:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,810 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 603 trivial. 0 not checked. [2021-12-07 01:13:22,810 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:22,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512259298] [2021-12-07 01:13:22,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512259298] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:13:22,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857078683] [2021-12-07 01:13:22,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:22,810 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:13:22,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:13:22,811 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:13:22,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-07 01:13:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:22,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 913 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-07 01:13:22,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:13:23,106 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2021-12-07 01:13:23,106 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:13:23,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857078683] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:13:23,107 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 01:13:23,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2021-12-07 01:13:23,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791645436] [2021-12-07 01:13:23,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:13:23,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:13:23,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:23,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:13:23,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-07 01:13:23,108 INFO L87 Difference]: Start difference. First operand 655 states and 862 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-07 01:13:23,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:23,173 INFO L93 Difference]: Finished difference Result 1045 states and 1410 transitions. [2021-12-07 01:13:23,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:13:23,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 266 [2021-12-07 01:13:23,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:23,178 INFO L225 Difference]: With dead ends: 1045 [2021-12-07 01:13:23,178 INFO L226 Difference]: Without dead ends: 655 [2021-12-07 01:13:23,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-07 01:13:23,180 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 51 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:23,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 687 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:13:23,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2021-12-07 01:13:23,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2021-12-07 01:13:23,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 554 states have (on average 1.3104693140794224) internal successors, (726), 559 states have internal predecessors, (726), 65 states have call successors, (65), 35 states have call predecessors, (65), 35 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2021-12-07 01:13:23,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 856 transitions. [2021-12-07 01:13:23,216 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 856 transitions. Word has length 266 [2021-12-07 01:13:23,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:23,217 INFO L470 AbstractCegarLoop]: Abstraction has 655 states and 856 transitions. [2021-12-07 01:13:23,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-07 01:13:23,217 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 856 transitions. [2021-12-07 01:13:23,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2021-12-07 01:13:23,220 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:23,220 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 3, 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] [2021-12-07 01:13:23,242 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-07 01:13:23,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-12-07 01:13:23,420 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:23,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:23,421 INFO L85 PathProgramCache]: Analyzing trace with hash 723082873, now seen corresponding path program 1 times [2021-12-07 01:13:23,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:23,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989852602] [2021-12-07 01:13:23,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:23,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:23,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:13:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:23,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:13:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:23,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:13:23,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:23,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:13:23,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:23,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:13:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:23,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:13:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:23,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:13:23,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:23,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:13:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:23,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:13:23,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:23,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:13:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:23,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:23,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:13:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:23,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:13:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:23,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:13:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:23,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:23,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:13:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:23,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-07 01:13:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:23,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-07 01:13:23,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:23,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-07 01:13:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:23,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-12-07 01:13:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:23,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-12-07 01:13:23,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:23,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2021-12-07 01:13:23,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:23,557 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 617 trivial. 0 not checked. [2021-12-07 01:13:23,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:23,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989852602] [2021-12-07 01:13:23,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989852602] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:13:23,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706031862] [2021-12-07 01:13:23,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:23,557 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:13:23,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:13:23,558 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:13:23,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-07 01:13:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:23,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 914 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-07 01:13:23,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:13:23,867 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2021-12-07 01:13:23,868 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:13:23,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706031862] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:13:23,868 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 01:13:23,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2021-12-07 01:13:23,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473775589] [2021-12-07 01:13:23,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:13:23,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:13:23,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:23,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:13:23,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-07 01:13:23,870 INFO L87 Difference]: Start difference. First operand 655 states and 856 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-07 01:13:23,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:23,924 INFO L93 Difference]: Finished difference Result 1045 states and 1396 transitions. [2021-12-07 01:13:23,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:13:23,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 267 [2021-12-07 01:13:23,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:23,930 INFO L225 Difference]: With dead ends: 1045 [2021-12-07 01:13:23,930 INFO L226 Difference]: Without dead ends: 667 [2021-12-07 01:13:23,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-07 01:13:23,932 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 15 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:23,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 710 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:13:23,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2021-12-07 01:13:23,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2021-12-07 01:13:23,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 564 states have (on average 1.3120567375886525) internal successors, (740), 569 states have internal predecessors, (740), 65 states have call successors, (65), 37 states have call predecessors, (65), 37 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2021-12-07 01:13:23,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 870 transitions. [2021-12-07 01:13:23,966 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 870 transitions. Word has length 267 [2021-12-07 01:13:23,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:23,967 INFO L470 AbstractCegarLoop]: Abstraction has 667 states and 870 transitions. [2021-12-07 01:13:23,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-07 01:13:23,967 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 870 transitions. [2021-12-07 01:13:23,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2021-12-07 01:13:23,969 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:23,969 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 3, 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] [2021-12-07 01:13:24,005 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-07 01:13:24,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-12-07 01:13:24,170 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:24,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:24,171 INFO L85 PathProgramCache]: Analyzing trace with hash -185468270, now seen corresponding path program 1 times [2021-12-07 01:13:24,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:24,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177453363] [2021-12-07 01:13:24,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:24,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:24,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:13:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:24,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:13:24,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:24,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:13:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:24,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:13:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:24,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:13:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:24,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:13:24,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:24,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:13:24,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:24,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:13:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:24,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:13:24,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:24,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:13:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:24,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:24,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:13:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:24,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:13:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:24,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:13:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:24,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:24,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:13:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:24,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-07 01:13:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:24,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-07 01:13:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:24,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-07 01:13:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:24,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-12-07 01:13:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:24,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-12-07 01:13:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:24,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-12-07 01:13:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:24,344 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2021-12-07 01:13:24,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:24,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177453363] [2021-12-07 01:13:24,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177453363] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:13:24,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815472295] [2021-12-07 01:13:24,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:24,344 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:13:24,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:13:24,345 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:13:24,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-07 01:13:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:24,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 915 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-07 01:13:24,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:13:24,718 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2021-12-07 01:13:24,719 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:13:24,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815472295] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:13:24,719 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 01:13:24,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 14 [2021-12-07 01:13:24,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006419039] [2021-12-07 01:13:24,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:13:24,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-07 01:13:24,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:24,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-07 01:13:24,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-12-07 01:13:24,721 INFO L87 Difference]: Start difference. First operand 667 states and 870 transitions. Second operand has 7 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2021-12-07 01:13:24,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:24,869 INFO L93 Difference]: Finished difference Result 1441 states and 2083 transitions. [2021-12-07 01:13:24,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-07 01:13:24,869 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 268 [2021-12-07 01:13:24,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:24,879 INFO L225 Difference]: With dead ends: 1441 [2021-12-07 01:13:24,879 INFO L226 Difference]: Without dead ends: 1439 [2021-12-07 01:13:24,880 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 311 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2021-12-07 01:13:24,881 INFO L933 BasicCegarLoop]: 507 mSDtfsCounter, 553 mSDsluCounter, 2300 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 2807 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:24,881 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [588 Valid, 2807 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:13:24,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2021-12-07 01:13:24,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 673. [2021-12-07 01:13:24,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 568 states have (on average 1.3098591549295775) internal successors, (744), 574 states have internal predecessors, (744), 66 states have call successors, (66), 38 states have call predecessors, (66), 38 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2021-12-07 01:13:24,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 876 transitions. [2021-12-07 01:13:24,930 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 876 transitions. Word has length 268 [2021-12-07 01:13:24,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:24,931 INFO L470 AbstractCegarLoop]: Abstraction has 673 states and 876 transitions. [2021-12-07 01:13:24,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2021-12-07 01:13:24,931 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 876 transitions. [2021-12-07 01:13:24,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2021-12-07 01:13:24,933 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:24,934 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 3, 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] [2021-12-07 01:13:24,955 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-07 01:13:25,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-12-07 01:13:25,135 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:25,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:25,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1915412215, now seen corresponding path program 1 times [2021-12-07 01:13:25,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:25,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655288800] [2021-12-07 01:13:25,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:25,135 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:25,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:13:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:25,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:13:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:25,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:13:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:25,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:13:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:25,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:13:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:25,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:13:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:25,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:13:25,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:25,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:13:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:25,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:13:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:25,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:13:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:25,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:25,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:13:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:25,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:13:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:25,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:13:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:25,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:25,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:13:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:25,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-07 01:13:25,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:25,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-07 01:13:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:25,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-07 01:13:25,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:25,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-12-07 01:13:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:25,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-12-07 01:13:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:25,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-12-07 01:13:25,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:25,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2021-12-07 01:13:25,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:25,332 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 142 proven. 27 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2021-12-07 01:13:25,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:25,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655288800] [2021-12-07 01:13:25,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655288800] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:13:25,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821567331] [2021-12-07 01:13:25,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:25,332 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:13:25,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:13:25,333 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:13:25,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-07 01:13:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:25,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-07 01:13:25,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:13:25,724 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 251 proven. 33 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2021-12-07 01:13:25,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:13:26,056 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 146 proven. 23 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2021-12-07 01:13:26,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821567331] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:13:26,056 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:13:26,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 19 [2021-12-07 01:13:26,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391656702] [2021-12-07 01:13:26,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:13:26,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-07 01:13:26,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:26,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-07 01:13:26,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-12-07 01:13:26,058 INFO L87 Difference]: Start difference. First operand 673 states and 876 transitions. Second operand has 19 states, 19 states have (on average 7.894736842105263) internal successors, (150), 14 states have internal predecessors, (150), 5 states have call successors, (28), 5 states have call predecessors, (28), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) [2021-12-07 01:13:27,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:27,070 INFO L93 Difference]: Finished difference Result 1913 states and 2671 transitions. [2021-12-07 01:13:27,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-07 01:13:27,070 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.894736842105263) internal successors, (150), 14 states have internal predecessors, (150), 5 states have call successors, (28), 5 states have call predecessors, (28), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) Word has length 276 [2021-12-07 01:13:27,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:27,077 INFO L225 Difference]: With dead ends: 1913 [2021-12-07 01:13:27,077 INFO L226 Difference]: Without dead ends: 1517 [2021-12-07 01:13:27,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 598 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=211, Invalid=1121, Unknown=0, NotChecked=0, Total=1332 [2021-12-07 01:13:27,079 INFO L933 BasicCegarLoop]: 382 mSDtfsCounter, 685 mSDsluCounter, 3272 mSDsCounter, 0 mSdLazyCounter, 1766 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 3654 SdHoareTripleChecker+Invalid, 1966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 1766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:27,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [733 Valid, 3654 Invalid, 1966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 1766 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-07 01:13:27,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2021-12-07 01:13:27,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 940. [2021-12-07 01:13:27,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 795 states have (on average 1.3018867924528301) internal successors, (1035), 802 states have internal predecessors, (1035), 90 states have call successors, (90), 51 states have call predecessors, (90), 54 states have return successors, (95), 90 states have call predecessors, (95), 90 states have call successors, (95) [2021-12-07 01:13:27,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1220 transitions. [2021-12-07 01:13:27,128 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1220 transitions. Word has length 276 [2021-12-07 01:13:27,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:27,128 INFO L470 AbstractCegarLoop]: Abstraction has 940 states and 1220 transitions. [2021-12-07 01:13:27,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.894736842105263) internal successors, (150), 14 states have internal predecessors, (150), 5 states have call successors, (28), 5 states have call predecessors, (28), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) [2021-12-07 01:13:27,129 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1220 transitions. [2021-12-07 01:13:27,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2021-12-07 01:13:27,131 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:27,131 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 3, 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] [2021-12-07 01:13:27,160 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-07 01:13:27,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:13:27,332 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:27,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:27,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1417941064, now seen corresponding path program 1 times [2021-12-07 01:13:27,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:27,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866595945] [2021-12-07 01:13:27,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:27,332 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:27,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:27,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:13:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:27,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:13:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:27,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:13:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:27,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:13:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:27,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:13:27,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:27,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:13:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:27,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:13:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:27,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:13:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:27,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:13:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:27,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:13:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:27,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:27,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:13:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:27,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:13:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:27,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:13:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:27,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:27,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:13:27,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:27,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-07 01:13:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:27,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-07 01:13:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:27,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-07 01:13:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:27,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-12-07 01:13:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:27,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-12-07 01:13:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:27,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-12-07 01:13:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:27,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2021-12-07 01:13:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:27,434 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2021-12-07 01:13:27,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:27,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866595945] [2021-12-07 01:13:27,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866595945] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:13:27,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833529337] [2021-12-07 01:13:27,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:27,435 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:13:27,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:13:27,436 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:13:27,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-07 01:13:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:27,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-07 01:13:27,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:13:27,739 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2021-12-07 01:13:27,739 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:13:27,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833529337] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:13:27,739 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 01:13:27,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-12-07 01:13:27,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309295944] [2021-12-07 01:13:27,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:13:27,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:13:27,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:27,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:13:27,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:13:27,741 INFO L87 Difference]: Start difference. First operand 940 states and 1220 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-07 01:13:27,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:27,787 INFO L93 Difference]: Finished difference Result 1743 states and 2304 transitions. [2021-12-07 01:13:27,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:13:27,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 276 [2021-12-07 01:13:27,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:27,794 INFO L225 Difference]: With dead ends: 1743 [2021-12-07 01:13:27,794 INFO L226 Difference]: Without dead ends: 924 [2021-12-07 01:13:27,796 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-07 01:13:27,796 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 11 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:27,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 710 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:13:27,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2021-12-07 01:13:27,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 924. [2021-12-07 01:13:27,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 784 states have (on average 1.2895408163265305) internal successors, (1011), 791 states have internal predecessors, (1011), 86 states have call successors, (86), 51 states have call predecessors, (86), 53 states have return successors, (90), 85 states have call predecessors, (90), 86 states have call successors, (90) [2021-12-07 01:13:27,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1187 transitions. [2021-12-07 01:13:27,839 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1187 transitions. Word has length 276 [2021-12-07 01:13:27,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:27,840 INFO L470 AbstractCegarLoop]: Abstraction has 924 states and 1187 transitions. [2021-12-07 01:13:27,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-07 01:13:27,840 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1187 transitions. [2021-12-07 01:13:27,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2021-12-07 01:13:27,843 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:27,843 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 3, 3, 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] [2021-12-07 01:13:27,865 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-07 01:13:28,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-12-07 01:13:28,044 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:28,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:28,044 INFO L85 PathProgramCache]: Analyzing trace with hash -818721709, now seen corresponding path program 1 times [2021-12-07 01:13:28,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:28,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173088048] [2021-12-07 01:13:28,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:28,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:13:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:13:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:13:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:13:28,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:13:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:13:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:13:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:13:28,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:13:28,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:13:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:13:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:13:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:13:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-07 01:13:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-07 01:13:28,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-12-07 01:13:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2021-12-07 01:13:28,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2021-12-07 01:13:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2021-12-07 01:13:28,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2021-12-07 01:13:28,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-12-07 01:13:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2021-12-07 01:13:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,158 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 121 proven. 19 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2021-12-07 01:13:28,158 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:28,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173088048] [2021-12-07 01:13:28,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173088048] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:13:28,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238253197] [2021-12-07 01:13:28,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:28,159 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:13:28,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:13:28,159 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:13:28,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-07 01:13:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-07 01:13:28,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:13:28,429 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2021-12-07 01:13:28,429 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:13:28,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238253197] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:13:28,429 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 01:13:28,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-12-07 01:13:28,430 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458524661] [2021-12-07 01:13:28,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:13:28,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:13:28,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:28,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:13:28,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:13:28,431 INFO L87 Difference]: Start difference. First operand 924 states and 1187 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-07 01:13:28,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:28,479 INFO L93 Difference]: Finished difference Result 1576 states and 2065 transitions. [2021-12-07 01:13:28,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:13:28,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 279 [2021-12-07 01:13:28,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:28,482 INFO L225 Difference]: With dead ends: 1576 [2021-12-07 01:13:28,482 INFO L226 Difference]: Without dead ends: 764 [2021-12-07 01:13:28,484 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-07 01:13:28,484 INFO L933 BasicCegarLoop]: 247 mSDtfsCounter, 8 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:28,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 713 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:13:28,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2021-12-07 01:13:28,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 764. [2021-12-07 01:13:28,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 642 states have (on average 1.2850467289719627) internal successors, (825), 649 states have internal predecessors, (825), 77 states have call successors, (77), 44 states have call predecessors, (77), 44 states have return successors, (77), 74 states have call predecessors, (77), 77 states have call successors, (77) [2021-12-07 01:13:28,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 979 transitions. [2021-12-07 01:13:28,510 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 979 transitions. Word has length 279 [2021-12-07 01:13:28,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:28,511 INFO L470 AbstractCegarLoop]: Abstraction has 764 states and 979 transitions. [2021-12-07 01:13:28,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-07 01:13:28,511 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 979 transitions. [2021-12-07 01:13:28,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2021-12-07 01:13:28,512 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:28,512 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 4, 4, 4, 4, 4, 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, 3, 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-07 01:13:28,546 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-12-07 01:13:28,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:13:28,714 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:28,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:28,714 INFO L85 PathProgramCache]: Analyzing trace with hash -2031857474, now seen corresponding path program 1 times [2021-12-07 01:13:28,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:28,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675001825] [2021-12-07 01:13:28,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:28,714 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:13:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:13:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:13:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:13:28,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:13:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:13:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:13:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:13:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:13:28,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:13:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:13:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:13:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:13:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:13:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-07 01:13:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-07 01:13:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-07 01:13:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-12-07 01:13:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-12-07 01:13:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-12-07 01:13:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2021-12-07 01:13:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2021-12-07 01:13:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2021-12-07 01:13:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:28,965 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2021-12-07 01:13:28,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:28,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675001825] [2021-12-07 01:13:28,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675001825] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:13:28,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024117532] [2021-12-07 01:13:28,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:28,966 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:13:28,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:13:28,967 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:13:28,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-07 01:13:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:29,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-07 01:13:29,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:13:29,324 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2021-12-07 01:13:29,324 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:13:29,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024117532] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:13:29,324 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 01:13:29,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2021-12-07 01:13:29,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765789343] [2021-12-07 01:13:29,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:13:29,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-07 01:13:29,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:29,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-07 01:13:29,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2021-12-07 01:13:29,326 INFO L87 Difference]: Start difference. First operand 764 states and 979 transitions. Second operand has 10 states, 10 states have (on average 11.0) internal successors, (110), 9 states have internal predecessors, (110), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2021-12-07 01:13:29,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:29,785 INFO L93 Difference]: Finished difference Result 2072 states and 2753 transitions. [2021-12-07 01:13:29,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-07 01:13:29,785 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 9 states have internal predecessors, (110), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 291 [2021-12-07 01:13:29,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:29,792 INFO L225 Difference]: With dead ends: 2072 [2021-12-07 01:13:29,792 INFO L226 Difference]: Without dead ends: 1672 [2021-12-07 01:13:29,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=1094, Unknown=0, NotChecked=0, Total=1260 [2021-12-07 01:13:29,793 INFO L933 BasicCegarLoop]: 401 mSDtfsCounter, 1216 mSDsluCounter, 2853 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1220 SdHoareTripleChecker+Valid, 3254 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:29,794 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1220 Valid, 3254 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-07 01:13:29,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2021-12-07 01:13:29,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 919. [2021-12-07 01:13:29,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 766 states have (on average 1.2845953002610966) internal successors, (984), 774 states have internal predecessors, (984), 98 states have call successors, (98), 54 states have call predecessors, (98), 54 states have return successors, (98), 94 states have call predecessors, (98), 98 states have call successors, (98) [2021-12-07 01:13:29,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1180 transitions. [2021-12-07 01:13:29,830 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1180 transitions. Word has length 291 [2021-12-07 01:13:29,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:29,831 INFO L470 AbstractCegarLoop]: Abstraction has 919 states and 1180 transitions. [2021-12-07 01:13:29,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 9 states have internal predecessors, (110), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2021-12-07 01:13:29,831 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1180 transitions. [2021-12-07 01:13:29,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2021-12-07 01:13:29,832 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:29,833 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:13:29,862 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-07 01:13:30,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2021-12-07 01:13:30,034 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:30,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:30,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1472400859, now seen corresponding path program 1 times [2021-12-07 01:13:30,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:30,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338229166] [2021-12-07 01:13:30,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:30,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:13:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:13:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:13:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:13:30,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:13:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:13:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:13:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:13:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:13:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:13:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:13:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:13:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:13:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:13:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-07 01:13:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-07 01:13:30,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-07 01:13:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-12-07 01:13:30,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-12-07 01:13:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-12-07 01:13:30,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2021-12-07 01:13:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2021-12-07 01:13:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-07 01:13:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,186 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2021-12-07 01:13:30,186 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:30,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338229166] [2021-12-07 01:13:30,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338229166] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:13:30,186 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:13:30,186 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-07 01:13:30,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346945923] [2021-12-07 01:13:30,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:13:30,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-07 01:13:30,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:30,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-07 01:13:30,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-07 01:13:30,188 INFO L87 Difference]: Start difference. First operand 919 states and 1180 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 6 states have internal predecessors, (101), 5 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2021-12-07 01:13:30,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:30,509 INFO L93 Difference]: Finished difference Result 2496 states and 3489 transitions. [2021-12-07 01:13:30,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 01:13:30,510 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 6 states have internal predecessors, (101), 5 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 297 [2021-12-07 01:13:30,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:30,521 INFO L225 Difference]: With dead ends: 2496 [2021-12-07 01:13:30,522 INFO L226 Difference]: Without dead ends: 1923 [2021-12-07 01:13:30,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-07 01:13:30,524 INFO L933 BasicCegarLoop]: 548 mSDtfsCounter, 494 mSDsluCounter, 1590 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 2138 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:30,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [548 Valid, 2138 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 01:13:30,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2021-12-07 01:13:30,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 974. [2021-12-07 01:13:30,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 809 states have (on average 1.2954264524103831) internal successors, (1048), 817 states have internal predecessors, (1048), 110 states have call successors, (110), 54 states have call predecessors, (110), 54 states have return successors, (110), 106 states have call predecessors, (110), 110 states have call successors, (110) [2021-12-07 01:13:30,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1268 transitions. [2021-12-07 01:13:30,587 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1268 transitions. Word has length 297 [2021-12-07 01:13:30,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:30,587 INFO L470 AbstractCegarLoop]: Abstraction has 974 states and 1268 transitions. [2021-12-07 01:13:30,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 6 states have internal predecessors, (101), 5 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2021-12-07 01:13:30,587 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1268 transitions. [2021-12-07 01:13:30,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2021-12-07 01:13:30,589 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:30,589 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:13:30,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-12-07 01:13:30,589 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:30,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:30,590 INFO L85 PathProgramCache]: Analyzing trace with hash -358014121, now seen corresponding path program 1 times [2021-12-07 01:13:30,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:30,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371419259] [2021-12-07 01:13:30,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:30,590 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:13:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:13:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:13:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:13:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:13:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:13:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:13:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:13:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:13:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:13:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:13:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:13:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:13:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:30,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:13:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-07 01:13:30,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-07 01:13:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-07 01:13:30,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-12-07 01:13:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-12-07 01:13:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-12-07 01:13:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2021-12-07 01:13:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2021-12-07 01:13:30,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-07 01:13:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,732 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2021-12-07 01:13:30,732 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:30,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371419259] [2021-12-07 01:13:30,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371419259] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:13:30,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72799943] [2021-12-07 01:13:30,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:30,733 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:13:30,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:13:30,733 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:13:30,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-07 01:13:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:30,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 997 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-07 01:13:30,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:13:31,136 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2021-12-07 01:13:31,136 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:13:31,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72799943] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:13:31,136 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 01:13:31,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 12 [2021-12-07 01:13:31,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315876398] [2021-12-07 01:13:31,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:13:31,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-07 01:13:31,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:31,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-07 01:13:31,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-12-07 01:13:31,137 INFO L87 Difference]: Start difference. First operand 974 states and 1268 transitions. Second operand has 10 states, 10 states have (on average 11.8) internal successors, (118), 9 states have internal predecessors, (118), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2021-12-07 01:13:31,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:31,825 INFO L93 Difference]: Finished difference Result 2479 states and 3355 transitions. [2021-12-07 01:13:31,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-07 01:13:31,826 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.8) internal successors, (118), 9 states have internal predecessors, (118), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 297 [2021-12-07 01:13:31,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:31,833 INFO L225 Difference]: With dead ends: 2479 [2021-12-07 01:13:31,833 INFO L226 Difference]: Without dead ends: 1852 [2021-12-07 01:13:31,834 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 343 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2021-12-07 01:13:31,835 INFO L933 BasicCegarLoop]: 519 mSDtfsCounter, 1368 mSDsluCounter, 2977 mSDsCounter, 0 mSdLazyCounter, 1130 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1382 SdHoareTripleChecker+Valid, 3496 SdHoareTripleChecker+Invalid, 1426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 1130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:31,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1382 Valid, 3496 Invalid, 1426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 1130 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-07 01:13:31,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2021-12-07 01:13:31,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 964. [2021-12-07 01:13:31,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 802 states have (on average 1.286783042394015) internal successors, (1032), 810 states have internal predecessors, (1032), 107 states have call successors, (107), 54 states have call predecessors, (107), 54 states have return successors, (107), 103 states have call predecessors, (107), 107 states have call successors, (107) [2021-12-07 01:13:31,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1246 transitions. [2021-12-07 01:13:31,906 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1246 transitions. Word has length 297 [2021-12-07 01:13:31,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:31,907 INFO L470 AbstractCegarLoop]: Abstraction has 964 states and 1246 transitions. [2021-12-07 01:13:31,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.8) internal successors, (118), 9 states have internal predecessors, (118), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2021-12-07 01:13:31,907 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1246 transitions. [2021-12-07 01:13:31,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2021-12-07 01:13:31,909 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:31,909 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:13:31,931 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-12-07 01:13:32,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-12-07 01:13:32,110 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:32,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:32,110 INFO L85 PathProgramCache]: Analyzing trace with hash 529040727, now seen corresponding path program 1 times [2021-12-07 01:13:32,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:32,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159438070] [2021-12-07 01:13:32,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:32,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:32,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:13:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:32,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:13:32,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:32,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:13:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:32,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:13:32,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:32,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:13:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:32,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:13:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:32,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:13:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:32,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:13:32,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:32,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:13:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:32,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:13:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:32,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:32,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:13:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:32,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:13:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:32,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:13:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:32,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:32,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:13:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:32,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-07 01:13:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:32,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-07 01:13:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:32,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-07 01:13:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:32,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-12-07 01:13:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:32,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-12-07 01:13:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:32,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-12-07 01:13:32,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:32,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2021-12-07 01:13:32,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:32,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2021-12-07 01:13:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:32,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-07 01:13:32,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:32,244 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2021-12-07 01:13:32,244 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:32,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159438070] [2021-12-07 01:13:32,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159438070] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:13:32,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119938153] [2021-12-07 01:13:32,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:32,245 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:13:32,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:13:32,245 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:13:32,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-07 01:13:32,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:32,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 997 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-07 01:13:32,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:13:32,623 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2021-12-07 01:13:32,623 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:13:32,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119938153] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:13:32,623 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 01:13:32,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2021-12-07 01:13:32,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463097302] [2021-12-07 01:13:32,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:13:32,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-07 01:13:32,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:32,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-07 01:13:32,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2021-12-07 01:13:32,624 INFO L87 Difference]: Start difference. First operand 964 states and 1246 transitions. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 9 states have internal predecessors, (114), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2021-12-07 01:13:33,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:33,285 INFO L93 Difference]: Finished difference Result 3176 states and 4307 transitions. [2021-12-07 01:13:33,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-07 01:13:33,286 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 9 states have internal predecessors, (114), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 297 [2021-12-07 01:13:33,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:33,299 INFO L225 Difference]: With dead ends: 3176 [2021-12-07 01:13:33,299 INFO L226 Difference]: Without dead ends: 2562 [2021-12-07 01:13:33,301 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=942, Unknown=0, NotChecked=0, Total=1122 [2021-12-07 01:13:33,301 INFO L933 BasicCegarLoop]: 555 mSDtfsCounter, 1316 mSDsluCounter, 3435 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1329 SdHoareTripleChecker+Valid, 3990 SdHoareTripleChecker+Invalid, 1585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:33,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1329 Valid, 3990 Invalid, 1585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-07 01:13:33,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2021-12-07 01:13:33,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 1345. [2021-12-07 01:13:33,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1345 states, 1107 states have (on average 1.2836495031616983) internal successors, (1421), 1119 states have internal predecessors, (1421), 163 states have call successors, (163), 74 states have call predecessors, (163), 74 states have return successors, (163), 155 states have call predecessors, (163), 163 states have call successors, (163) [2021-12-07 01:13:33,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1747 transitions. [2021-12-07 01:13:33,386 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1747 transitions. Word has length 297 [2021-12-07 01:13:33,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:33,386 INFO L470 AbstractCegarLoop]: Abstraction has 1345 states and 1747 transitions. [2021-12-07 01:13:33,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 9 states have internal predecessors, (114), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2021-12-07 01:13:33,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1747 transitions. [2021-12-07 01:13:33,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2021-12-07 01:13:33,389 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:33,390 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:13:33,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-07 01:13:33,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-12-07 01:13:33,591 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:33,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:33,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1597737013, now seen corresponding path program 1 times [2021-12-07 01:13:33,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:33,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121801119] [2021-12-07 01:13:33,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:33,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:33,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:13:33,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:33,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:13:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:33,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:13:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:33,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:13:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:33,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:13:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:33,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:13:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:33,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:13:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:33,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:13:33,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:33,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:13:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:33,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:13:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:33,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:33,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:33,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:13:33,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:33,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:13:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:33,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:13:33,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:33,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:33,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:13:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:33,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-07 01:13:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:33,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-07 01:13:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:33,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-07 01:13:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:33,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-12-07 01:13:33,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:33,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-12-07 01:13:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:33,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-12-07 01:13:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:33,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2021-12-07 01:13:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:33,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-12-07 01:13:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:33,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2021-12-07 01:13:33,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:33,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2021-12-07 01:13:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:33,739 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2021-12-07 01:13:33,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:33,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121801119] [2021-12-07 01:13:33,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121801119] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:13:33,739 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:13:33,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-07 01:13:33,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753117660] [2021-12-07 01:13:33,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:13:33,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:13:33,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:33,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:13:33,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:13:33,740 INFO L87 Difference]: Start difference. First operand 1345 states and 1747 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2021-12-07 01:13:34,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:34,104 INFO L93 Difference]: Finished difference Result 2402 states and 3143 transitions. [2021-12-07 01:13:34,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-07 01:13:34,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 311 [2021-12-07 01:13:34,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:34,113 INFO L225 Difference]: With dead ends: 2402 [2021-12-07 01:13:34,113 INFO L226 Difference]: Without dead ends: 1424 [2021-12-07 01:13:34,115 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:13:34,116 INFO L933 BasicCegarLoop]: 384 mSDtfsCounter, 500 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:34,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [520 Valid, 1000 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-07 01:13:34,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2021-12-07 01:13:34,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1151. [2021-12-07 01:13:34,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 956 states have (on average 1.2646443514644352) internal successors, (1209), 962 states have internal predecessors, (1209), 134 states have call successors, (134), 60 states have call predecessors, (134), 60 states have return successors, (134), 128 states have call predecessors, (134), 134 states have call successors, (134) [2021-12-07 01:13:34,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1477 transitions. [2021-12-07 01:13:34,178 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1477 transitions. Word has length 311 [2021-12-07 01:13:34,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:34,179 INFO L470 AbstractCegarLoop]: Abstraction has 1151 states and 1477 transitions. [2021-12-07 01:13:34,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2021-12-07 01:13:34,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1477 transitions. [2021-12-07 01:13:34,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2021-12-07 01:13:34,181 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:34,182 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 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, 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, 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] [2021-12-07 01:13:34,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-12-07 01:13:34,182 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:34,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:34,182 INFO L85 PathProgramCache]: Analyzing trace with hash 522126260, now seen corresponding path program 1 times [2021-12-07 01:13:34,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:34,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162843940] [2021-12-07 01:13:34,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:34,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:34,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:13:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:34,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:13:34,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:34,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:13:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:34,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:13:34,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:34,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:13:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:34,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:13:34,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:34,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:13:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:34,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:13:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:34,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:13:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:34,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:13:34,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:34,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:34,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:13:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:34,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:13:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:34,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:13:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:34,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:34,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:13:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:34,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-07 01:13:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:34,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-07 01:13:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:34,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-07 01:13:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:34,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-12-07 01:13:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:34,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-12-07 01:13:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:34,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-12-07 01:13:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:34,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2021-12-07 01:13:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:34,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-12-07 01:13:34,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:34,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-07 01:13:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:34,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2021-12-07 01:13:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:34,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2021-12-07 01:13:34,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:34,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2021-12-07 01:13:34,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:34,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2021-12-07 01:13:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:34,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2021-12-07 01:13:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:34,452 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 833 trivial. 0 not checked. [2021-12-07 01:13:34,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:34,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162843940] [2021-12-07 01:13:34,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162843940] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:13:34,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012158299] [2021-12-07 01:13:34,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:34,453 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:13:34,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:13:34,454 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:13:34,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-07 01:13:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:34,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 1279 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-07 01:13:34,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:13:34,919 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 151 proven. 33 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2021-12-07 01:13:34,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:13:35,288 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 49 proven. 2 refuted. 0 times theorem prover too weak. 829 trivial. 0 not checked. [2021-12-07 01:13:35,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012158299] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:13:35,289 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:13:35,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 9] total 29 [2021-12-07 01:13:35,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264381466] [2021-12-07 01:13:35,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:13:35,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-07 01:13:35,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:35,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-07 01:13:35,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2021-12-07 01:13:35,291 INFO L87 Difference]: Start difference. First operand 1151 states and 1477 transitions. Second operand has 29 states, 29 states have (on average 7.413793103448276) internal successors, (215), 24 states have internal predecessors, (215), 7 states have call successors, (45), 6 states have call predecessors, (45), 10 states have return successors, (46), 11 states have call predecessors, (46), 7 states have call successors, (46) [2021-12-07 01:13:50,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:50,136 INFO L93 Difference]: Finished difference Result 12771 states and 18354 transitions. [2021-12-07 01:13:50,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 316 states. [2021-12-07 01:13:50,137 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 7.413793103448276) internal successors, (215), 24 states have internal predecessors, (215), 7 states have call successors, (45), 6 states have call predecessors, (45), 10 states have return successors, (46), 11 states have call predecessors, (46), 7 states have call successors, (46) Word has length 350 [2021-12-07 01:13:50,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:50,183 INFO L225 Difference]: With dead ends: 12771 [2021-12-07 01:13:50,183 INFO L226 Difference]: Without dead ends: 11987 [2021-12-07 01:13:50,203 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1229 GetRequests, 889 SyntacticMatches, 1 SemanticMatches, 339 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47948 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7954, Invalid=107986, Unknown=0, NotChecked=0, Total=115940 [2021-12-07 01:13:50,204 INFO L933 BasicCegarLoop]: 986 mSDtfsCounter, 5253 mSDsluCounter, 15277 mSDsCounter, 0 mSdLazyCounter, 23047 mSolverCounterSat, 4331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5279 SdHoareTripleChecker+Valid, 16263 SdHoareTripleChecker+Invalid, 27378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4331 IncrementalHoareTripleChecker+Valid, 23047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:50,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5279 Valid, 16263 Invalid, 27378 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4331 Valid, 23047 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2021-12-07 01:13:50,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11987 states. [2021-12-07 01:13:50,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11987 to 2956. [2021-12-07 01:13:50,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2956 states, 2408 states have (on average 1.2786544850498338) internal successors, (3079), 2434 states have internal predecessors, (3079), 362 states have call successors, (362), 165 states have call predecessors, (362), 185 states have return successors, (388), 356 states have call predecessors, (388), 362 states have call successors, (388) [2021-12-07 01:13:50,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2956 states to 2956 states and 3829 transitions. [2021-12-07 01:13:50,548 INFO L78 Accepts]: Start accepts. Automaton has 2956 states and 3829 transitions. Word has length 350 [2021-12-07 01:13:50,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:50,548 INFO L470 AbstractCegarLoop]: Abstraction has 2956 states and 3829 transitions. [2021-12-07 01:13:50,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.413793103448276) internal successors, (215), 24 states have internal predecessors, (215), 7 states have call successors, (45), 6 states have call predecessors, (45), 10 states have return successors, (46), 11 states have call predecessors, (46), 7 states have call successors, (46) [2021-12-07 01:13:50,549 INFO L276 IsEmpty]: Start isEmpty. Operand 2956 states and 3829 transitions. [2021-12-07 01:13:50,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2021-12-07 01:13:50,555 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:50,556 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 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, 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] [2021-12-07 01:13:50,576 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-12-07 01:13:50,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-12-07 01:13:50,756 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:50,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:50,757 INFO L85 PathProgramCache]: Analyzing trace with hash -2072375083, now seen corresponding path program 1 times [2021-12-07 01:13:50,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:50,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979446836] [2021-12-07 01:13:50,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:50,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:50,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:13:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:50,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:13:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:50,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:13:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:50,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:13:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:50,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:13:50,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:50,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:13:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:50,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:13:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:50,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:13:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:50,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:13:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:50,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:13:50,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:50,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:50,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:13:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:50,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:13:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:50,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:13:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:50,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:50,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:50,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:13:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:50,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-07 01:13:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:50,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-07 01:13:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:50,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-07 01:13:50,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:50,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-12-07 01:13:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:50,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-12-07 01:13:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:50,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-12-07 01:13:50,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:50,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2021-12-07 01:13:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:50,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-12-07 01:13:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:50,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-07 01:13:50,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:50,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2021-12-07 01:13:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:50,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2021-12-07 01:13:50,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:50,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2021-12-07 01:13:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:50,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2021-12-07 01:13:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:50,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2021-12-07 01:13:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:50,885 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2021-12-07 01:13:50,885 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:50,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979446836] [2021-12-07 01:13:50,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979446836] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:13:50,885 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:13:50,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-07 01:13:50,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792225318] [2021-12-07 01:13:50,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:13:50,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 01:13:50,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:50,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 01:13:50,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-07 01:13:50,886 INFO L87 Difference]: Start difference. First operand 2956 states and 3829 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 5 states have internal predecessors, (107), 4 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2021-12-07 01:13:51,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:51,277 INFO L93 Difference]: Finished difference Result 5518 states and 7188 transitions. [2021-12-07 01:13:51,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 01:13:51,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 5 states have internal predecessors, (107), 4 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 350 [2021-12-07 01:13:51,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:51,284 INFO L225 Difference]: With dead ends: 5518 [2021-12-07 01:13:51,285 INFO L226 Difference]: Without dead ends: 2956 [2021-12-07 01:13:51,288 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:13:51,289 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 377 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:51,289 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [393 Valid, 467 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 01:13:51,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2021-12-07 01:13:51,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 2956. [2021-12-07 01:13:51,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2956 states, 2408 states have (on average 1.2774086378737541) internal successors, (3076), 2434 states have internal predecessors, (3076), 362 states have call successors, (362), 165 states have call predecessors, (362), 185 states have return successors, (388), 356 states have call predecessors, (388), 362 states have call successors, (388) [2021-12-07 01:13:51,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2956 states to 2956 states and 3826 transitions. [2021-12-07 01:13:51,490 INFO L78 Accepts]: Start accepts. Automaton has 2956 states and 3826 transitions. Word has length 350 [2021-12-07 01:13:51,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:51,491 INFO L470 AbstractCegarLoop]: Abstraction has 2956 states and 3826 transitions. [2021-12-07 01:13:51,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 5 states have internal predecessors, (107), 4 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2021-12-07 01:13:51,491 INFO L276 IsEmpty]: Start isEmpty. Operand 2956 states and 3826 transitions. [2021-12-07 01:13:51,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2021-12-07 01:13:51,496 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:51,496 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:13:51,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-12-07 01:13:51,496 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:51,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:51,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1816454027, now seen corresponding path program 1 times [2021-12-07 01:13:51,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:51,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546283534] [2021-12-07 01:13:51,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:51,497 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:51,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:13:51,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:51,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:13:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:51,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:13:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:51,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:13:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:51,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:13:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:51,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:13:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:51,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:13:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:51,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:13:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:51,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:13:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:51,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:13:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:51,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:51,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:13:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:51,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:13:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:51,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:13:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:51,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:51,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:13:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:51,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-07 01:13:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:51,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-07 01:13:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:51,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-07 01:13:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:51,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-12-07 01:13:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:51,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-12-07 01:13:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:51,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-12-07 01:13:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:51,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2021-12-07 01:13:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:51,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-12-07 01:13:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:51,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-07 01:13:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:51,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2021-12-07 01:13:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:51,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2021-12-07 01:13:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:51,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2021-12-07 01:13:51,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:51,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2021-12-07 01:13:51,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:51,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2021-12-07 01:13:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:51,588 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 854 trivial. 0 not checked. [2021-12-07 01:13:51,588 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:51,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546283534] [2021-12-07 01:13:51,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546283534] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:13:51,588 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:13:51,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:13:51,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000022764] [2021-12-07 01:13:51,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:13:51,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:13:51,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:51,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:13:51,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:13:51,590 INFO L87 Difference]: Start difference. First operand 2956 states and 3826 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-12-07 01:13:52,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:52,099 INFO L93 Difference]: Finished difference Result 7976 states and 10384 transitions. [2021-12-07 01:13:52,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:13:52,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 350 [2021-12-07 01:13:52,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:52,109 INFO L225 Difference]: With dead ends: 7976 [2021-12-07 01:13:52,109 INFO L226 Difference]: Without dead ends: 5394 [2021-12-07 01:13:52,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:13:52,113 INFO L933 BasicCegarLoop]: 304 mSDtfsCounter, 215 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:52,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 666 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 01:13:52,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5394 states. [2021-12-07 01:13:52,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5394 to 3346. [2021-12-07 01:13:52,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3346 states, 2798 states have (on average 1.2773409578270194) internal successors, (3574), 2824 states have internal predecessors, (3574), 362 states have call successors, (362), 165 states have call predecessors, (362), 185 states have return successors, (388), 356 states have call predecessors, (388), 362 states have call successors, (388) [2021-12-07 01:13:52,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3346 states to 3346 states and 4324 transitions. [2021-12-07 01:13:52,360 INFO L78 Accepts]: Start accepts. Automaton has 3346 states and 4324 transitions. Word has length 350 [2021-12-07 01:13:52,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:52,361 INFO L470 AbstractCegarLoop]: Abstraction has 3346 states and 4324 transitions. [2021-12-07 01:13:52,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-12-07 01:13:52,361 INFO L276 IsEmpty]: Start isEmpty. Operand 3346 states and 4324 transitions. [2021-12-07 01:13:52,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2021-12-07 01:13:52,366 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:52,366 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:13:52,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-12-07 01:13:52,367 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:52,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:52,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1483810889, now seen corresponding path program 1 times [2021-12-07 01:13:52,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:52,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367275656] [2021-12-07 01:13:52,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:52,367 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:52,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:13:52,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:52,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:13:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:52,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:13:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:52,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:13:52,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:52,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:13:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:52,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:13:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:52,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:13:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:52,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:13:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:52,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:13:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:52,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:13:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:52,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:52,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:13:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:52,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:13:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:52,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:13:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:52,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:52,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:13:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:52,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-07 01:13:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:52,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-07 01:13:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:52,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-07 01:13:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:52,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-12-07 01:13:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:52,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-12-07 01:13:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:52,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-12-07 01:13:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:52,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2021-12-07 01:13:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:52,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-12-07 01:13:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:52,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-07 01:13:52,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:52,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2021-12-07 01:13:52,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:52,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2021-12-07 01:13:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:52,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2021-12-07 01:13:52,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:52,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2021-12-07 01:13:52,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:52,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2021-12-07 01:13:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:52,470 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2021-12-07 01:13:52,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:52,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367275656] [2021-12-07 01:13:52,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367275656] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:13:52,471 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:13:52,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-07 01:13:52,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991094436] [2021-12-07 01:13:52,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:13:52,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:13:52,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:52,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:13:52,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:13:52,472 INFO L87 Difference]: Start difference. First operand 3346 states and 4324 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2021-12-07 01:13:52,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:52,835 INFO L93 Difference]: Finished difference Result 6737 states and 8695 transitions. [2021-12-07 01:13:52,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-07 01:13:52,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 350 [2021-12-07 01:13:52,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:52,850 INFO L225 Difference]: With dead ends: 6737 [2021-12-07 01:13:52,850 INFO L226 Difference]: Without dead ends: 3266 [2021-12-07 01:13:52,856 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:13:52,857 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 107 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:52,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 730 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:13:52,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2021-12-07 01:13:53,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 3266. [2021-12-07 01:13:53,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3266 states, 2738 states have (on average 1.2509130752373996) internal successors, (3425), 2764 states have internal predecessors, (3425), 362 states have call successors, (362), 165 states have call predecessors, (362), 165 states have return successors, (362), 336 states have call predecessors, (362), 362 states have call successors, (362) [2021-12-07 01:13:53,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 4149 transitions. [2021-12-07 01:13:53,128 INFO L78 Accepts]: Start accepts. Automaton has 3266 states and 4149 transitions. Word has length 350 [2021-12-07 01:13:53,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:53,128 INFO L470 AbstractCegarLoop]: Abstraction has 3266 states and 4149 transitions. [2021-12-07 01:13:53,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2021-12-07 01:13:53,128 INFO L276 IsEmpty]: Start isEmpty. Operand 3266 states and 4149 transitions. [2021-12-07 01:13:53,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2021-12-07 01:13:53,134 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:53,134 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:13:53,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-12-07 01:13:53,134 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:53,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:53,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1962062639, now seen corresponding path program 1 times [2021-12-07 01:13:53,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:53,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569096576] [2021-12-07 01:13:53,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:53,135 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:13:53,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:13:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:13:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:13:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:13:53,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:13:53,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:13:53,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:13:53,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:13:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:13:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:13:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:13:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:13:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:13:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-07 01:13:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-07 01:13:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-07 01:13:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-12-07 01:13:53,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-12-07 01:13:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-12-07 01:13:53,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2021-12-07 01:13:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-12-07 01:13:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-07 01:13:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2021-12-07 01:13:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2021-12-07 01:13:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2021-12-07 01:13:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2021-12-07 01:13:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2021-12-07 01:13:53,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2021-12-07 01:13:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,239 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 910 trivial. 0 not checked. [2021-12-07 01:13:53,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:53,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569096576] [2021-12-07 01:13:53,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569096576] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:13:53,239 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:13:53,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:13:53,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394557069] [2021-12-07 01:13:53,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:13:53,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:13:53,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:53,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:13:53,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:13:53,241 INFO L87 Difference]: Start difference. First operand 3266 states and 4149 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 2 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-12-07 01:13:53,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:13:53,607 INFO L93 Difference]: Finished difference Result 6124 states and 7812 transitions. [2021-12-07 01:13:53,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 01:13:53,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 2 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 360 [2021-12-07 01:13:53,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:13:53,614 INFO L225 Difference]: With dead ends: 6124 [2021-12-07 01:13:53,614 INFO L226 Difference]: Without dead ends: 3171 [2021-12-07 01:13:53,618 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:13:53,618 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 54 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:13:53,618 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 569 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:13:53,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3171 states. [2021-12-07 01:13:53,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3171 to 3171. [2021-12-07 01:13:53,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3171 states, 2643 states have (on average 1.2368520620507) internal successors, (3269), 2669 states have internal predecessors, (3269), 362 states have call successors, (362), 165 states have call predecessors, (362), 165 states have return successors, (362), 336 states have call predecessors, (362), 362 states have call successors, (362) [2021-12-07 01:13:53,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3171 states to 3171 states and 3993 transitions. [2021-12-07 01:13:53,843 INFO L78 Accepts]: Start accepts. Automaton has 3171 states and 3993 transitions. Word has length 360 [2021-12-07 01:13:53,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:13:53,843 INFO L470 AbstractCegarLoop]: Abstraction has 3171 states and 3993 transitions. [2021-12-07 01:13:53,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 2 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-12-07 01:13:53,843 INFO L276 IsEmpty]: Start isEmpty. Operand 3171 states and 3993 transitions. [2021-12-07 01:13:53,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2021-12-07 01:13:53,848 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:13:53,848 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 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, 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] [2021-12-07 01:13:53,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-12-07 01:13:53,848 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:13:53,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:13:53,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1339907605, now seen corresponding path program 1 times [2021-12-07 01:13:53,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:13:53,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509689940] [2021-12-07 01:13:53,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:53,849 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:13:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:13:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:13:53,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:13:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:13:53,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:13:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:13:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:13:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:13:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:13:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:13:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:13:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:13:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:13:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:13:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:13:53,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:53,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-07 01:13:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:54,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2021-12-07 01:13:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:54,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2021-12-07 01:13:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:54,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-12-07 01:13:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:54,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-12-07 01:13:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:54,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-12-07 01:13:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:54,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2021-12-07 01:13:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:54,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2021-12-07 01:13:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:54,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2021-12-07 01:13:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:54,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2021-12-07 01:13:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:54,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2021-12-07 01:13:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:54,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2021-12-07 01:13:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:54,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2021-12-07 01:13:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:54,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2021-12-07 01:13:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:54,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2021-12-07 01:13:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:54,033 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 890 trivial. 0 not checked. [2021-12-07 01:13:54,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:13:54,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509689940] [2021-12-07 01:13:54,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509689940] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:13:54,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924817907] [2021-12-07 01:13:54,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:13:54,034 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:13:54,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:13:54,034 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:13:54,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-07 01:13:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:13:54,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 1304 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-07 01:13:54,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:13:54,558 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 277 proven. 80 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2021-12-07 01:13:54,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:13:55,039 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 34 proven. 78 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2021-12-07 01:13:55,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924817907] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:13:55,039 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:13:55,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 33 [2021-12-07 01:13:55,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479346408] [2021-12-07 01:13:55,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:13:55,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-07 01:13:55,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:13:55,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-07 01:13:55,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=973, Unknown=0, NotChecked=0, Total=1056 [2021-12-07 01:13:55,041 INFO L87 Difference]: Start difference. First operand 3171 states and 3993 transitions. Second operand has 33 states, 33 states have (on average 8.424242424242424) internal successors, (278), 28 states have internal predecessors, (278), 8 states have call successors, (55), 9 states have call predecessors, (55), 14 states have return successors, (55), 12 states have call predecessors, (55), 8 states have call successors, (55) [2021-12-07 01:14:28,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:14:28,725 INFO L93 Difference]: Finished difference Result 37278 states and 50296 transitions. [2021-12-07 01:14:28,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 677 states. [2021-12-07 01:14:28,727 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 8.424242424242424) internal successors, (278), 28 states have internal predecessors, (278), 8 states have call successors, (55), 9 states have call predecessors, (55), 14 states have return successors, (55), 12 states have call predecessors, (55), 8 states have call successors, (55) Word has length 361 [2021-12-07 01:14:28,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:14:28,788 INFO L225 Difference]: With dead ends: 37278 [2021-12-07 01:14:28,788 INFO L226 Difference]: Without dead ends: 34508 [2021-12-07 01:14:28,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1488 GetRequests, 782 SyntacticMatches, 1 SemanticMatches, 705 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226139 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=34812, Invalid=464330, Unknown=0, NotChecked=0, Total=499142 [2021-12-07 01:14:28,821 INFO L933 BasicCegarLoop]: 2465 mSDtfsCounter, 5000 mSDsluCounter, 39308 mSDsCounter, 0 mSdLazyCounter, 40684 mSolverCounterSat, 7153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5000 SdHoareTripleChecker+Valid, 41773 SdHoareTripleChecker+Invalid, 47837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 7153 IncrementalHoareTripleChecker+Valid, 40684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2021-12-07 01:14:28,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5000 Valid, 41773 Invalid, 47837 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [7153 Valid, 40684 Invalid, 0 Unknown, 0 Unchecked, 14.6s Time] [2021-12-07 01:14:28,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34508 states. [2021-12-07 01:14:29,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34508 to 4836. [2021-12-07 01:14:29,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4836 states, 3870 states have (on average 1.2193798449612403) internal successors, (4719), 3918 states have internal predecessors, (4719), 681 states have call successors, (681), 284 states have call predecessors, (681), 284 states have return successors, (681), 633 states have call predecessors, (681), 681 states have call successors, (681) [2021-12-07 01:14:29,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4836 states to 4836 states and 6081 transitions. [2021-12-07 01:14:29,555 INFO L78 Accepts]: Start accepts. Automaton has 4836 states and 6081 transitions. Word has length 361 [2021-12-07 01:14:29,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:14:29,555 INFO L470 AbstractCegarLoop]: Abstraction has 4836 states and 6081 transitions. [2021-12-07 01:14:29,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 8.424242424242424) internal successors, (278), 28 states have internal predecessors, (278), 8 states have call successors, (55), 9 states have call predecessors, (55), 14 states have return successors, (55), 12 states have call predecessors, (55), 8 states have call successors, (55) [2021-12-07 01:14:29,555 INFO L276 IsEmpty]: Start isEmpty. Operand 4836 states and 6081 transitions. [2021-12-07 01:14:29,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2021-12-07 01:14:29,563 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:14:29,563 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 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, 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] [2021-12-07 01:14:29,583 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2021-12-07 01:14:29,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:14:29,764 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:14:29,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:14:29,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1214808755, now seen corresponding path program 1 times [2021-12-07 01:14:29,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:14:29,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586445134] [2021-12-07 01:14:29,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:14:29,767 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:14:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:29,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:14:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:29,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:14:29,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:29,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:14:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:29,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:14:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:29,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:14:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:29,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:14:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:29,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:14:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:29,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:14:29,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:29,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:14:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:29,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:14:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:29,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:14:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:29,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:14:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:29,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:14:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:29,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:14:29,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:29,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:14:29,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:29,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:14:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:29,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-07 01:14:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:29,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2021-12-07 01:14:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:29,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2021-12-07 01:14:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:29,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-12-07 01:14:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:29,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-12-07 01:14:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:29,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-12-07 01:14:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:29,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2021-12-07 01:14:29,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:29,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2021-12-07 01:14:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:29,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2021-12-07 01:14:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:29,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2021-12-07 01:14:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:29,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2021-12-07 01:14:29,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:29,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2021-12-07 01:14:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:29,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2021-12-07 01:14:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:29,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2021-12-07 01:14:29,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:29,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2021-12-07 01:14:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:29,939 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 929 trivial. 0 not checked. [2021-12-07 01:14:29,940 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:14:29,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586445134] [2021-12-07 01:14:29,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586445134] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:14:29,940 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:14:29,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-07 01:14:29,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471257451] [2021-12-07 01:14:29,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:14:29,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 01:14:29,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:14:29,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 01:14:29,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-07 01:14:29,941 INFO L87 Difference]: Start difference. First operand 4836 states and 6081 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 4 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2021-12-07 01:14:30,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:14:30,555 INFO L93 Difference]: Finished difference Result 9218 states and 11633 transitions. [2021-12-07 01:14:30,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 01:14:30,556 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 4 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 361 [2021-12-07 01:14:30,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:14:30,564 INFO L225 Difference]: With dead ends: 9218 [2021-12-07 01:14:30,564 INFO L226 Difference]: Without dead ends: 4840 [2021-12-07 01:14:30,571 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:14:30,571 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 366 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:14:30,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [382 Valid, 516 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 01:14:30,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4840 states. [2021-12-07 01:14:31,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4840 to 4828. [2021-12-07 01:14:31,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4828 states, 3862 states have (on average 1.2187985499741067) internal successors, (4707), 3910 states have internal predecessors, (4707), 681 states have call successors, (681), 284 states have call predecessors, (681), 284 states have return successors, (681), 633 states have call predecessors, (681), 681 states have call successors, (681) [2021-12-07 01:14:31,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4828 states to 4828 states and 6069 transitions. [2021-12-07 01:14:31,032 INFO L78 Accepts]: Start accepts. Automaton has 4828 states and 6069 transitions. Word has length 361 [2021-12-07 01:14:31,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:14:31,032 INFO L470 AbstractCegarLoop]: Abstraction has 4828 states and 6069 transitions. [2021-12-07 01:14:31,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 4 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2021-12-07 01:14:31,032 INFO L276 IsEmpty]: Start isEmpty. Operand 4828 states and 6069 transitions. [2021-12-07 01:14:31,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2021-12-07 01:14:31,039 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:14:31,040 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:14:31,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-12-07 01:14:31,040 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:14:31,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:14:31,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1734178564, now seen corresponding path program 1 times [2021-12-07 01:14:31,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:14:31,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125806654] [2021-12-07 01:14:31,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:14:31,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:14:31,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:31,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:14:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:31,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:14:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:31,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:14:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:31,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:14:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:31,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:14:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:31,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:14:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:31,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:14:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:31,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:14:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:31,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:14:31,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:31,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:14:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:31,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:14:31,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:31,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:14:31,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:31,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:14:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:31,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:14:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:31,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:14:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:31,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:14:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:31,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-07 01:14:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:31,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-07 01:14:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:31,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-07 01:14:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:31,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-12-07 01:14:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:31,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-12-07 01:14:31,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:31,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-12-07 01:14:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:31,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2021-12-07 01:14:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:31,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2021-12-07 01:14:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:31,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2021-12-07 01:14:31,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:31,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2021-12-07 01:14:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:31,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2021-12-07 01:14:31,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:31,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2021-12-07 01:14:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:31,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2021-12-07 01:14:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:31,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2021-12-07 01:14:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:31,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2021-12-07 01:14:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:31,294 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 890 trivial. 0 not checked. [2021-12-07 01:14:31,294 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:14:31,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125806654] [2021-12-07 01:14:31,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125806654] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:14:31,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916337093] [2021-12-07 01:14:31,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:14:31,295 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:14:31,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:14:31,295 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:14:31,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-07 01:14:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:14:31,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 1304 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-07 01:14:31,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:14:31,843 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 286 proven. 92 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2021-12-07 01:14:31,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:14:32,434 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 44 proven. 199 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2021-12-07 01:14:32,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916337093] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:14:32,435 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:14:32,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 18] total 41 [2021-12-07 01:14:32,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464951369] [2021-12-07 01:14:32,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:14:32,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-07 01:14:32,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:14:32,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-07 01:14:32,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1533, Unknown=0, NotChecked=0, Total=1640 [2021-12-07 01:14:32,437 INFO L87 Difference]: Start difference. First operand 4828 states and 6069 transitions. Second operand has 41 states, 40 states have (on average 7.7) internal successors, (308), 35 states have internal predecessors, (308), 12 states have call successors, (64), 10 states have call predecessors, (64), 12 states have return successors, (63), 13 states have call predecessors, (63), 11 states have call successors, (63) [2021-12-07 01:14:59,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:14:59,920 INFO L93 Difference]: Finished difference Result 51053 states and 69541 transitions. [2021-12-07 01:14:59,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 371 states. [2021-12-07 01:14:59,921 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 7.7) internal successors, (308), 35 states have internal predecessors, (308), 12 states have call successors, (64), 10 states have call predecessors, (64), 12 states have return successors, (63), 13 states have call predecessors, (63), 11 states have call successors, (63) Word has length 361 [2021-12-07 01:14:59,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:14:59,991 INFO L225 Difference]: With dead ends: 51053 [2021-12-07 01:14:59,991 INFO L226 Difference]: Without dead ends: 46743 [2021-12-07 01:15:00,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1179 GetRequests, 772 SyntacticMatches, 0 SemanticMatches, 407 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69568 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=12708, Invalid=154164, Unknown=0, NotChecked=0, Total=166872 [2021-12-07 01:15:00,010 INFO L933 BasicCegarLoop]: 1221 mSDtfsCounter, 4616 mSDsluCounter, 23620 mSDsCounter, 0 mSdLazyCounter, 25369 mSolverCounterSat, 2904 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4628 SdHoareTripleChecker+Valid, 24841 SdHoareTripleChecker+Invalid, 28273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2904 IncrementalHoareTripleChecker+Valid, 25369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:00,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4628 Valid, 24841 Invalid, 28273 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2904 Valid, 25369 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2021-12-07 01:15:00,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46743 states. [2021-12-07 01:15:00,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46743 to 6590. [2021-12-07 01:15:00,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6590 states, 5400 states have (on average 1.2092592592592593) internal successors, (6530), 5455 states have internal predecessors, (6530), 805 states have call successors, (805), 382 states have call predecessors, (805), 384 states have return successors, (809), 752 states have call predecessors, (809), 805 states have call successors, (809) [2021-12-07 01:15:00,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6590 states to 6590 states and 8144 transitions. [2021-12-07 01:15:01,004 INFO L78 Accepts]: Start accepts. Automaton has 6590 states and 8144 transitions. Word has length 361 [2021-12-07 01:15:01,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:01,004 INFO L470 AbstractCegarLoop]: Abstraction has 6590 states and 8144 transitions. [2021-12-07 01:15:01,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 7.7) internal successors, (308), 35 states have internal predecessors, (308), 12 states have call successors, (64), 10 states have call predecessors, (64), 12 states have return successors, (63), 13 states have call predecessors, (63), 11 states have call successors, (63) [2021-12-07 01:15:01,004 INFO L276 IsEmpty]: Start isEmpty. Operand 6590 states and 8144 transitions. [2021-12-07 01:15:01,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2021-12-07 01:15:01,014 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:01,015 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:15:01,035 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-07 01:15:01,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:15:01,216 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:15:01,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:01,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1157638044, now seen corresponding path program 1 times [2021-12-07 01:15:01,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:01,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449257622] [2021-12-07 01:15:01,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:01,218 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:01,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:15:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:01,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:15:01,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:01,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-07 01:15:01,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:01,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-07 01:15:01,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:01,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-07 01:15:01,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:01,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:15:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:01,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:15:01,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:01,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:15:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:01,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-07 01:15:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:01,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:15:01,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:01,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:15:01,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:01,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:15:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:01,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-07 01:15:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:01,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:15:01,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:01,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:15:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:01,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:15:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:01,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-12-07 01:15:01,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:01,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2021-12-07 01:15:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:01,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2021-12-07 01:15:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:01,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2021-12-07 01:15:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:01,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2021-12-07 01:15:01,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:01,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2021-12-07 01:15:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:01,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2021-12-07 01:15:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:01,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2021-12-07 01:15:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:01,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2021-12-07 01:15:01,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:01,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2021-12-07 01:15:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:01,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2021-12-07 01:15:01,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:01,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2021-12-07 01:15:01,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:01,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2021-12-07 01:15:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:01,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2021-12-07 01:15:01,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:01,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 349 [2021-12-07 01:15:01,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:01,337 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 9 proven. 136 refuted. 0 times theorem prover too weak. 798 trivial. 0 not checked. [2021-12-07 01:15:01,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:01,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449257622] [2021-12-07 01:15:01,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449257622] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:15:01,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428857049] [2021-12-07 01:15:01,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:01,337 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:15:01,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:15:01,338 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:15:01,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-07 01:15:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:01,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 1302 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-07 01:15:01,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:15:01,803 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 671 trivial. 0 not checked. [2021-12-07 01:15:01,803 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:15:01,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428857049] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:01,804 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 01:15:01,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2021-12-07 01:15:01,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107702504] [2021-12-07 01:15:01,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:01,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:15:01,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:01,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:15:01,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:15:01,805 INFO L87 Difference]: Start difference. First operand 6590 states and 8144 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2021-12-07 01:15:02,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:02,685 INFO L93 Difference]: Finished difference Result 12444 states and 15440 transitions. [2021-12-07 01:15:02,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:15:02,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 364 [2021-12-07 01:15:02,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:02,696 INFO L225 Difference]: With dead ends: 12444 [2021-12-07 01:15:02,696 INFO L226 Difference]: Without dead ends: 6653 [2021-12-07 01:15:02,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:15:02,705 INFO L933 BasicCegarLoop]: 245 mSDtfsCounter, 303 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:02,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [303 Valid, 428 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:15:02,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6653 states. [2021-12-07 01:15:03,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6653 to 6632. [2021-12-07 01:15:03,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6632 states, 5442 states have (on average 1.2050716648291069) internal successors, (6558), 5497 states have internal predecessors, (6558), 805 states have call successors, (805), 382 states have call predecessors, (805), 384 states have return successors, (809), 752 states have call predecessors, (809), 805 states have call successors, (809) [2021-12-07 01:15:03,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6632 states to 6632 states and 8172 transitions. [2021-12-07 01:15:03,453 INFO L78 Accepts]: Start accepts. Automaton has 6632 states and 8172 transitions. Word has length 364 [2021-12-07 01:15:03,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:03,453 INFO L470 AbstractCegarLoop]: Abstraction has 6632 states and 8172 transitions. [2021-12-07 01:15:03,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2021-12-07 01:15:03,453 INFO L276 IsEmpty]: Start isEmpty. Operand 6632 states and 8172 transitions. [2021-12-07 01:15:03,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2021-12-07 01:15:03,463 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:03,464 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 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, 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] [2021-12-07 01:15:03,484 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-12-07 01:15:03,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2021-12-07 01:15:03,665 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:15:03,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:03,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1253418756, now seen corresponding path program 1 times [2021-12-07 01:15:03,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:03,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243047841] [2021-12-07 01:15:03,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:03,667 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:03,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:15:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:03,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:15:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:03,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-07 01:15:03,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:03,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-07 01:15:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:03,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-07 01:15:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:03,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:15:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:03,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:15:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:03,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:15:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:03,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-07 01:15:03,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:03,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:15:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:03,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:15:03,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:03,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:15:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:03,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-07 01:15:03,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:03,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:15:03,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:03,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:15:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:03,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:15:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:03,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-12-07 01:15:03,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:03,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2021-12-07 01:15:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:03,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2021-12-07 01:15:03,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:03,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2021-12-07 01:15:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:03,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2021-12-07 01:15:03,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:03,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-12-07 01:15:03,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:03,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2021-12-07 01:15:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:03,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2021-12-07 01:15:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:03,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2021-12-07 01:15:03,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:03,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2021-12-07 01:15:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:03,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-12-07 01:15:03,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:03,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2021-12-07 01:15:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:03,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2021-12-07 01:15:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:03,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2021-12-07 01:15:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:03,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2021-12-07 01:15:03,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:03,777 INFO L134 CoverageAnalysis]: Checked inductivity of 949 backedges. 9 proven. 136 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2021-12-07 01:15:03,777 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:03,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243047841] [2021-12-07 01:15:03,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243047841] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:15:03,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403393117] [2021-12-07 01:15:03,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:03,777 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:15:03,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:15:03,778 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:15:03,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-07 01:15:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:03,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 1306 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-07 01:15:03,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:15:04,150 INFO L134 CoverageAnalysis]: Checked inductivity of 949 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2021-12-07 01:15:04,150 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:15:04,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403393117] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:04,150 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 01:15:04,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-12-07 01:15:04,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28985573] [2021-12-07 01:15:04,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:04,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:15:04,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:04,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:15:04,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:15:04,151 INFO L87 Difference]: Start difference. First operand 6632 states and 8172 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-07 01:15:04,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:04,852 INFO L93 Difference]: Finished difference Result 12716 states and 15709 transitions. [2021-12-07 01:15:04,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:15:04,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 365 [2021-12-07 01:15:04,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:04,861 INFO L225 Difference]: With dead ends: 12716 [2021-12-07 01:15:04,861 INFO L226 Difference]: Without dead ends: 6085 [2021-12-07 01:15:04,867 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 427 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-07 01:15:04,867 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 28 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:04,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 673 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:15:04,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6085 states. [2021-12-07 01:15:05,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6085 to 6085. [2021-12-07 01:15:05,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6085 states, 4978 states have (on average 1.2089192446765769) internal successors, (6018), 5028 states have internal predecessors, (6018), 756 states have call successors, (756), 350 states have call predecessors, (756), 350 states have return successors, (756), 706 states have call predecessors, (756), 756 states have call successors, (756) [2021-12-07 01:15:05,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6085 states to 6085 states and 7530 transitions. [2021-12-07 01:15:05,546 INFO L78 Accepts]: Start accepts. Automaton has 6085 states and 7530 transitions. Word has length 365 [2021-12-07 01:15:05,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:05,547 INFO L470 AbstractCegarLoop]: Abstraction has 6085 states and 7530 transitions. [2021-12-07 01:15:05,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-07 01:15:05,547 INFO L276 IsEmpty]: Start isEmpty. Operand 6085 states and 7530 transitions. [2021-12-07 01:15:05,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2021-12-07 01:15:05,556 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:05,556 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 12, 12, 9, 8, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 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, 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] [2021-12-07 01:15:05,576 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-12-07 01:15:05,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2021-12-07 01:15:05,757 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:15:05,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:05,759 INFO L85 PathProgramCache]: Analyzing trace with hash -867693373, now seen corresponding path program 1 times [2021-12-07 01:15:05,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:05,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760554600] [2021-12-07 01:15:05,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:05,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:05,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:05,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:15:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:05,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:15:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:05,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:15:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:05,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:15:05,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:05,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:15:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:05,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:15:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:05,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:15:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:05,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:15:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:05,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:15:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:05,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:15:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:05,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:15:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:05,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:15:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:05,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:15:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:05,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:15:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:05,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:15:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:05,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:15:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:05,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-07 01:15:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:05,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-07 01:15:05,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:05,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-07 01:15:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:05,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-12-07 01:15:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:05,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2021-12-07 01:15:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:05,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-12-07 01:15:05,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:05,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2021-12-07 01:15:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:05,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2021-12-07 01:15:05,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:05,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2021-12-07 01:15:05,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:05,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2021-12-07 01:15:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:05,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2021-12-07 01:15:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:05,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 322 [2021-12-07 01:15:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:05,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2021-12-07 01:15:05,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:05,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2021-12-07 01:15:05,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:05,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2021-12-07 01:15:05,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:05,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2021-12-07 01:15:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:05,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 16 proven. 34 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2021-12-07 01:15:05,980 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:05,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760554600] [2021-12-07 01:15:05,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760554600] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:15:05,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277323197] [2021-12-07 01:15:05,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:05,981 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:15:05,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:15:05,981 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:15:05,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-07 01:15:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:06,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 1331 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-07 01:15:06,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:15:07,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 482 proven. 210 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2021-12-07 01:15:07,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:15:07,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 112 proven. 194 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2021-12-07 01:15:07,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277323197] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:15:07,992 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:15:07,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 26, 21] total 55 [2021-12-07 01:15:07,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023463917] [2021-12-07 01:15:07,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:15:07,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-12-07 01:15:07,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:07,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-12-07 01:15:07,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=2761, Unknown=0, NotChecked=0, Total=2970 [2021-12-07 01:15:07,994 INFO L87 Difference]: Start difference. First operand 6085 states and 7530 transitions. Second operand has 55 states, 55 states have (on average 7.218181818181818) internal successors, (397), 47 states have internal predecessors, (397), 17 states have call successors, (68), 13 states have call predecessors, (68), 19 states have return successors, (71), 22 states have call predecessors, (71), 17 states have call successors, (71) [2021-12-07 01:15:43,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:43,516 INFO L93 Difference]: Finished difference Result 49444 states and 67208 transitions. [2021-12-07 01:15:43,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 371 states. [2021-12-07 01:15:43,517 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 7.218181818181818) internal successors, (397), 47 states have internal predecessors, (397), 17 states have call successors, (68), 13 states have call predecessors, (68), 19 states have return successors, (71), 22 states have call predecessors, (71), 17 states have call successors, (71) Word has length 372 [2021-12-07 01:15:43,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:43,579 INFO L225 Difference]: With dead ends: 49444 [2021-12-07 01:15:43,579 INFO L226 Difference]: Without dead ends: 43970 [2021-12-07 01:15:43,598 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1208 GetRequests, 788 SyntacticMatches, 0 SemanticMatches, 420 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70208 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=10011, Invalid=167651, Unknown=0, NotChecked=0, Total=177662 [2021-12-07 01:15:43,598 INFO L933 BasicCegarLoop]: 2196 mSDtfsCounter, 3988 mSDsluCounter, 52968 mSDsCounter, 0 mSdLazyCounter, 44628 mSolverCounterSat, 3508 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4016 SdHoareTripleChecker+Valid, 55164 SdHoareTripleChecker+Invalid, 48136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 3508 IncrementalHoareTripleChecker+Valid, 44628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.4s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:43,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4016 Valid, 55164 Invalid, 48136 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [3508 Valid, 44628 Invalid, 0 Unknown, 0 Unchecked, 17.4s Time] [2021-12-07 01:15:43,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43970 states. [2021-12-07 01:15:44,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43970 to 6103. [2021-12-07 01:15:44,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6103 states, 4995 states have (on average 1.2084084084084084) internal successors, (6036), 5045 states have internal predecessors, (6036), 756 states have call successors, (756), 351 states have call predecessors, (756), 351 states have return successors, (756), 706 states have call predecessors, (756), 756 states have call successors, (756) [2021-12-07 01:15:44,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6103 states to 6103 states and 7548 transitions. [2021-12-07 01:15:44,663 INFO L78 Accepts]: Start accepts. Automaton has 6103 states and 7548 transitions. Word has length 372 [2021-12-07 01:15:44,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:44,664 INFO L470 AbstractCegarLoop]: Abstraction has 6103 states and 7548 transitions. [2021-12-07 01:15:44,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 7.218181818181818) internal successors, (397), 47 states have internal predecessors, (397), 17 states have call successors, (68), 13 states have call predecessors, (68), 19 states have return successors, (71), 22 states have call predecessors, (71), 17 states have call successors, (71) [2021-12-07 01:15:44,664 INFO L276 IsEmpty]: Start isEmpty. Operand 6103 states and 7548 transitions. [2021-12-07 01:15:44,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2021-12-07 01:15:44,670 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:44,671 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2021-12-07 01:15:44,691 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2021-12-07 01:15:44,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:15:44,872 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:15:44,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:44,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1702339438, now seen corresponding path program 1 times [2021-12-07 01:15:44,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:44,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063399007] [2021-12-07 01:15:44,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:44,875 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:44,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:15:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:44,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:15:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:44,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:15:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:44,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:15:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:44,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:15:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:44,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:15:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:44,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:15:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:44,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:15:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:44,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:15:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:44,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:15:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:44,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:15:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:44,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:15:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:44,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:15:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:44,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:15:44,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:44,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:15:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:44,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:15:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:44,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-07 01:15:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:44,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-07 01:15:44,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:44,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-07 01:15:44,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:45,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-12-07 01:15:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:45,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2021-12-07 01:15:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:45,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-12-07 01:15:45,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:45,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2021-12-07 01:15:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:45,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2021-12-07 01:15:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:45,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2021-12-07 01:15:45,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:45,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2021-12-07 01:15:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:45,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2021-12-07 01:15:45,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:45,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-12-07 01:15:45,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:45,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2021-12-07 01:15:45,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:45,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2021-12-07 01:15:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:45,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2021-12-07 01:15:45,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:45,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2021-12-07 01:15:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:45,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2021-12-07 01:15:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:45,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1066 trivial. 0 not checked. [2021-12-07 01:15:45,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:45,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063399007] [2021-12-07 01:15:45,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063399007] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:45,024 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:15:45,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-07 01:15:45,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867382564] [2021-12-07 01:15:45,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:45,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 01:15:45,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:45,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 01:15:45,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-07 01:15:45,025 INFO L87 Difference]: Start difference. First operand 6103 states and 7548 transitions. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 5 states have internal predecessors, (117), 4 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2021-12-07 01:15:46,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:46,049 INFO L93 Difference]: Finished difference Result 11684 states and 14501 transitions. [2021-12-07 01:15:46,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 01:15:46,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 5 states have internal predecessors, (117), 4 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 383 [2021-12-07 01:15:46,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:46,058 INFO L225 Difference]: With dead ends: 11684 [2021-12-07 01:15:46,058 INFO L226 Difference]: Without dead ends: 6109 [2021-12-07 01:15:46,064 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:15:46,064 INFO L933 BasicCegarLoop]: 228 mSDtfsCounter, 359 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:46,064 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [375 Valid, 513 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 01:15:46,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6109 states. [2021-12-07 01:15:46,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6109 to 6091. [2021-12-07 01:15:46,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6091 states, 4983 states have (on average 1.2077062010836845) internal successors, (6018), 5033 states have internal predecessors, (6018), 756 states have call successors, (756), 351 states have call predecessors, (756), 351 states have return successors, (756), 706 states have call predecessors, (756), 756 states have call successors, (756) [2021-12-07 01:15:46,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6091 states to 6091 states and 7530 transitions. [2021-12-07 01:15:46,891 INFO L78 Accepts]: Start accepts. Automaton has 6091 states and 7530 transitions. Word has length 383 [2021-12-07 01:15:46,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:46,892 INFO L470 AbstractCegarLoop]: Abstraction has 6091 states and 7530 transitions. [2021-12-07 01:15:46,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 5 states have internal predecessors, (117), 4 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2021-12-07 01:15:46,892 INFO L276 IsEmpty]: Start isEmpty. Operand 6091 states and 7530 transitions. [2021-12-07 01:15:46,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2021-12-07 01:15:46,898 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:46,898 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2021-12-07 01:15:46,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-12-07 01:15:46,898 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:15:46,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:46,898 INFO L85 PathProgramCache]: Analyzing trace with hash 20866322, now seen corresponding path program 1 times [2021-12-07 01:15:46,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:46,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185330905] [2021-12-07 01:15:46,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:46,899 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:46,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:15:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:46,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:15:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:46,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:15:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:46,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:15:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:46,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:15:46,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:46,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:15:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:46,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:15:46,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:46,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:15:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:46,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:15:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:46,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:15:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:46,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:15:46,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:46,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:15:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:46,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:15:46,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:46,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:15:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:46,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:15:46,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:46,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:15:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:46,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-07 01:15:46,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:46,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-07 01:15:46,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:46,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-07 01:15:46,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:46,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-12-07 01:15:46,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:46,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2021-12-07 01:15:46,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:46,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-12-07 01:15:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:46,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2021-12-07 01:15:46,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:46,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2021-12-07 01:15:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:46,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2021-12-07 01:15:46,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:46,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2021-12-07 01:15:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:46,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2021-12-07 01:15:46,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:46,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-12-07 01:15:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:46,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2021-12-07 01:15:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:46,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2021-12-07 01:15:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:46,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2021-12-07 01:15:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:46,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2021-12-07 01:15:46,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:46,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2021-12-07 01:15:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:46,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2021-12-07 01:15:46,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:46,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185330905] [2021-12-07 01:15:46,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185330905] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:46,996 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:15:46,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:15:46,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122465607] [2021-12-07 01:15:46,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:46,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:15:46,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:46,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:15:46,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:15:46,997 INFO L87 Difference]: Start difference. First operand 6091 states and 7530 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-12-07 01:15:47,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:47,570 INFO L93 Difference]: Finished difference Result 8872 states and 10981 transitions. [2021-12-07 01:15:47,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 01:15:47,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 383 [2021-12-07 01:15:47,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:47,576 INFO L225 Difference]: With dead ends: 8872 [2021-12-07 01:15:47,576 INFO L226 Difference]: Without dead ends: 3302 [2021-12-07 01:15:47,581 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:15:47,581 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 51 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:47,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 563 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:15:47,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3302 states. [2021-12-07 01:15:48,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3302 to 3302. [2021-12-07 01:15:48,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3302 states, 2711 states have (on average 1.1940243452600516) internal successors, (3237), 2738 states have internal predecessors, (3237), 401 states have call successors, (401), 189 states have call predecessors, (401), 189 states have return successors, (401), 374 states have call predecessors, (401), 401 states have call successors, (401) [2021-12-07 01:15:48,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3302 states to 3302 states and 4039 transitions. [2021-12-07 01:15:48,020 INFO L78 Accepts]: Start accepts. Automaton has 3302 states and 4039 transitions. Word has length 383 [2021-12-07 01:15:48,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:48,020 INFO L470 AbstractCegarLoop]: Abstraction has 3302 states and 4039 transitions. [2021-12-07 01:15:48,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-12-07 01:15:48,020 INFO L276 IsEmpty]: Start isEmpty. Operand 3302 states and 4039 transitions. [2021-12-07 01:15:48,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2021-12-07 01:15:48,023 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:48,024 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:15:48,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-12-07 01:15:48,024 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:15:48,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:48,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1998056988, now seen corresponding path program 1 times [2021-12-07 01:15:48,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:48,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362752362] [2021-12-07 01:15:48,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:48,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:48,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:15:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:48,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:15:48,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:48,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:15:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:48,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:15:48,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:48,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:15:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:48,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:15:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:48,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:15:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:48,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:15:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:48,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:15:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:48,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:15:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:48,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:15:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:48,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:15:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:48,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:15:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:48,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:15:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:48,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:15:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:48,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:15:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:48,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-07 01:15:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:48,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-07 01:15:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:48,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-07 01:15:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:48,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-12-07 01:15:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:48,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2021-12-07 01:15:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:48,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-12-07 01:15:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:48,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2021-12-07 01:15:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:48,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2021-12-07 01:15:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:48,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2021-12-07 01:15:48,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:48,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2021-12-07 01:15:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:48,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2021-12-07 01:15:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:48,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-12-07 01:15:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:48,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2021-12-07 01:15:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:48,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2021-12-07 01:15:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:48,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2021-12-07 01:15:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:48,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2021-12-07 01:15:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:48,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2021-12-07 01:15:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:48,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 52 proven. 51 refuted. 0 times theorem prover too weak. 962 trivial. 0 not checked. [2021-12-07 01:15:48,268 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:48,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362752362] [2021-12-07 01:15:48,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362752362] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:15:48,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113618167] [2021-12-07 01:15:48,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:48,268 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:15:48,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:15:48,269 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:15:48,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-12-07 01:15:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:48,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 1356 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-07 01:15:48,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:15:49,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 542 proven. 221 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2021-12-07 01:15:49,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:15:50,069 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger: modulus not positive [2021-12-07 01:15:50,069 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-07 01:15:50,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2021-12-07 01:15:50,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116212820] [2021-12-07 01:15:50,069 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-07 01:15:50,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-07 01:15:50,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:50,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-07 01:15:50,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2366, Unknown=0, NotChecked=0, Total=2550 [2021-12-07 01:15:50,070 INFO L87 Difference]: Start difference. First operand 3302 states and 4039 transitions. Second operand has 15 states, 15 states have (on average 10.266666666666667) internal successors, (154), 12 states have internal predecessors, (154), 5 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (25), 6 states have call predecessors, (25), 4 states have call successors, (25) [2021-12-07 01:15:54,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:54,168 INFO L93 Difference]: Finished difference Result 15059 states and 18818 transitions. [2021-12-07 01:15:54,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-12-07 01:15:54,169 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 10.266666666666667) internal successors, (154), 12 states have internal predecessors, (154), 5 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (25), 6 states have call predecessors, (25), 4 states have call successors, (25) Word has length 383 [2021-12-07 01:15:54,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:54,185 INFO L225 Difference]: With dead ends: 15059 [2021-12-07 01:15:54,185 INFO L226 Difference]: Without dead ends: 12281 [2021-12-07 01:15:54,190 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 717 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1518 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=652, Invalid=7180, Unknown=0, NotChecked=0, Total=7832 [2021-12-07 01:15:54,190 INFO L933 BasicCegarLoop]: 449 mSDtfsCounter, 1239 mSDsluCounter, 3429 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1274 SdHoareTripleChecker+Valid, 3878 SdHoareTripleChecker+Invalid, 2736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 2334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:54,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1274 Valid, 3878 Invalid, 2736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 2334 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-07 01:15:54,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12281 states. [2021-12-07 01:15:54,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12281 to 4730. [2021-12-07 01:15:54,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4730 states, 3820 states have (on average 1.193717277486911) internal successors, (4560), 3864 states have internal predecessors, (4560), 623 states have call successors, (623), 286 states have call predecessors, (623), 286 states have return successors, (623), 579 states have call predecessors, (623), 623 states have call successors, (623) [2021-12-07 01:15:54,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4730 states to 4730 states and 5806 transitions. [2021-12-07 01:15:54,916 INFO L78 Accepts]: Start accepts. Automaton has 4730 states and 5806 transitions. Word has length 383 [2021-12-07 01:15:54,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:54,917 INFO L470 AbstractCegarLoop]: Abstraction has 4730 states and 5806 transitions. [2021-12-07 01:15:54,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.266666666666667) internal successors, (154), 12 states have internal predecessors, (154), 5 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (25), 6 states have call predecessors, (25), 4 states have call successors, (25) [2021-12-07 01:15:54,917 INFO L276 IsEmpty]: Start isEmpty. Operand 4730 states and 5806 transitions. [2021-12-07 01:15:54,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2021-12-07 01:15:54,922 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:54,922 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2021-12-07 01:15:54,942 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-12-07 01:15:55,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2021-12-07 01:15:55,124 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:15:55,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:55,125 INFO L85 PathProgramCache]: Analyzing trace with hash -103486524, now seen corresponding path program 1 times [2021-12-07 01:15:55,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:55,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294876636] [2021-12-07 01:15:55,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:55,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:55,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:15:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:55,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:15:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:55,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:15:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:55,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:15:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:55,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:15:55,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:55,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:15:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:55,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:15:55,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:55,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:15:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:55,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:15:55,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:55,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:15:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:55,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:15:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:55,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:15:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:55,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:15:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:55,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:15:55,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:55,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:15:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:55,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:15:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:55,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-07 01:15:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:55,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-07 01:15:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:55,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-07 01:15:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:55,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-12-07 01:15:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:55,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2021-12-07 01:15:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:55,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-12-07 01:15:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:55,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2021-12-07 01:15:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:55,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2021-12-07 01:15:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:55,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2021-12-07 01:15:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:55,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2021-12-07 01:15:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:55,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2021-12-07 01:15:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:55,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-12-07 01:15:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:55,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2021-12-07 01:15:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:55,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2021-12-07 01:15:55,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:55,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2021-12-07 01:15:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:55,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2021-12-07 01:15:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:55,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2021-12-07 01:15:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:55,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1068 backedges. 36 proven. 66 refuted. 0 times theorem prover too weak. 966 trivial. 0 not checked. [2021-12-07 01:15:55,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:55,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294876636] [2021-12-07 01:15:55,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294876636] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:15:55,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981996593] [2021-12-07 01:15:55,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:55,346 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:15:55,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:15:55,347 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:15:55,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-12-07 01:15:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:55,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 1357 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-07 01:15:55,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:15:56,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1068 backedges. 545 proven. 221 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2021-12-07 01:15:56,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:15:57,191 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger: modulus not positive [2021-12-07 01:15:57,191 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-07 01:15:57,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2021-12-07 01:15:57,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618284556] [2021-12-07 01:15:57,191 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-07 01:15:57,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-07 01:15:57,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:57,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-07 01:15:57,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2345, Unknown=0, NotChecked=0, Total=2550 [2021-12-07 01:15:57,192 INFO L87 Difference]: Start difference. First operand 4730 states and 5806 transitions. Second operand has 15 states, 15 states have (on average 10.066666666666666) internal successors, (151), 12 states have internal predecessors, (151), 5 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (25), 7 states have call predecessors, (25), 5 states have call successors, (25) [2021-12-07 01:15:59,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:59,621 INFO L93 Difference]: Finished difference Result 9021 states and 11127 transitions. [2021-12-07 01:15:59,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-12-07 01:15:59,621 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 10.066666666666666) internal successors, (151), 12 states have internal predecessors, (151), 5 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (25), 7 states have call predecessors, (25), 5 states have call successors, (25) Word has length 383 [2021-12-07 01:15:59,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:59,628 INFO L225 Difference]: With dead ends: 9021 [2021-12-07 01:15:59,628 INFO L226 Difference]: Without dead ends: 4878 [2021-12-07 01:15:59,633 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 782 GetRequests, 698 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1543 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=798, Invalid=6512, Unknown=0, NotChecked=0, Total=7310 [2021-12-07 01:15:59,633 INFO L933 BasicCegarLoop]: 640 mSDtfsCounter, 825 mSDsluCounter, 4294 mSDsCounter, 0 mSdLazyCounter, 2181 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 4934 SdHoareTripleChecker+Invalid, 2414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 2181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:59,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [855 Valid, 4934 Invalid, 2414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 2181 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-07 01:15:59,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4878 states. [2021-12-07 01:16:00,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4878 to 3651. [2021-12-07 01:16:00,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3651 states, 2981 states have (on average 1.1912110030191212) internal successors, (3551), 3013 states have internal predecessors, (3551), 443 states have call successors, (443), 226 states have call predecessors, (443), 226 states have return successors, (443), 411 states have call predecessors, (443), 443 states have call successors, (443) [2021-12-07 01:16:00,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3651 states to 3651 states and 4437 transitions. [2021-12-07 01:16:00,206 INFO L78 Accepts]: Start accepts. Automaton has 3651 states and 4437 transitions. Word has length 383 [2021-12-07 01:16:00,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:16:00,206 INFO L470 AbstractCegarLoop]: Abstraction has 3651 states and 4437 transitions. [2021-12-07 01:16:00,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.066666666666666) internal successors, (151), 12 states have internal predecessors, (151), 5 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (25), 7 states have call predecessors, (25), 5 states have call successors, (25) [2021-12-07 01:16:00,207 INFO L276 IsEmpty]: Start isEmpty. Operand 3651 states and 4437 transitions. [2021-12-07 01:16:00,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2021-12-07 01:16:00,210 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:16:00,211 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:16:00,231 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2021-12-07 01:16:00,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2021-12-07 01:16:00,412 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:16:00,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:16:00,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1809377308, now seen corresponding path program 1 times [2021-12-07 01:16:00,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:16:00,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240455373] [2021-12-07 01:16:00,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:16:00,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:16:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:00,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:16:00,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:00,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:16:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:00,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:16:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:00,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:16:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:00,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:16:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:00,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:16:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:00,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:16:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:00,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:16:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:00,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:16:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:00,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:16:00,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:00,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:16:00,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:00,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:16:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:00,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:16:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:00,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:16:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:00,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:16:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:00,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:16:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:00,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-07 01:16:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:00,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-07 01:16:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:00,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2021-12-07 01:16:00,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:00,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-12-07 01:16:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:00,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2021-12-07 01:16:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:00,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-12-07 01:16:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:00,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2021-12-07 01:16:00,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:00,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2021-12-07 01:16:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:00,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2021-12-07 01:16:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:00,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2021-12-07 01:16:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:00,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2021-12-07 01:16:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:00,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-12-07 01:16:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:00,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2021-12-07 01:16:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:00,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2021-12-07 01:16:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:00,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2021-12-07 01:16:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:00,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2021-12-07 01:16:00,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:00,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2021-12-07 01:16:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:00,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2021-12-07 01:16:00,671 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:16:00,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240455373] [2021-12-07 01:16:00,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240455373] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:16:00,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636493699] [2021-12-07 01:16:00,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:16:00,672 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:16:00,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:16:00,672 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:16:00,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-12-07 01:16:00,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:00,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 1356 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-07 01:16:00,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:16:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 542 proven. 221 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2021-12-07 01:16:01,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:16:02,451 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger: modulus not positive [2021-12-07 01:16:02,451 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-07 01:16:02,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2021-12-07 01:16:02,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024529248] [2021-12-07 01:16:02,451 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-07 01:16:02,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-07 01:16:02,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:16:02,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-07 01:16:02,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2569, Unknown=0, NotChecked=0, Total=2756 [2021-12-07 01:16:02,452 INFO L87 Difference]: Start difference. First operand 3651 states and 4437 transitions. Second operand has 17 states, 17 states have (on average 8.294117647058824) internal successors, (141), 15 states have internal predecessors, (141), 7 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (25), 8 states have call predecessors, (25), 7 states have call successors, (25) [2021-12-07 01:16:09,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:16:09,109 INFO L93 Difference]: Finished difference Result 16024 states and 20339 transitions. [2021-12-07 01:16:09,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-12-07 01:16:09,110 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.294117647058824) internal successors, (141), 15 states have internal predecessors, (141), 7 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (25), 8 states have call predecessors, (25), 7 states have call successors, (25) Word has length 383 [2021-12-07 01:16:09,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:16:09,127 INFO L225 Difference]: With dead ends: 16024 [2021-12-07 01:16:09,127 INFO L226 Difference]: Without dead ends: 12960 [2021-12-07 01:16:09,131 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 830 GetRequests, 703 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3767 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1591, Invalid=14921, Unknown=0, NotChecked=0, Total=16512 [2021-12-07 01:16:09,132 INFO L933 BasicCegarLoop]: 930 mSDtfsCounter, 1371 mSDsluCounter, 5894 mSDsCounter, 0 mSdLazyCounter, 6061 mSolverCounterSat, 649 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1386 SdHoareTripleChecker+Valid, 6824 SdHoareTripleChecker+Invalid, 6710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 649 IncrementalHoareTripleChecker+Valid, 6061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:16:09,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1386 Valid, 6824 Invalid, 6710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [649 Valid, 6061 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-12-07 01:16:09,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12960 states. [2021-12-07 01:16:09,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12960 to 3651. [2021-12-07 01:16:09,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3651 states, 2981 states have (on average 1.1912110030191212) internal successors, (3551), 3013 states have internal predecessors, (3551), 443 states have call successors, (443), 226 states have call predecessors, (443), 226 states have return successors, (443), 411 states have call predecessors, (443), 443 states have call successors, (443) [2021-12-07 01:16:09,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3651 states to 3651 states and 4437 transitions. [2021-12-07 01:16:09,775 INFO L78 Accepts]: Start accepts. Automaton has 3651 states and 4437 transitions. Word has length 383 [2021-12-07 01:16:09,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:16:09,776 INFO L470 AbstractCegarLoop]: Abstraction has 3651 states and 4437 transitions. [2021-12-07 01:16:09,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.294117647058824) internal successors, (141), 15 states have internal predecessors, (141), 7 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (25), 8 states have call predecessors, (25), 7 states have call successors, (25) [2021-12-07 01:16:09,776 INFO L276 IsEmpty]: Start isEmpty. Operand 3651 states and 4437 transitions. [2021-12-07 01:16:09,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2021-12-07 01:16:09,780 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:16:09,780 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:16:09,800 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2021-12-07 01:16:09,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:16:09,981 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:16:09,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:16:09,982 INFO L85 PathProgramCache]: Analyzing trace with hash 872240243, now seen corresponding path program 1 times [2021-12-07 01:16:09,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:16:09,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606954785] [2021-12-07 01:16:09,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:16:09,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:16:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:10,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:16:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:10,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:16:10,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:10,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:16:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:10,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:16:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:10,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:16:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:10,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:16:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:10,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:16:10,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:10,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:16:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:10,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:16:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:10,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:16:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:10,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:16:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:10,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:16:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:10,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:16:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:10,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:16:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:10,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:16:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:10,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:16:10,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:10,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-07 01:16:10,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:10,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-07 01:16:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:10,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-07 01:16:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:10,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2021-12-07 01:16:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:10,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2021-12-07 01:16:10,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:10,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2021-12-07 01:16:10,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:10,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2021-12-07 01:16:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:10,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2021-12-07 01:16:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:10,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2021-12-07 01:16:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:10,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2021-12-07 01:16:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:10,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2021-12-07 01:16:10,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:10,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2021-12-07 01:16:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:10,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2021-12-07 01:16:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:10,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2021-12-07 01:16:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:10,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2021-12-07 01:16:10,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:10,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2021-12-07 01:16:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:10,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2021-12-07 01:16:10,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:10,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2021-12-07 01:16:10,199 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:16:10,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606954785] [2021-12-07 01:16:10,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606954785] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:16:10,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632344433] [2021-12-07 01:16:10,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:16:10,199 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:16:10,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:16:10,200 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:16:10,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-12-07 01:16:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:10,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 1357 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-07 01:16:10,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:16:11,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 542 proven. 221 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2021-12-07 01:16:11,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:16:12,009 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger: modulus not positive [2021-12-07 01:16:12,009 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-07 01:16:12,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2021-12-07 01:16:12,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185844936] [2021-12-07 01:16:12,009 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-07 01:16:12,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-07 01:16:12,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:16:12,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-07 01:16:12,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2569, Unknown=0, NotChecked=0, Total=2756 [2021-12-07 01:16:12,010 INFO L87 Difference]: Start difference. First operand 3651 states and 4437 transitions. Second operand has 17 states, 17 states have (on average 8.352941176470589) internal successors, (142), 15 states have internal predecessors, (142), 7 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (25), 8 states have call predecessors, (25), 7 states have call successors, (25) [2021-12-07 01:16:18,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:16:18,851 INFO L93 Difference]: Finished difference Result 15966 states and 20281 transitions. [2021-12-07 01:16:18,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-12-07 01:16:18,852 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.352941176470589) internal successors, (142), 15 states have internal predecessors, (142), 7 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (25), 8 states have call predecessors, (25), 7 states have call successors, (25) Word has length 384 [2021-12-07 01:16:18,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:16:18,868 INFO L225 Difference]: With dead ends: 15966 [2021-12-07 01:16:18,868 INFO L226 Difference]: Without dead ends: 12902 [2021-12-07 01:16:18,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 832 GetRequests, 705 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3766 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1591, Invalid=14921, Unknown=0, NotChecked=0, Total=16512 [2021-12-07 01:16:18,873 INFO L933 BasicCegarLoop]: 930 mSDtfsCounter, 1370 mSDsluCounter, 5894 mSDsCounter, 0 mSdLazyCounter, 6061 mSolverCounterSat, 698 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1385 SdHoareTripleChecker+Valid, 6824 SdHoareTripleChecker+Invalid, 6759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 698 IncrementalHoareTripleChecker+Valid, 6061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-12-07 01:16:18,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1385 Valid, 6824 Invalid, 6759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [698 Valid, 6061 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-12-07 01:16:18,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12902 states. [2021-12-07 01:16:19,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12902 to 3641. [2021-12-07 01:16:19,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3641 states, 2971 states have (on average 1.1918545944126557) internal successors, (3541), 3003 states have internal predecessors, (3541), 443 states have call successors, (443), 226 states have call predecessors, (443), 226 states have return successors, (443), 411 states have call predecessors, (443), 443 states have call successors, (443) [2021-12-07 01:16:19,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3641 states to 3641 states and 4427 transitions. [2021-12-07 01:16:19,526 INFO L78 Accepts]: Start accepts. Automaton has 3641 states and 4427 transitions. Word has length 384 [2021-12-07 01:16:19,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:16:19,526 INFO L470 AbstractCegarLoop]: Abstraction has 3641 states and 4427 transitions. [2021-12-07 01:16:19,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.352941176470589) internal successors, (142), 15 states have internal predecessors, (142), 7 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (25), 8 states have call predecessors, (25), 7 states have call successors, (25) [2021-12-07 01:16:19,527 INFO L276 IsEmpty]: Start isEmpty. Operand 3641 states and 4427 transitions. [2021-12-07 01:16:19,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2021-12-07 01:16:19,533 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:16:19,534 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:16:19,554 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2021-12-07 01:16:19,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:16:19,735 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:16:19,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:16:19,736 INFO L85 PathProgramCache]: Analyzing trace with hash 962300533, now seen corresponding path program 1 times [2021-12-07 01:16:19,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:16:19,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675661813] [2021-12-07 01:16:19,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:16:19,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:16:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:19,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:16:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:19,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:16:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:19,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:16:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:19,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:16:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:19,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:16:19,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:19,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:16:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:19,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:16:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:19,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:16:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:19,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:16:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:19,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:16:19,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:19,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:16:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:19,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:16:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:19,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:16:19,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:19,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:16:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:19,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:16:19,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:19,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:16:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:19,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-07 01:16:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:19,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-07 01:16:19,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:19,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-12-07 01:16:19,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:19,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2021-12-07 01:16:19,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:19,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2021-12-07 01:16:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:19,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2021-12-07 01:16:19,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:19,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2021-12-07 01:16:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:19,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2021-12-07 01:16:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:19,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2021-12-07 01:16:19,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:19,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2021-12-07 01:16:19,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:19,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2021-12-07 01:16:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:19,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2021-12-07 01:16:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:19,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2021-12-07 01:16:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:19,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2021-12-07 01:16:19,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:19,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2021-12-07 01:16:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:19,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2021-12-07 01:16:19,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:19,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2021-12-07 01:16:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:19,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1057 trivial. 0 not checked. [2021-12-07 01:16:19,860 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:16:19,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675661813] [2021-12-07 01:16:19,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675661813] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:16:19,860 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:16:19,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:16:19,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599906693] [2021-12-07 01:16:19,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:16:19,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:16:19,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:16:19,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:16:19,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:16:19,861 INFO L87 Difference]: Start difference. First operand 3641 states and 4427 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-12-07 01:16:20,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:16:20,409 INFO L93 Difference]: Finished difference Result 5769 states and 7045 transitions. [2021-12-07 01:16:20,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 01:16:20,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 384 [2021-12-07 01:16:20,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:16:20,413 INFO L225 Difference]: With dead ends: 5769 [2021-12-07 01:16:20,413 INFO L226 Difference]: Without dead ends: 2454 [2021-12-07 01:16:20,415 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:16:20,416 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 51 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:16:20,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 551 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:16:20,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2454 states. [2021-12-07 01:16:20,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2454 to 2454. [2021-12-07 01:16:20,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2454 states, 1994 states have (on average 1.1840521564694082) internal successors, (2361), 2015 states have internal predecessors, (2361), 307 states have call successors, (307), 152 states have call predecessors, (307), 152 states have return successors, (307), 286 states have call predecessors, (307), 307 states have call successors, (307) [2021-12-07 01:16:20,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2454 states to 2454 states and 2975 transitions. [2021-12-07 01:16:20,864 INFO L78 Accepts]: Start accepts. Automaton has 2454 states and 2975 transitions. Word has length 384 [2021-12-07 01:16:20,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:16:20,864 INFO L470 AbstractCegarLoop]: Abstraction has 2454 states and 2975 transitions. [2021-12-07 01:16:20,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-12-07 01:16:20,864 INFO L276 IsEmpty]: Start isEmpty. Operand 2454 states and 2975 transitions. [2021-12-07 01:16:20,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2021-12-07 01:16:20,868 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:16:20,868 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 10, 9, 8, 8, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:16:20,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-12-07 01:16:20,868 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:16:20,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:16:20,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1519421243, now seen corresponding path program 1 times [2021-12-07 01:16:20,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:16:20,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255776187] [2021-12-07 01:16:20,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:16:20,869 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:16:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:20,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:16:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:20,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:16:20,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:20,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:16:20,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:20,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:16:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:20,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:16:20,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:20,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:16:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:20,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:16:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:20,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:16:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:20,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:16:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:20,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:16:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:20,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:16:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:20,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:16:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:20,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:16:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:20,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:16:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:20,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:16:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:20,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:16:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:20,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-07 01:16:20,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:20,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-07 01:16:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:20,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-07 01:16:20,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:20,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-12-07 01:16:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:20,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-12-07 01:16:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:20,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2021-12-07 01:16:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:20,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2021-12-07 01:16:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:20,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2021-12-07 01:16:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:20,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2021-12-07 01:16:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:20,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2021-12-07 01:16:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:20,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2021-12-07 01:16:20,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:20,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2021-12-07 01:16:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:20,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2021-12-07 01:16:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:20,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2021-12-07 01:16:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:20,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2021-12-07 01:16:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:20,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2021-12-07 01:16:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:20,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2021-12-07 01:16:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:20,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-12-07 01:16:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:20,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1060 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 1023 trivial. 0 not checked. [2021-12-07 01:16:20,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:16:20,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255776187] [2021-12-07 01:16:20,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255776187] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:16:20,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717154876] [2021-12-07 01:16:20,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:16:20,987 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:16:20,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:16:20,987 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:16:20,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-12-07 01:16:21,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:21,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 1380 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-07 01:16:21,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:16:21,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1060 backedges. 127 proven. 307 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2021-12-07 01:16:21,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:16:21,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1060 backedges. 17 proven. 33 refuted. 0 times theorem prover too weak. 1010 trivial. 0 not checked. [2021-12-07 01:16:21,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717154876] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:16:21,778 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:16:21,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12] total 20 [2021-12-07 01:16:21,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963047985] [2021-12-07 01:16:21,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:16:21,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-07 01:16:21,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:16:21,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-07 01:16:21,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2021-12-07 01:16:21,780 INFO L87 Difference]: Start difference. First operand 2454 states and 2975 transitions. Second operand has 20 states, 20 states have (on average 15.3) internal successors, (306), 17 states have internal predecessors, (306), 7 states have call successors, (70), 7 states have call predecessors, (70), 9 states have return successors, (69), 9 states have call predecessors, (69), 7 states have call successors, (69) [2021-12-07 01:16:27,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:16:27,818 INFO L93 Difference]: Finished difference Result 12366 states and 15752 transitions. [2021-12-07 01:16:27,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2021-12-07 01:16:27,819 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 15.3) internal successors, (306), 17 states have internal predecessors, (306), 7 states have call successors, (70), 7 states have call predecessors, (70), 9 states have return successors, (69), 9 states have call predecessors, (69), 7 states have call successors, (69) Word has length 389 [2021-12-07 01:16:27,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:16:27,831 INFO L225 Difference]: With dead ends: 12366 [2021-12-07 01:16:27,831 INFO L226 Difference]: Without dead ends: 10378 [2021-12-07 01:16:27,834 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 994 GetRequests, 881 SyntacticMatches, 1 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4336 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1160, Invalid=11722, Unknown=0, NotChecked=0, Total=12882 [2021-12-07 01:16:27,835 INFO L933 BasicCegarLoop]: 592 mSDtfsCounter, 2989 mSDsluCounter, 7297 mSDsCounter, 0 mSdLazyCounter, 5645 mSolverCounterSat, 1097 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3000 SdHoareTripleChecker+Valid, 7889 SdHoareTripleChecker+Invalid, 6742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1097 IncrementalHoareTripleChecker+Valid, 5645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-12-07 01:16:27,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3000 Valid, 7889 Invalid, 6742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1097 Valid, 5645 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-12-07 01:16:27,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10378 states. [2021-12-07 01:16:28,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10378 to 4023. [2021-12-07 01:16:28,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4023 states, 3302 states have (on average 1.1783767413688673) internal successors, (3891), 3332 states have internal predecessors, (3891), 469 states have call successors, (469), 251 states have call predecessors, (469), 251 states have return successors, (469), 439 states have call predecessors, (469), 469 states have call successors, (469) [2021-12-07 01:16:28,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4023 states to 4023 states and 4829 transitions. [2021-12-07 01:16:28,735 INFO L78 Accepts]: Start accepts. Automaton has 4023 states and 4829 transitions. Word has length 389 [2021-12-07 01:16:28,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:16:28,735 INFO L470 AbstractCegarLoop]: Abstraction has 4023 states and 4829 transitions. [2021-12-07 01:16:28,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 15.3) internal successors, (306), 17 states have internal predecessors, (306), 7 states have call successors, (70), 7 states have call predecessors, (70), 9 states have return successors, (69), 9 states have call predecessors, (69), 7 states have call successors, (69) [2021-12-07 01:16:28,736 INFO L276 IsEmpty]: Start isEmpty. Operand 4023 states and 4829 transitions. [2021-12-07 01:16:28,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2021-12-07 01:16:28,739 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:16:28,739 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 10, 9, 8, 8, 8, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 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] [2021-12-07 01:16:28,759 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2021-12-07 01:16:28,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:16:28,941 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:16:28,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:16:28,942 INFO L85 PathProgramCache]: Analyzing trace with hash 49162586, now seen corresponding path program 1 times [2021-12-07 01:16:28,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:16:28,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653000827] [2021-12-07 01:16:28,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:16:28,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:16:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:29,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:16:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:29,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:16:29,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:29,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:16:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:29,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:16:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:29,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:16:29,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:29,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:16:29,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:29,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:16:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:29,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:16:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:29,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:16:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:29,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:16:29,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:29,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:16:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:29,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:16:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:29,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:16:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:29,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:16:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:29,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:16:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:29,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:16:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:29,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-07 01:16:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:29,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-07 01:16:29,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:29,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-12-07 01:16:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:29,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-12-07 01:16:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:29,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-12-07 01:16:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:29,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-12-07 01:16:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:29,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2021-12-07 01:16:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:29,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2021-12-07 01:16:29,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:29,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2021-12-07 01:16:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:29,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2021-12-07 01:16:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:29,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2021-12-07 01:16:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:29,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 313 [2021-12-07 01:16:29,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:29,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2021-12-07 01:16:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:29,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2021-12-07 01:16:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:29,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2021-12-07 01:16:29,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:29,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2021-12-07 01:16:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:29,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2021-12-07 01:16:29,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:29,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2021-12-07 01:16:29,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:29,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1119 backedges. 29 proven. 4 refuted. 0 times theorem prover too weak. 1086 trivial. 0 not checked. [2021-12-07 01:16:29,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:16:29,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653000827] [2021-12-07 01:16:29,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653000827] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:16:29,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606932006] [2021-12-07 01:16:29,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:16:29,088 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:16:29,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:16:29,088 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:16:29,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-12-07 01:16:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:29,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 1388 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-07 01:16:29,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:16:29,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1119 backedges. 283 proven. 5 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2021-12-07 01:16:29,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:16:29,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1119 backedges. 39 proven. 6 refuted. 0 times theorem prover too weak. 1074 trivial. 0 not checked. [2021-12-07 01:16:29,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606932006] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:16:29,723 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:16:29,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 21 [2021-12-07 01:16:29,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101252045] [2021-12-07 01:16:29,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:16:29,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-07 01:16:29,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:16:29,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-07 01:16:29,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2021-12-07 01:16:29,725 INFO L87 Difference]: Start difference. First operand 4023 states and 4829 transitions. Second operand has 21 states, 21 states have (on average 8.428571428571429) internal successors, (177), 16 states have internal predecessors, (177), 5 states have call successors, (38), 5 states have call predecessors, (38), 8 states have return successors, (34), 8 states have call predecessors, (34), 5 states have call successors, (34) [2021-12-07 01:16:32,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:16:32,998 INFO L93 Difference]: Finished difference Result 10784 states and 13317 transitions. [2021-12-07 01:16:32,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-07 01:16:32,998 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.428571428571429) internal successors, (177), 16 states have internal predecessors, (177), 5 states have call successors, (38), 5 states have call predecessors, (38), 8 states have return successors, (34), 8 states have call predecessors, (34), 5 states have call successors, (34) Word has length 392 [2021-12-07 01:16:32,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:16:33,007 INFO L225 Difference]: With dead ends: 10784 [2021-12-07 01:16:33,007 INFO L226 Difference]: Without dead ends: 7158 [2021-12-07 01:16:33,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 890 GetRequests, 848 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=273, Invalid=1619, Unknown=0, NotChecked=0, Total=1892 [2021-12-07 01:16:33,010 INFO L933 BasicCegarLoop]: 429 mSDtfsCounter, 1741 mSDsluCounter, 4054 mSDsCounter, 0 mSdLazyCounter, 3153 mSolverCounterSat, 519 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1756 SdHoareTripleChecker+Valid, 4483 SdHoareTripleChecker+Invalid, 3672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 519 IncrementalHoareTripleChecker+Valid, 3153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:16:33,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1756 Valid, 4483 Invalid, 3672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [519 Valid, 3153 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-07 01:16:33,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7158 states. [2021-12-07 01:16:33,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7158 to 3855. [2021-12-07 01:16:33,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3855 states, 3170 states have (on average 1.16403785488959) internal successors, (3690), 3200 states have internal predecessors, (3690), 433 states have call successors, (433), 251 states have call predecessors, (433), 251 states have return successors, (433), 403 states have call predecessors, (433), 433 states have call successors, (433) [2021-12-07 01:16:33,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3855 states to 3855 states and 4556 transitions. [2021-12-07 01:16:33,853 INFO L78 Accepts]: Start accepts. Automaton has 3855 states and 4556 transitions. Word has length 392 [2021-12-07 01:16:33,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:16:33,854 INFO L470 AbstractCegarLoop]: Abstraction has 3855 states and 4556 transitions. [2021-12-07 01:16:33,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.428571428571429) internal successors, (177), 16 states have internal predecessors, (177), 5 states have call successors, (38), 5 states have call predecessors, (38), 8 states have return successors, (34), 8 states have call predecessors, (34), 5 states have call successors, (34) [2021-12-07 01:16:33,854 INFO L276 IsEmpty]: Start isEmpty. Operand 3855 states and 4556 transitions. [2021-12-07 01:16:33,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2021-12-07 01:16:33,857 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:16:33,857 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 12, 12, 10, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:16:33,877 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2021-12-07 01:16:34,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:16:34,058 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:16:34,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:16:34,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1107538834, now seen corresponding path program 1 times [2021-12-07 01:16:34,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:16:34,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021635064] [2021-12-07 01:16:34,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:16:34,061 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:16:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:34,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:16:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:34,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-07 01:16:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:34,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-07 01:16:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:34,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-07 01:16:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:34,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-07 01:16:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:34,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 01:16:34,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:34,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 01:16:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:34,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-07 01:16:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:34,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-07 01:16:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:34,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-07 01:16:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:34,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:16:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:34,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-07 01:16:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:34,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-07 01:16:34,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:34,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:16:34,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:34,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-07 01:16:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:34,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-07 01:16:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:34,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-12-07 01:16:34,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:34,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-12-07 01:16:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:34,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-07 01:16:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:34,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-12-07 01:16:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:34,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2021-12-07 01:16:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:34,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-12-07 01:16:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:34,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2021-12-07 01:16:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:34,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2021-12-07 01:16:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:34,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2021-12-07 01:16:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:34,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2021-12-07 01:16:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:34,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2021-12-07 01:16:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:34,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-12-07 01:16:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:34,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2021-12-07 01:16:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:34,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2021-12-07 01:16:34,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:34,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2021-12-07 01:16:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:34,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2021-12-07 01:16:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:34,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2021-12-07 01:16:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:34,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 378 [2021-12-07 01:16:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:34,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 139 proven. 132 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2021-12-07 01:16:34,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:16:34,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021635064] [2021-12-07 01:16:34,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021635064] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:16:34,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699693494] [2021-12-07 01:16:34,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:16:34,310 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:16:34,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:16:34,311 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:16:34,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-12-07 01:16:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:34,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 1381 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-07 01:16:34,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:16:35,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 607 proven. 221 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2021-12-07 01:16:35,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:16:36,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 157 proven. 155 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2021-12-07 01:16:36,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699693494] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:16:36,589 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:16:36,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 25, 20] total 48 [2021-12-07 01:16:36,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165401060] [2021-12-07 01:16:36,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:16:36,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-12-07 01:16:36,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:16:36,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-07 01:16:36,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=2048, Unknown=0, NotChecked=0, Total=2256 [2021-12-07 01:16:36,591 INFO L87 Difference]: Start difference. First operand 3855 states and 4556 transitions. Second operand has 48 states, 48 states have (on average 8.0) internal successors, (384), 40 states have internal predecessors, (384), 14 states have call successors, (62), 11 states have call predecessors, (62), 24 states have return successors, (62), 18 states have call predecessors, (62), 14 states have call successors, (62) [2021-12-07 01:16:40,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:16:40,935 INFO L93 Difference]: Finished difference Result 7953 states and 9578 transitions. [2021-12-07 01:16:40,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-12-07 01:16:40,936 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 8.0) internal successors, (384), 40 states have internal predecessors, (384), 14 states have call successors, (62), 11 states have call predecessors, (62), 24 states have return successors, (62), 18 states have call predecessors, (62), 14 states have call successors, (62) Word has length 394 [2021-12-07 01:16:40,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:16:40,941 INFO L225 Difference]: With dead ends: 7953 [2021-12-07 01:16:40,941 INFO L226 Difference]: Without dead ends: 4519 [2021-12-07 01:16:40,944 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 911 GetRequests, 826 SyntacticMatches, 3 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1635 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=801, Invalid=6171, Unknown=0, NotChecked=0, Total=6972 [2021-12-07 01:16:40,945 INFO L933 BasicCegarLoop]: 330 mSDtfsCounter, 779 mSDsluCounter, 6312 mSDsCounter, 0 mSdLazyCounter, 4416 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 6642 SdHoareTripleChecker+Invalid, 4773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 4416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:16:40,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [802 Valid, 6642 Invalid, 4773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 4416 Invalid, 0 Unknown, 144 Unchecked, 2.1s Time] [2021-12-07 01:16:40,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4519 states. [2021-12-07 01:16:41,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4519 to 3862. [2021-12-07 01:16:41,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3862 states, 3176 states have (on average 1.1627833753148615) internal successors, (3693), 3206 states have internal predecessors, (3693), 433 states have call successors, (433), 252 states have call predecessors, (433), 252 states have return successors, (433), 403 states have call predecessors, (433), 433 states have call successors, (433) [2021-12-07 01:16:41,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3862 states to 3862 states and 4559 transitions. [2021-12-07 01:16:41,793 INFO L78 Accepts]: Start accepts. Automaton has 3862 states and 4559 transitions. Word has length 394 [2021-12-07 01:16:41,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:16:41,794 INFO L470 AbstractCegarLoop]: Abstraction has 3862 states and 4559 transitions. [2021-12-07 01:16:41,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 8.0) internal successors, (384), 40 states have internal predecessors, (384), 14 states have call successors, (62), 11 states have call predecessors, (62), 24 states have return successors, (62), 18 states have call predecessors, (62), 14 states have call successors, (62) [2021-12-07 01:16:41,794 INFO L276 IsEmpty]: Start isEmpty. Operand 3862 states and 4559 transitions. [2021-12-07 01:16:41,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2021-12-07 01:16:41,798 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:16:41,798 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 12, 12, 10, 10, 10, 10, 9, 8, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:16:41,818 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2021-12-07 01:16:41,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2021-12-07 01:16:42,000 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:16:42,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:16:42,001 INFO L85 PathProgramCache]: Analyzing trace with hash -340747451, now seen corresponding path program 1 times [2021-12-07 01:16:42,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:16:42,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102849590] [2021-12-07 01:16:42,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:16:42,002 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:16:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 01:16:42,068 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 01:16:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 01:16:42,200 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 01:16:42,200 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-07 01:16:42,200 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-07 01:16:42,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-12-07 01:16:42,204 INFO L732 BasicCegarLoop]: Path program histogram: [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] [2021-12-07 01:16:42,206 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-07 01:16:42,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:16:42 BoogieIcfgContainer [2021-12-07 01:16:42,364 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-07 01:16:42,365 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-07 01:16:42,365 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-07 01:16:42,365 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-07 01:16:42,365 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:13:16" (3/4) ... [2021-12-07 01:16:42,367 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-07 01:16:42,548 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-07 01:16:42,548 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-07 01:16:42,549 INFO L158 Benchmark]: Toolchain (without parser) took 207310.51ms. Allocated memory was 111.1MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 86.7MB in the beginning and 592.2MB in the end (delta: -505.5MB). Peak memory consumption was 861.0MB. Max. memory is 16.1GB. [2021-12-07 01:16:42,549 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 73.4MB. Free memory was 42.8MB in the beginning and 42.7MB in the end (delta: 48.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-07 01:16:42,549 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.10ms. Allocated memory is still 111.1MB. Free memory was 86.5MB in the beginning and 71.2MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-07 01:16:42,549 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.77ms. Allocated memory is still 111.1MB. Free memory was 71.2MB in the beginning and 68.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-07 01:16:42,550 INFO L158 Benchmark]: Boogie Preprocessor took 41.88ms. Allocated memory is still 111.1MB. Free memory was 68.2MB in the beginning and 66.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-07 01:16:42,550 INFO L158 Benchmark]: RCFGBuilder took 523.01ms. Allocated memory is still 111.1MB. Free memory was 65.9MB in the beginning and 84.8MB in the end (delta: -18.9MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2021-12-07 01:16:42,550 INFO L158 Benchmark]: TraceAbstraction took 206205.58ms. Allocated memory was 111.1MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 84.3MB in the beginning and 657.8MB in the end (delta: -573.4MB). Peak memory consumption was 791.5MB. Max. memory is 16.1GB. [2021-12-07 01:16:42,550 INFO L158 Benchmark]: Witness Printer took 183.56ms. Allocated memory is still 1.5GB. Free memory was 657.8MB in the beginning and 592.2MB in the end (delta: 65.6MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2021-12-07 01:16:42,552 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.14ms. Allocated memory is still 73.4MB. Free memory was 42.8MB in the beginning and 42.7MB in the end (delta: 48.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.10ms. Allocated memory is still 111.1MB. Free memory was 86.5MB in the beginning and 71.2MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.77ms. Allocated memory is still 111.1MB. Free memory was 71.2MB in the beginning and 68.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.88ms. Allocated memory is still 111.1MB. Free memory was 68.2MB in the beginning and 66.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 523.01ms. Allocated memory is still 111.1MB. Free memory was 65.9MB in the beginning and 84.8MB in the end (delta: -18.9MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. * TraceAbstraction took 206205.58ms. Allocated memory was 111.1MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 84.3MB in the beginning and 657.8MB in the end (delta: -573.4MB). Peak memory consumption was 791.5MB. Max. memory is 16.1GB. * Witness Printer took 183.56ms. Allocated memory is still 1.5GB. Free memory was 657.8MB in the beginning and 592.2MB in the end (delta: 65.6MB). Peak memory consumption was 65.0MB. 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: 535]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] msg_t nomsg = (msg_t )-1; [L24] port_t g1v ; [L25] int8_t g1v_old ; [L26] int8_t g1v_new ; [L27] port_t g2v ; [L28] int8_t g2v_old ; [L29] int8_t g2v_new ; [L30] port_t g3v ; [L31] int8_t g3v_old ; [L32] int8_t g3v_new ; [L36] _Bool gate1Failed ; [L37] _Bool gate2Failed ; [L38] _Bool gate3Failed ; [L39] msg_t VALUE1 ; [L40] msg_t VALUE2 ; [L41] msg_t VALUE3 ; [L43] _Bool gate1Failed_History_0 ; [L44] _Bool gate1Failed_History_1 ; [L45] _Bool gate1Failed_History_2 ; [L46] _Bool gate2Failed_History_0 ; [L47] _Bool gate2Failed_History_1 ; [L48] _Bool gate2Failed_History_2 ; [L49] _Bool gate3Failed_History_0 ; [L50] _Bool gate3Failed_History_1 ; [L51] _Bool gate3Failed_History_2 ; [L52] int8_t votedValue_History_0 ; [L53] int8_t votedValue_History_1 ; [L54] int8_t votedValue_History_2 ; VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=0, votedValue_History_1=0, votedValue_History_2=0] [L476] int c1 ; [L477] int i2 ; [L480] c1 = 0 [L481] gate1Failed = __VERIFIER_nondet_bool() [L482] gate2Failed = __VERIFIER_nondet_bool() [L483] gate3Failed = __VERIFIER_nondet_bool() [L484] VALUE1 = __VERIFIER_nondet_char() [L485] VALUE2 = __VERIFIER_nondet_char() [L486] VALUE3 = __VERIFIER_nondet_char() [L487] gate1Failed_History_0 = __VERIFIER_nondet_bool() [L488] gate1Failed_History_1 = __VERIFIER_nondet_bool() [L489] gate1Failed_History_2 = __VERIFIER_nondet_bool() [L490] gate2Failed_History_0 = __VERIFIER_nondet_bool() [L491] gate2Failed_History_1 = __VERIFIER_nondet_bool() [L492] gate2Failed_History_2 = __VERIFIER_nondet_bool() [L493] gate3Failed_History_0 = __VERIFIER_nondet_bool() [L494] gate3Failed_History_1 = __VERIFIER_nondet_bool() [L495] gate3Failed_History_2 = __VERIFIER_nondet_bool() [L496] votedValue_History_0 = __VERIFIER_nondet_char() [L497] votedValue_History_1 = __VERIFIER_nondet_char() [L498] votedValue_History_2 = __VERIFIER_nondet_char() [L499] CALL, EXPR init() [L203] int tmp ; [L204] int tmp___0 ; [L205] int tmp___1 ; [L206] int tmp___2 ; VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L209] CALL, EXPR add_history_type(0) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND TRUE history_id == 0 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] CALL, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L127] COND TRUE historyIndex == 0 [L128] return (gate1Failed_History_0); VAL [\old(history_id)=0, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] RET, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(0, 0)=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] tmp = (int )read_history_bool(0, 0) [L74] COND FALSE !(! (tmp == (int )ini_bool)) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND TRUE history_id == 0 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] CALL, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L127] COND TRUE historyIndex == 0 [L128] return (gate1Failed_History_0); VAL [\old(history_id)=0, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] RET, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(0, 0)=0, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] tmp = (int )read_history_bool(0, 0) [L74] COND FALSE !(! (tmp == (int )ini_bool)) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND TRUE history_id == 0 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] CALL, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L127] COND TRUE historyIndex == 0 [L128] return (gate1Failed_History_0); VAL [\old(history_id)=0, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] RET, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(0, 0)=0, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] tmp = (int )read_history_bool(0, 0) [L74] COND FALSE !(! (tmp == (int )ini_bool)) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] return (1); VAL [\old(history_id)=0, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L209] RET, EXPR add_history_type(0) VAL [add_history_type(0)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L209] tmp = add_history_type(0) [L210] COND FALSE !(! tmp) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, tmp=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L213] CALL, EXPR add_history_type(1) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND TRUE history_id == 1 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] CALL, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND TRUE history_id == 1 VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L137] COND TRUE historyIndex == 0 [L138] return (gate2Failed_History_0); VAL [\old(history_id)=1, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] RET, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(1, 0)=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND TRUE history_id == 1 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] CALL, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND TRUE history_id == 1 VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L137] COND TRUE historyIndex == 0 [L138] return (gate2Failed_History_0); VAL [\old(history_id)=1, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] RET, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(1, 0)=0, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND TRUE history_id == 1 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] CALL, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND TRUE history_id == 1 VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L137] COND TRUE historyIndex == 0 [L138] return (gate2Failed_History_0); VAL [\old(history_id)=1, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] RET, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(1, 0)=0, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] return (1); VAL [\old(history_id)=1, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L213] RET, EXPR add_history_type(1) VAL [add_history_type(1)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, tmp=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L213] tmp___0 = add_history_type(1) [L214] COND FALSE !(! tmp___0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L217] CALL, EXPR add_history_type(2) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND TRUE history_id == 2 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] CALL, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L146] COND TRUE history_id == 2 VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L147] COND TRUE historyIndex == 0 [L148] return (gate3Failed_History_0); VAL [\old(history_id)=2, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] RET, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(2, 0)=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND TRUE history_id == 2 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] CALL, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L146] COND TRUE history_id == 2 VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L147] COND TRUE historyIndex == 0 [L148] return (gate3Failed_History_0); VAL [\old(history_id)=2, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] RET, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(2, 0)=0, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND TRUE history_id == 2 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] CALL, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L146] COND TRUE history_id == 2 VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L147] COND TRUE historyIndex == 0 [L148] return (gate3Failed_History_0); VAL [\old(history_id)=2, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] RET, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(2, 0)=0, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] return (1); VAL [\old(history_id)=2, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L217] RET, EXPR add_history_type(2) VAL [add_history_type(2)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L217] tmp___1 = add_history_type(2) [L218] COND FALSE !(! tmp___1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, tmp___1=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L221] CALL, EXPR add_history_type(3) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND FALSE !(history_id == 2) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L90] COND TRUE history_id == 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] RET, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, read_history_int8(3, 0)=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND FALSE !(history_id == 2) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L90] COND TRUE history_id == 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] RET, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, read_history_int8(3, 0)=-2, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND FALSE !(history_id == 2) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L90] COND TRUE history_id == 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] RET, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, read_history_int8(3, 0)=-2, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] return (1); VAL [\old(history_id)=3, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L221] RET, EXPR add_history_type(3) VAL [add_history_type(3)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, tmp___1=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L221] tmp___2 = add_history_type(3) [L222] COND FALSE !(! tmp___2) [L225] return (1); VAL [\result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L499] RET, EXPR init() [L499] i2 = init() [L500] COND FALSE !(!(i2)) VAL [c1=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, i2=1, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L501] g1v_old = nomsg [L502] g1v_new = nomsg [L503] g2v_old = nomsg [L504] g2v_new = nomsg [L505] g3v_old = nomsg [L506] g3v_new = nomsg [L507] i2 = 0 VAL [c1=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, i2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L508] COND TRUE i2 < 10 [L510] CALL gate1_each_pals_period() [L338] int8_t next_state ; [L339] msg_t tmp ; [L340] int tmp___0 ; [L343] gate1Failed = __VERIFIER_nondet_bool() [L344] CALL write_history_bool(0, gate1Failed) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=4, \old(gate1Failed_History_2)=2, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=5, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=7, \old(gate3Failed_History_2)=3, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed_History_0=0, gate1Failed_History_1=4, gate1Failed_History_2=2, gate2Failed_History_0=0, gate2Failed_History_1=5, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND TRUE history_id == 0 [L182] gate1Failed_History_2 = gate1Failed_History_1 [L183] gate1Failed_History_1 = gate1Failed_History_0 [L184] gate1Failed_History_0 = buf VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=4, \old(gate1Failed_History_2)=2, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=5, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=7, \old(gate3Failed_History_2)=3, \old(history_id)=0, buf=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed_History_0=0, gate2Failed_History_1=5, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, history_id=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L344] RET write_history_bool(0, gate1Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed_History_0=0, gate2Failed_History_1=5, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L345] COND TRUE \read(gate1Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed_History_0=0, gate2Failed_History_1=5, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L346] EXPR nomsg != nomsg && g1v_new == nomsg ? nomsg : g1v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed_History_0=0, gate2Failed_History_1=5, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, nomsg != nomsg && g1v_new == nomsg ? nomsg : g1v_new=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L346] g1v_new = nomsg != nomsg && g1v_new == nomsg ? nomsg : g1v_new [L510] RET gate1_each_pals_period() [L511] CALL gate2_each_pals_period() [L369] int8_t next_state ; [L370] msg_t tmp ; [L371] int tmp___0 ; [L374] gate2Failed = __VERIFIER_nondet_bool() [L375] CALL write_history_bool(1, gate2Failed) VAL [\old(buf)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=4, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=5, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=7, \old(gate3Failed_History_2)=3, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed_History_0=0, gate2Failed_History_1=5, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND FALSE !(history_id == 0) VAL [\old(buf)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=4, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=5, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=7, \old(gate3Failed_History_2)=3, \old(history_id)=1, buf=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed_History_0=0, gate2Failed_History_1=5, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, history_id=1, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L186] COND TRUE history_id == 1 [L187] gate2Failed_History_2 = gate2Failed_History_1 [L188] gate2Failed_History_1 = gate2Failed_History_0 [L189] gate2Failed_History_0 = buf VAL [\old(buf)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=4, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=5, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=7, \old(gate3Failed_History_2)=3, \old(history_id)=1, buf=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, history_id=1, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L375] RET write_history_bool(1, gate2Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L376] COND TRUE \read(gate2Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L377] EXPR nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L377] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new [L511] RET gate2_each_pals_period() [L512] CALL gate3_each_pals_period() [L400] int8_t next_state ; [L401] msg_t tmp ; [L402] int tmp___0 ; [L405] gate3Failed = __VERIFIER_nondet_bool() [L406] CALL write_history_bool(2, gate3Failed) VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=4, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=7, \old(gate3Failed_History_2)=3, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND FALSE !(history_id == 0) VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=4, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=7, \old(gate3Failed_History_2)=3, \old(history_id)=2, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, history_id=2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L186] COND FALSE !(history_id == 1) VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=4, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=7, \old(gate3Failed_History_2)=3, \old(history_id)=2, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=7, gate3Failed_History_2=3, history_id=2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L191] COND TRUE history_id == 2 [L192] gate3Failed_History_2 = gate3Failed_History_1 [L193] gate3Failed_History_1 = gate3Failed_History_0 [L194] gate3Failed_History_0 = buf VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=4, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=7, \old(gate3Failed_History_2)=3, \old(history_id)=2, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L406] RET write_history_bool(2, gate3Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L407] COND FALSE !(\read(gate3Failed)) [L411] tmp = __VERIFIER_nondet_char() [L412] next_state = tmp VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, next_state=0, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L413] COND TRUE (int )next_state == 0 [L414] tmp___0 = 1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L424] COND FALSE !(!((_Bool )tmp___0)) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L425] EXPR next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, next_state=0, next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L425] g3v_new = next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new [L512] RET gate3_each_pals_period() [L513] CALL voter() [L431] int8_t voted_value ; [L434] voted_value = nomsg [L435] VALUE1 = g1v_old [L436] g1v_old = nomsg [L437] VALUE2 = g2v_old [L438] g2v_old = nomsg [L439] VALUE3 = g3v_old [L440] g3v_old = nomsg VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, voted_value=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L441] COND TRUE (int )VALUE1 == (int )VALUE2 [L442] voted_value = VALUE1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, voted_value=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L470] CALL write_history_int8(3, voted_value) [L166] COND TRUE history_id == 3 [L167] votedValue_History_2 = votedValue_History_1 [L168] votedValue_History_1 = votedValue_History_0 [L169] votedValue_History_0 = buf VAL [\old(buf)=255, \old(history_id)=3, buf=255, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L470] RET write_history_int8(3, voted_value) [L513] RET voter() [L514] g1v_old = g1v_new [L515] g1v_new = nomsg [L516] g2v_old = g2v_new [L517] g2v_new = nomsg [L518] g3v_old = g3v_new [L519] g3v_new = nomsg [L520] CALL, EXPR check() [L230] int tmp ; [L231] int temp_count ; [L232] int8_t tmp___0 ; [L233] int8_t tmp___1 ; [L234] int8_t tmp___2 ; [L235] _Bool tmp___3 ; [L236] _Bool tmp___4 ; [L237] _Bool tmp___5 ; [L238] int8_t tmp___6 ; [L239] _Bool tmp___7 ; [L240] _Bool tmp___8 ; [L241] _Bool tmp___9 ; [L242] int8_t tmp___10 ; [L243] int8_t tmp___11 ; [L244] int8_t tmp___12 ; [L245] int8_t tmp___13 ; [L246] int8_t tmp___14 ; VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L249] COND FALSE !(! gate1Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L252] COND FALSE !(! gate2Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L255] COND TRUE ! gate3Failed [L256] tmp = 1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L260] COND FALSE !(!((_Bool )tmp)) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L261] CALL, EXPR read_history_bool(0, 1) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L126] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L127] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L130] COND TRUE historyIndex == 1 [L131] return (gate1Failed_History_1); VAL [\old(history_id)=0, \old(historyIndex)=1, \result=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L261] RET, EXPR read_history_bool(0, 1) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, read_history_bool(0, 1)=0, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L261] tmp___3 = read_history_bool(0, 1) [L262] COND TRUE ! tmp___3 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, tmp=1, tmp___3=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] CALL, EXPR read_history_bool(1, 1) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L136] COND TRUE history_id == 1 VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L137] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L140] COND TRUE historyIndex == 1 [L141] return (gate2Failed_History_1); VAL [\old(history_id)=1, \old(historyIndex)=1, \result=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] RET, EXPR read_history_bool(1, 1) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, read_history_bool(1, 1)=0, tmp=1, tmp___3=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] tmp___4 = read_history_bool(1, 1) [L264] COND TRUE ! tmp___4 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, tmp=1, tmp___3=0, tmp___4=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L265] CALL, EXPR read_history_bool(2, 1) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L136] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L146] COND TRUE history_id == 2 VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L147] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L150] COND TRUE historyIndex == 1 [L151] return (gate3Failed_History_1); VAL [\old(history_id)=2, \old(historyIndex)=1, \result=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L265] RET, EXPR read_history_bool(2, 1) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, read_history_bool(2, 1)=0, tmp=1, tmp___3=0, tmp___4=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L265] tmp___5 = read_history_bool(2, 1) [L266] COND TRUE ! tmp___5 [L267] temp_count = 0 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, temp_count=0, tmp=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L268] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L268] RET, EXPR read_history_int8(3, 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, read_history_int8(3, 0)=-1, temp_count=0, tmp=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L268] tmp___0 = read_history_int8(3, 0) [L269] COND TRUE (int )VALUE1 == (int )tmp___0 [L270] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, temp_count=1, tmp=1, tmp___0=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L272] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L272] RET, EXPR read_history_int8(3, 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, read_history_int8(3, 0)=-1, temp_count=1, tmp=1, tmp___0=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L272] tmp___1 = read_history_int8(3, 0) [L273] COND TRUE (int )VALUE2 == (int )tmp___1 [L274] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, temp_count=2, tmp=1, tmp___0=-1, tmp___1=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L276] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L276] RET, EXPR read_history_int8(3, 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, read_history_int8(3, 0)=-1, temp_count=2, tmp=1, tmp___0=-1, tmp___1=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L276] tmp___2 = read_history_int8(3, 0) [L277] COND TRUE (int )VALUE3 == (int )tmp___2 [L278] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L280] COND FALSE !((int )VALUE1 != (int )VALUE2) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L294] COND FALSE !(! (temp_count > 1)) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L300] CALL, EXPR read_history_int8(3, 1) VAL [\old(history_id)=3, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=3, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L110] COND TRUE historyIndex == 1 [L111] return (votedValue_History_1); VAL [\old(history_id)=3, \old(historyIndex)=1, \result=-2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L300] RET, EXPR read_history_int8(3, 1) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, read_history_int8(3, 1)=-2, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L300] tmp___10 = read_history_int8(3, 1) [L301] COND FALSE !((int )tmp___10 > -2) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___10=-2, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L320] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L320] RET, EXPR read_history_int8(3, 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, read_history_int8(3, 0)=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___10=-2, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L320] tmp___11 = read_history_int8(3, 0) [L321] COND FALSE !((int )tmp___11 != (int )nomsg) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___10=-2, tmp___11=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L333] return (1); VAL [\result=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___10=-2, tmp___11=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L520] RET, EXPR check() [L520] c1 = check() [L521] CALL assert(c1) VAL [\old(arg)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L533] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L521] RET assert(c1) VAL [c1=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, i2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L522] i2 ++ VAL [c1=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, i2=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L508] COND TRUE i2 < 10 [L510] CALL gate1_each_pals_period() [L338] int8_t next_state ; [L339] msg_t tmp ; [L340] int tmp___0 ; [L343] gate1Failed = __VERIFIER_nondet_bool() [L344] CALL write_history_bool(0, gate1Failed) VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=4, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=7, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=4, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L181] COND TRUE history_id == 0 [L182] gate1Failed_History_2 = gate1Failed_History_1 [L183] gate1Failed_History_1 = gate1Failed_History_0 [L184] gate1Failed_History_0 = buf VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=4, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=7, \old(history_id)=0, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L344] RET write_history_bool(0, gate1Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L345] COND FALSE !(\read(gate1Failed)) [L349] tmp = __VERIFIER_nondet_char() [L350] next_state = tmp VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, next_state=0, nomsg=-1, tmp=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L351] COND TRUE (int )next_state == 0 [L352] tmp___0 = 1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L362] COND FALSE !(!((_Bool )tmp___0)) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L363] EXPR next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, next_state=0, next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L363] g1v_new = next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new [L510] RET gate1_each_pals_period() [L511] CALL gate2_each_pals_period() [L369] int8_t next_state ; [L370] msg_t tmp ; [L371] int tmp___0 ; [L374] gate2Failed = __VERIFIER_nondet_bool() [L375] CALL write_history_bool(1, gate2Failed) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=7, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L181] COND FALSE !(history_id == 0) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=7, \old(history_id)=1, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=5, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L186] COND TRUE history_id == 1 [L187] gate2Failed_History_2 = gate2Failed_History_1 [L188] gate2Failed_History_1 = gate2Failed_History_0 [L189] gate2Failed_History_0 = buf VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=7, \old(history_id)=1, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L375] RET write_history_bool(1, gate2Failed) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L376] COND TRUE \read(gate2Failed) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L377] EXPR nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L377] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new [L511] RET gate2_each_pals_period() [L512] CALL gate3_each_pals_period() [L400] int8_t next_state ; [L401] msg_t tmp ; [L402] int tmp___0 ; [L405] gate3Failed = __VERIFIER_nondet_bool() [L406] CALL write_history_bool(2, gate3Failed) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=7, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L181] COND FALSE !(history_id == 0) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=7, \old(history_id)=2, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=2, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L186] COND FALSE !(history_id == 1) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=7, \old(history_id)=2, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=7, history_id=2, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L191] COND TRUE history_id == 2 [L192] gate3Failed_History_2 = gate3Failed_History_1 [L193] gate3Failed_History_1 = gate3Failed_History_0 [L194] gate3Failed_History_0 = buf VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=7, \old(history_id)=2, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L406] RET write_history_bool(2, gate3Failed) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L407] COND TRUE \read(gate3Failed) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L408] EXPR nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L408] g3v_new = nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new [L512] RET gate3_each_pals_period() [L513] CALL voter() [L431] int8_t voted_value ; [L434] voted_value = nomsg [L435] VALUE1 = g1v_old [L436] g1v_old = nomsg [L437] VALUE2 = g2v_old [L438] g2v_old = nomsg [L439] VALUE3 = g3v_old [L440] g3v_old = nomsg VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, voted_value=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L441] COND TRUE (int )VALUE1 == (int )VALUE2 [L442] voted_value = VALUE1 VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, voted_value=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L470] CALL write_history_int8(3, voted_value) [L166] COND TRUE history_id == 3 [L167] votedValue_History_2 = votedValue_History_1 [L168] votedValue_History_1 = votedValue_History_0 [L169] votedValue_History_0 = buf VAL [\old(buf)=255, \old(history_id)=3, buf=255, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L470] RET write_history_int8(3, voted_value) [L513] RET voter() [L514] g1v_old = g1v_new [L515] g1v_new = nomsg [L516] g2v_old = g2v_new [L517] g2v_new = nomsg [L518] g3v_old = g3v_new [L519] g3v_new = nomsg [L520] CALL, EXPR check() [L230] int tmp ; [L231] int temp_count ; [L232] int8_t tmp___0 ; [L233] int8_t tmp___1 ; [L234] int8_t tmp___2 ; [L235] _Bool tmp___3 ; [L236] _Bool tmp___4 ; [L237] _Bool tmp___5 ; [L238] int8_t tmp___6 ; [L239] _Bool tmp___7 ; [L240] _Bool tmp___8 ; [L241] _Bool tmp___9 ; [L242] int8_t tmp___10 ; [L243] int8_t tmp___11 ; [L244] int8_t tmp___12 ; [L245] int8_t tmp___13 ; [L246] int8_t tmp___14 ; VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L249] COND TRUE ! gate1Failed [L250] tmp = 1 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L260] COND FALSE !(!((_Bool )tmp)) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L261] CALL, EXPR read_history_bool(0, 1) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L126] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L127] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L130] COND TRUE historyIndex == 1 [L131] return (gate1Failed_History_1); VAL [\old(history_id)=0, \old(historyIndex)=1, \result=-511, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L261] RET, EXPR read_history_bool(0, 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_bool(0, 1)=-511, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L261] tmp___3 = read_history_bool(0, 1) [L262] COND FALSE !(! tmp___3) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___3=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L300] CALL, EXPR read_history_int8(3, 1) VAL [\old(history_id)=3, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L107] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=3, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L110] COND TRUE historyIndex == 1 [L111] return (votedValue_History_1); VAL [\old(history_id)=3, \old(historyIndex)=1, \result=-1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L300] RET, EXPR read_history_int8(3, 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_int8(3, 1)=-1, tmp=1, tmp___3=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L300] tmp___10 = read_history_int8(3, 1) [L301] COND TRUE (int )tmp___10 > -2 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L302] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L302] RET, EXPR read_history_int8(3, 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_int8(3, 0)=-1, tmp=1, tmp___10=-1, tmp___3=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L302] tmp___6 = read_history_int8(3, 0) [L303] COND TRUE (int )tmp___6 == (int )nomsg VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L304] CALL, EXPR read_history_bool(0, 1) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L126] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L127] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L130] COND TRUE historyIndex == 1 [L131] return (gate1Failed_History_1); VAL [\old(history_id)=0, \old(historyIndex)=1, \result=-511, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L304] RET, EXPR read_history_bool(0, 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_bool(0, 1)=-511, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L304] tmp___7 = read_history_bool(0, 1) [L305] COND TRUE \read(tmp___7) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L306] CALL, EXPR read_history_bool(1, 1) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L136] COND TRUE history_id == 1 VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L137] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L140] COND TRUE historyIndex == 1 [L141] return (gate2Failed_History_1); VAL [\old(history_id)=1, \old(historyIndex)=1, \result=-255, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L306] RET, EXPR read_history_bool(1, 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_bool(1, 1)=-255, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L306] tmp___8 = read_history_bool(1, 1) [L307] COND TRUE \read(tmp___8) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, tmp___8=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L308] CALL, EXPR read_history_bool(2, 1) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L136] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L146] COND TRUE history_id == 2 VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L147] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L150] COND TRUE historyIndex == 1 [L151] return (gate3Failed_History_1); VAL [\old(history_id)=2, \old(historyIndex)=1, \result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L308] RET, EXPR read_history_bool(2, 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_bool(2, 1)=0, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, tmp___8=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L308] tmp___9 = read_history_bool(2, 1) [L309] COND TRUE ! tmp___9 [L310] return (0); VAL [\result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, tmp___8=1, tmp___9=0, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L520] RET, EXPR check() [L520] c1 = check() [L521] CALL assert(c1) VAL [\old(arg)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L533] COND TRUE ! arg VAL [\old(arg)=0, arg=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L535] reach_error() VAL [\old(arg)=0, arg=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 184 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 206.0s, OverallIterations: 57, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 157.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39437 SdHoareTripleChecker+Valid, 65.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38819 mSDsluCounter, 227969 SdHoareTripleChecker+Invalid, 55.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 144 IncrementalHoareTripleChecker+Unchecked, 203432 mSDsCounter, 23678 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 172281 IncrementalHoareTripleChecker+Invalid, 196103 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23678 mSolverCounterUnsat, 24537 mSDtfsCounter, 172281 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17529 GetRequests, 14688 SyntacticMatches, 10 SemanticMatches, 2831 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431432 ImplicationChecksByTransitivity, 55.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6632occurred in iteration=44, InterpolantAutomatonStates: 2466, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 13.8s AutomataMinimizationTime, 56 MinimizatonAttempts, 162517 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 17.4s InterpolantComputationTime, 21049 NumberOfCodeBlocks, 21049 NumberOfCodeBlocksAsserted, 79 NumberOfCheckSat, 23653 ConstructedInterpolants, 2 QuantifiedInterpolants, 51253 SizeOfPredicates, 85 NumberOfNonLiveVariables, 22702 ConjunctsInSsa, 407 ConjunctsInUnsatCore, 88 InterpolantComputations, 43 PerfectInterpolantSequences, 58396/60879 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-07 01:16:42,590 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a388d153-e777-4dd3-889b-e643deee1edd/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