./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 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/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_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF --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.1-dev-53f42b1 [2021-11-20 07:26:39,366 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 07:26:39,369 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 07:26:39,426 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 07:26:39,426 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 07:26:39,431 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 07:26:39,433 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 07:26:39,437 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 07:26:39,440 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 07:26:39,445 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 07:26:39,447 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 07:26:39,449 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 07:26:39,449 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 07:26:39,452 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 07:26:39,454 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 07:26:39,462 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 07:26:39,464 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 07:26:39,466 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 07:26:39,469 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 07:26:39,479 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 07:26:39,481 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 07:26:39,482 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 07:26:39,486 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 07:26:39,487 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 07:26:39,497 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 07:26:39,497 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 07:26:39,498 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 07:26:39,500 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 07:26:39,500 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 07:26:39,502 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 07:26:39,502 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 07:26:39,503 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 07:26:39,505 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 07:26:39,507 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 07:26:39,508 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 07:26:39,508 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 07:26:39,509 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 07:26:39,510 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 07:26:39,510 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 07:26:39,511 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 07:26:39,511 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 07:26:39,512 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-20 07:26:39,557 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 07:26:39,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 07:26:39,558 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 07:26:39,558 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 07:26:39,565 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 07:26:39,566 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 07:26:39,566 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 07:26:39,566 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 07:26:39,567 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 07:26:39,567 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 07:26:39,568 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 07:26:39,568 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 07:26:39,569 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 07:26:39,569 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 07:26:39,569 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-20 07:26:39,569 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 07:26:39,570 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-20 07:26:39,570 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 07:26:39,570 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 07:26:39,570 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 07:26:39,571 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-20 07:26:39,571 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 07:26:39,571 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 07:26:39,571 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 07:26:39,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 07:26:39,572 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 07:26:39,572 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 07:26:39,572 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-20 07:26:39,573 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-20 07:26:39,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 07:26:39,574 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-20 07:26:39,575 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-20 07:26:39,575 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-20 07:26:39,575 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 07:26:39,576 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_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/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_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF 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-11-20 07:26:39,851 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 07:26:39,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 07:26:39,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 07:26:39,877 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 07:26:39,878 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 07:26:39,879 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2021-11-20 07:26:39,952 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/data/daedeaf99/f1138c8b93f64645bb3e335fcdc338d1/FLAGf639ab337 [2021-11-20 07:26:40,518 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 07:26:40,519 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2021-11-20 07:26:40,539 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/data/daedeaf99/f1138c8b93f64645bb3e335fcdc338d1/FLAGf639ab337 [2021-11-20 07:26:40,831 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/data/daedeaf99/f1138c8b93f64645bb3e335fcdc338d1 [2021-11-20 07:26:40,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 07:26:40,835 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 07:26:40,837 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 07:26:40,837 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 07:26:40,840 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 07:26:40,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:26:40" (1/1) ... [2021-11-20 07:26:40,842 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cbb2fa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:40, skipping insertion in model container [2021-11-20 07:26:40,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:26:40" (1/1) ... [2021-11-20 07:26:40,850 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 07:26:40,885 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 07:26:41,171 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_e1eab60f-b379-443c-87fe-d81fa00f3032/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c[11956,11969] [2021-11-20 07:26:41,175 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 07:26:41,184 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 07:26:41,280 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_e1eab60f-b379-443c-87fe-d81fa00f3032/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c[11956,11969] [2021-11-20 07:26:41,293 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 07:26:41,312 INFO L208 MainTranslator]: Completed translation [2021-11-20 07:26:41,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:41 WrapperNode [2021-11-20 07:26:41,313 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 07:26:41,314 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 07:26:41,314 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 07:26:41,315 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 07:26:41,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:41" (1/1) ... [2021-11-20 07:26:41,334 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:41" (1/1) ... [2021-11-20 07:26:41,372 INFO L137 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 413 [2021-11-20 07:26:41,372 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 07:26:41,373 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 07:26:41,373 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 07:26:41,373 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 07:26:41,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:41" (1/1) ... [2021-11-20 07:26:41,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:41" (1/1) ... [2021-11-20 07:26:41,391 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:41" (1/1) ... [2021-11-20 07:26:41,403 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:41" (1/1) ... [2021-11-20 07:26:41,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:41" (1/1) ... [2021-11-20 07:26:41,435 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:41" (1/1) ... [2021-11-20 07:26:41,445 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:41" (1/1) ... [2021-11-20 07:26:41,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 07:26:41,458 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 07:26:41,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 07:26:41,459 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 07:26:41,460 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:41" (1/1) ... [2021-11-20 07:26:41,468 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 07:26:41,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:26:41,501 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 07:26:41,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 07:26:41,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 07:26:41,551 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2021-11-20 07:26:41,552 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2021-11-20 07:26:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2021-11-20 07:26:41,552 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2021-11-20 07:26:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2021-11-20 07:26:41,552 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2021-11-20 07:26:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2021-11-20 07:26:41,553 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2021-11-20 07:26:41,553 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2021-11-20 07:26:41,554 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2021-11-20 07:26:41,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-20 07:26:41,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 07:26:41,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 07:26:41,658 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 07:26:41,660 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 07:26:42,229 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 07:26:42,244 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 07:26:42,244 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-20 07:26:42,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:26:42 BoogieIcfgContainer [2021-11-20 07:26:42,246 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 07:26:42,248 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 07:26:42,248 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 07:26:42,254 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 07:26:42,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:26:40" (1/3) ... [2021-11-20 07:26:42,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44f95d23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:26:42, skipping insertion in model container [2021-11-20 07:26:42,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:41" (2/3) ... [2021-11-20 07:26:42,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44f95d23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:26:42, skipping insertion in model container [2021-11-20 07:26:42,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:26:42" (3/3) ... [2021-11-20 07:26:42,258 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2021-11-20 07:26:42,263 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 07:26:42,264 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-20 07:26:42,333 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 07:26:42,344 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-11-20 07:26:42,345 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-20 07:26:42,386 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-11-20 07:26:42,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-20 07:26:42,396 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:42,397 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:26:42,397 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:42,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:42,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1605485676, now seen corresponding path program 1 times [2021-11-20 07:26:42,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:42,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619079155] [2021-11-20 07:26:42,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:42,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:42,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:42,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:26:42,717 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:42,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619079155] [2021-11-20 07:26:42,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619079155] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:42,718 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:42,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 07:26:42,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498786773] [2021-11-20 07:26:42,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:42,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 07:26:42,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:42,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 07:26:42,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 07:26:42,758 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-11-20 07:26:42,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:42,915 INFO L93 Difference]: Finished difference Result 373 states and 637 transitions. [2021-11-20 07:26:42,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 07:26:42,932 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-11-20 07:26:42,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:42,944 INFO L225 Difference]: With dead ends: 373 [2021-11-20 07:26:42,945 INFO L226 Difference]: Without dead ends: 188 [2021-11-20 07:26:42,951 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-11-20 07:26:42,955 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.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:26:42,956 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.1s Time] [2021-11-20 07:26:42,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-11-20 07:26:43,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2021-11-20 07:26:43,051 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-11-20 07:26:43,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 289 transitions. [2021-11-20 07:26:43,063 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 289 transitions. Word has length 15 [2021-11-20 07:26:43,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:43,063 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 289 transitions. [2021-11-20 07:26:43,064 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-11-20 07:26:43,064 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 289 transitions. [2021-11-20 07:26:43,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-20 07:26:43,069 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:43,069 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:26:43,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-20 07:26:43,070 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:43,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:43,072 INFO L85 PathProgramCache]: Analyzing trace with hash -621436427, now seen corresponding path program 1 times [2021-11-20 07:26:43,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:43,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219334019] [2021-11-20 07:26:43,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:43,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:43,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:26:43,175 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:43,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219334019] [2021-11-20 07:26:43,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219334019] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:43,177 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:43,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 07:26:43,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885339072] [2021-11-20 07:26:43,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:43,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 07:26:43,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:43,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 07:26:43,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 07:26:43,182 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-11-20 07:26:43,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:43,269 INFO L93 Difference]: Finished difference Result 385 states and 601 transitions. [2021-11-20 07:26:43,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 07:26:43,271 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-11-20 07:26:43,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:43,279 INFO L225 Difference]: With dead ends: 385 [2021-11-20 07:26:43,279 INFO L226 Difference]: Without dead ends: 202 [2021-11-20 07:26:43,289 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-11-20 07:26:43,291 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-11-20 07:26:43,291 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-11-20 07:26:43,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-11-20 07:26:43,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 199. [2021-11-20 07:26:43,330 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-11-20 07:26:43,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 305 transitions. [2021-11-20 07:26:43,334 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 305 transitions. Word has length 16 [2021-11-20 07:26:43,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:43,335 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 305 transitions. [2021-11-20 07:26:43,336 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-11-20 07:26:43,336 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 305 transitions. [2021-11-20 07:26:43,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-20 07:26:43,341 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:43,342 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-11-20 07:26:43,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-20 07:26:43,343 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:43,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:43,343 INFO L85 PathProgramCache]: Analyzing trace with hash -741910715, now seen corresponding path program 1 times [2021-11-20 07:26:43,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:43,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600769611] [2021-11-20 07:26:43,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:43,345 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:43,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:26:43,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:43,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:26:43,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:43,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600769611] [2021-11-20 07:26:43,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600769611] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:43,447 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:43,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-20 07:26:43,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808122375] [2021-11-20 07:26:43,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:43,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 07:26:43,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:43,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 07:26:43,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 07:26:43,450 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-11-20 07:26:43,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:43,479 INFO L93 Difference]: Finished difference Result 417 states and 647 transitions. [2021-11-20 07:26:43,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 07:26:43,480 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-11-20 07:26:43,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:43,483 INFO L225 Difference]: With dead ends: 417 [2021-11-20 07:26:43,484 INFO L226 Difference]: Without dead ends: 228 [2021-11-20 07:26:43,485 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-11-20 07:26:43,486 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-11-20 07:26:43,486 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-11-20 07:26:43,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-11-20 07:26:43,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 201. [2021-11-20 07:26:43,509 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-11-20 07:26:43,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 307 transitions. [2021-11-20 07:26:43,511 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 307 transitions. Word has length 23 [2021-11-20 07:26:43,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:43,512 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 307 transitions. [2021-11-20 07:26:43,512 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-11-20 07:26:43,512 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 307 transitions. [2021-11-20 07:26:43,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 07:26:43,516 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:43,517 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-11-20 07:26:43,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-20 07:26:43,517 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:43,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:43,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1197019830, now seen corresponding path program 1 times [2021-11-20 07:26:43,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:43,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363507078] [2021-11-20 07:26:43,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:43,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:43,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:26:43,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:43,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:26:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:43,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:26:43,641 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:43,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363507078] [2021-11-20 07:26:43,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363507078] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:43,642 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:43,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 07:26:43,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516830982] [2021-11-20 07:26:43,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:43,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 07:26:43,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:43,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 07:26:43,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 07:26:43,644 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-11-20 07:26:43,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:43,688 INFO L93 Difference]: Finished difference Result 457 states and 714 transitions. [2021-11-20 07:26:43,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 07:26:43,689 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-11-20 07:26:43,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:43,692 INFO L225 Difference]: With dead ends: 457 [2021-11-20 07:26:43,692 INFO L226 Difference]: Without dead ends: 307 [2021-11-20 07:26:43,693 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-11-20 07:26:43,695 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-11-20 07:26:43,695 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-11-20 07:26:43,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-11-20 07:26:43,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 201. [2021-11-20 07:26:43,710 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-11-20 07:26:43,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 303 transitions. [2021-11-20 07:26:43,713 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 303 transitions. Word has length 31 [2021-11-20 07:26:43,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:43,713 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 303 transitions. [2021-11-20 07:26:43,713 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-11-20 07:26:43,714 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 303 transitions. [2021-11-20 07:26:43,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-20 07:26:43,715 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:43,715 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-11-20 07:26:43,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-20 07:26:43,716 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:43,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:43,716 INFO L85 PathProgramCache]: Analyzing trace with hash -422396736, now seen corresponding path program 1 times [2021-11-20 07:26:43,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:43,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045472371] [2021-11-20 07:26:43,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:43,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:43,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:26:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:43,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:26:43,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:43,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:26:43,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:43,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045472371] [2021-11-20 07:26:43,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045472371] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:43,786 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:43,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 07:26:43,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729755890] [2021-11-20 07:26:43,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:43,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 07:26:43,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:43,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 07:26:43,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 07:26:43,788 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-11-20 07:26:43,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:43,815 INFO L93 Difference]: Finished difference Result 392 states and 595 transitions. [2021-11-20 07:26:43,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 07:26:43,815 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-11-20 07:26:43,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:43,818 INFO L225 Difference]: With dead ends: 392 [2021-11-20 07:26:43,818 INFO L226 Difference]: Without dead ends: 203 [2021-11-20 07:26:43,819 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-11-20 07:26:43,820 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-11-20 07:26:43,820 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-11-20 07:26:43,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-11-20 07:26:43,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2021-11-20 07:26:43,837 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-11-20 07:26:43,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 302 transitions. [2021-11-20 07:26:43,840 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 302 transitions. Word has length 32 [2021-11-20 07:26:43,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:43,841 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 302 transitions. [2021-11-20 07:26:43,841 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-11-20 07:26:43,841 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 302 transitions. [2021-11-20 07:26:43,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-20 07:26:43,843 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:43,843 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-11-20 07:26:43,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-20 07:26:43,844 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:43,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:43,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1664815819, now seen corresponding path program 1 times [2021-11-20 07:26:43,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:43,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287786287] [2021-11-20 07:26:43,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:43,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:43,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:26:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:43,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:26:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:43,940 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:26:43,940 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:43,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287786287] [2021-11-20 07:26:43,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287786287] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:26:43,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064142959] [2021-11-20 07:26:43,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:43,941 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:26:43,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:26:43,948 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:26:43,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-20 07:26:44,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:44,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-20 07:26:44,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:26:44,259 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:26:44,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:26:44,368 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:26:44,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064142959] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 07:26:44,369 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 07:26:44,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-11-20 07:26:44,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746895301] [2021-11-20 07:26:44,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 07:26:44,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 07:26:44,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:44,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 07:26:44,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-20 07:26:44,372 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-11-20 07:26:44,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:44,420 INFO L93 Difference]: Finished difference Result 450 states and 691 transitions. [2021-11-20 07:26:44,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 07:26:44,420 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-11-20 07:26:44,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:44,423 INFO L225 Difference]: With dead ends: 450 [2021-11-20 07:26:44,424 INFO L226 Difference]: Without dead ends: 260 [2021-11-20 07:26:44,425 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-11-20 07:26:44,426 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-11-20 07:26:44,426 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-11-20 07:26:44,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-11-20 07:26:44,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 254. [2021-11-20 07:26:44,442 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-11-20 07:26:44,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 381 transitions. [2021-11-20 07:26:44,445 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 381 transitions. Word has length 35 [2021-11-20 07:26:44,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:44,446 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 381 transitions. [2021-11-20 07:26:44,446 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-11-20 07:26:44,446 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 381 transitions. [2021-11-20 07:26:44,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-20 07:26:44,448 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:44,448 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-11-20 07:26:44,487 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-20 07:26:44,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:26:44,676 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:44,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:44,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1225495307, now seen corresponding path program 2 times [2021-11-20 07:26:44,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:44,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253980988] [2021-11-20 07:26:44,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:44,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:44,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:26:44,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:44,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:26:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:44,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:26:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:44,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:26:44,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:44,748 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-11-20 07:26:44,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:44,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253980988] [2021-11-20 07:26:44,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253980988] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:44,749 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:44,749 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 07:26:44,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246524279] [2021-11-20 07:26:44,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:44,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 07:26:44,750 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:44,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 07:26:44,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 07:26:44,751 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-11-20 07:26:44,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:44,797 INFO L93 Difference]: Finished difference Result 518 states and 788 transitions. [2021-11-20 07:26:44,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 07:26:44,798 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-11-20 07:26:44,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:44,801 INFO L225 Difference]: With dead ends: 518 [2021-11-20 07:26:44,801 INFO L226 Difference]: Without dead ends: 293 [2021-11-20 07:26:44,802 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-11-20 07:26:44,803 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-11-20 07:26:44,804 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-11-20 07:26:44,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-11-20 07:26:44,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 290. [2021-11-20 07:26:44,817 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-11-20 07:26:44,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 424 transitions. [2021-11-20 07:26:44,820 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 424 transitions. Word has length 57 [2021-11-20 07:26:44,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:44,820 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 424 transitions. [2021-11-20 07:26:44,820 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-11-20 07:26:44,821 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 424 transitions. [2021-11-20 07:26:44,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-20 07:26:44,822 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:44,822 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-11-20 07:26:44,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-20 07:26:44,823 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:44,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:44,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1867707356, now seen corresponding path program 1 times [2021-11-20 07:26:44,823 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:44,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047845198] [2021-11-20 07:26:44,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:44,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:44,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:26:44,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:44,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:26:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:44,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:26:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:44,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:26:44,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:44,915 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-11-20 07:26:44,915 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:44,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047845198] [2021-11-20 07:26:44,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047845198] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:44,916 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:44,916 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 07:26:44,916 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177538213] [2021-11-20 07:26:44,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:44,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 07:26:44,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:44,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 07:26:44,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 07:26:44,918 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-11-20 07:26:44,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:44,969 INFO L93 Difference]: Finished difference Result 555 states and 835 transitions. [2021-11-20 07:26:44,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 07:26:44,969 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-11-20 07:26:44,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:44,977 INFO L225 Difference]: With dead ends: 555 [2021-11-20 07:26:44,977 INFO L226 Difference]: Without dead ends: 299 [2021-11-20 07:26:44,979 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-11-20 07:26:44,980 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-11-20 07:26:44,980 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-11-20 07:26:44,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-11-20 07:26:45,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2021-11-20 07:26:45,006 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-11-20 07:26:45,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 432 transitions. [2021-11-20 07:26:45,010 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 432 transitions. Word has length 57 [2021-11-20 07:26:45,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:45,013 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 432 transitions. [2021-11-20 07:26:45,013 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-11-20 07:26:45,013 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 432 transitions. [2021-11-20 07:26:45,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-20 07:26:45,015 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:45,015 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-11-20 07:26:45,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-20 07:26:45,015 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:45,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:45,016 INFO L85 PathProgramCache]: Analyzing trace with hash -917641064, now seen corresponding path program 1 times [2021-11-20 07:26:45,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:45,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840340205] [2021-11-20 07:26:45,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:45,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:45,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:26:45,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:26:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:26:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:26:45,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:26:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:45,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,109 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-20 07:26:45,109 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:45,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840340205] [2021-11-20 07:26:45,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840340205] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:45,110 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:45,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 07:26:45,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009657458] [2021-11-20 07:26:45,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:45,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 07:26:45,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:45,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 07:26:45,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 07:26:45,112 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-11-20 07:26:45,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:45,144 INFO L93 Difference]: Finished difference Result 543 states and 803 transitions. [2021-11-20 07:26:45,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 07:26:45,145 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-11-20 07:26:45,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:45,147 INFO L225 Difference]: With dead ends: 543 [2021-11-20 07:26:45,147 INFO L226 Difference]: Without dead ends: 299 [2021-11-20 07:26:45,149 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-11-20 07:26:45,149 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-11-20 07:26:45,150 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-11-20 07:26:45,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-11-20 07:26:45,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2021-11-20 07:26:45,162 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-11-20 07:26:45,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 429 transitions. [2021-11-20 07:26:45,165 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 429 transitions. Word has length 75 [2021-11-20 07:26:45,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:45,165 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 429 transitions. [2021-11-20 07:26:45,166 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-11-20 07:26:45,166 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 429 transitions. [2021-11-20 07:26:45,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-20 07:26:45,167 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:45,167 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-11-20 07:26:45,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-20 07:26:45,168 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:45,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:45,168 INFO L85 PathProgramCache]: Analyzing trace with hash -276575053, now seen corresponding path program 1 times [2021-11-20 07:26:45,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:45,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304158089] [2021-11-20 07:26:45,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:45,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:26:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:26:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:26:45,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:26:45,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:26:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:26:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:26:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,254 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-11-20 07:26:45,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:45,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304158089] [2021-11-20 07:26:45,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304158089] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:45,255 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:45,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 07:26:45,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239109067] [2021-11-20 07:26:45,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:45,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 07:26:45,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:45,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 07:26:45,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 07:26:45,257 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-11-20 07:26:45,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:45,303 INFO L93 Difference]: Finished difference Result 580 states and 859 transitions. [2021-11-20 07:26:45,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 07:26:45,303 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-11-20 07:26:45,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:45,307 INFO L225 Difference]: With dead ends: 580 [2021-11-20 07:26:45,307 INFO L226 Difference]: Without dead ends: 341 [2021-11-20 07:26:45,308 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-11-20 07:26:45,309 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-11-20 07:26:45,309 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-11-20 07:26:45,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-11-20 07:26:45,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 338. [2021-11-20 07:26:45,322 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-11-20 07:26:45,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 477 transitions. [2021-11-20 07:26:45,325 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 477 transitions. Word has length 104 [2021-11-20 07:26:45,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:45,325 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 477 transitions. [2021-11-20 07:26:45,326 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-11-20 07:26:45,326 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 477 transitions. [2021-11-20 07:26:45,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-11-20 07:26:45,327 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:45,327 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-11-20 07:26:45,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-20 07:26:45,327 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:45,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:45,328 INFO L85 PathProgramCache]: Analyzing trace with hash -92526865, now seen corresponding path program 1 times [2021-11-20 07:26:45,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:45,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889392126] [2021-11-20 07:26:45,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:45,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:26:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:26:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:26:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:26:45,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:26:45,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:26:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:26:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,434 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-11-20 07:26:45,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:45,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889392126] [2021-11-20 07:26:45,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889392126] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:45,435 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:45,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 07:26:45,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661360264] [2021-11-20 07:26:45,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:45,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 07:26:45,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:45,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 07:26:45,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 07:26:45,437 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-11-20 07:26:45,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:45,485 INFO L93 Difference]: Finished difference Result 606 states and 879 transitions. [2021-11-20 07:26:45,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 07:26:45,486 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-11-20 07:26:45,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:45,489 INFO L225 Difference]: With dead ends: 606 [2021-11-20 07:26:45,489 INFO L226 Difference]: Without dead ends: 332 [2021-11-20 07:26:45,490 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-11-20 07:26:45,491 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-11-20 07:26:45,491 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-11-20 07:26:45,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-11-20 07:26:45,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2021-11-20 07:26:45,506 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-11-20 07:26:45,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 463 transitions. [2021-11-20 07:26:45,512 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 463 transitions. Word has length 105 [2021-11-20 07:26:45,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:45,513 INFO L470 AbstractCegarLoop]: Abstraction has 332 states and 463 transitions. [2021-11-20 07:26:45,513 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-11-20 07:26:45,513 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 463 transitions. [2021-11-20 07:26:45,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-20 07:26:45,514 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:45,515 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-11-20 07:26:45,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-20 07:26:45,515 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:45,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:45,515 INFO L85 PathProgramCache]: Analyzing trace with hash -440553643, now seen corresponding path program 1 times [2021-11-20 07:26:45,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:45,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701906546] [2021-11-20 07:26:45,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:45,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:26:45,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:26:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:26:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:26:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:26:45,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:26:45,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:26:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:26:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:26:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,678 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2021-11-20 07:26:45,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:45,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701906546] [2021-11-20 07:26:45,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701906546] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:45,679 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:45,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 07:26:45,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149114615] [2021-11-20 07:26:45,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:45,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 07:26:45,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:45,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 07:26:45,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 07:26:45,682 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-11-20 07:26:45,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:45,706 INFO L93 Difference]: Finished difference Result 581 states and 828 transitions. [2021-11-20 07:26:45,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 07:26:45,706 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-11-20 07:26:45,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:45,709 INFO L225 Difference]: With dead ends: 581 [2021-11-20 07:26:45,709 INFO L226 Difference]: Without dead ends: 334 [2021-11-20 07:26:45,711 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-11-20 07:26:45,711 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-11-20 07:26:45,712 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-11-20 07:26:45,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-11-20 07:26:45,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2021-11-20 07:26:45,724 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-11-20 07:26:45,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 460 transitions. [2021-11-20 07:26:45,727 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 460 transitions. Word has length 124 [2021-11-20 07:26:45,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:45,727 INFO L470 AbstractCegarLoop]: Abstraction has 332 states and 460 transitions. [2021-11-20 07:26:45,727 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-11-20 07:26:45,728 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 460 transitions. [2021-11-20 07:26:45,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-11-20 07:26:45,732 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:45,732 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-11-20 07:26:45,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-20 07:26:45,733 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:45,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:45,733 INFO L85 PathProgramCache]: Analyzing trace with hash -37757066, now seen corresponding path program 1 times [2021-11-20 07:26:45,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:45,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549022781] [2021-11-20 07:26:45,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:45,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:26:45,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:26:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:26:45,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:26:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:26:45,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:26:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:26:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:26:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:26:45,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:26:45,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:26:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:45,860 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2021-11-20 07:26:45,861 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:45,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549022781] [2021-11-20 07:26:45,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549022781] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:45,861 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:45,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 07:26:45,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785586704] [2021-11-20 07:26:45,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:45,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 07:26:45,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:45,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 07:26:45,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 07:26:45,863 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-11-20 07:26:45,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:45,924 INFO L93 Difference]: Finished difference Result 544 states and 788 transitions. [2021-11-20 07:26:45,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 07:26:45,925 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-11-20 07:26:45,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:45,927 INFO L225 Difference]: With dead ends: 544 [2021-11-20 07:26:45,928 INFO L226 Difference]: Without dead ends: 330 [2021-11-20 07:26:45,931 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-11-20 07:26:45,932 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-11-20 07:26:45,932 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-11-20 07:26:45,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-11-20 07:26:45,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2021-11-20 07:26:45,945 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-11-20 07:26:45,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 456 transitions. [2021-11-20 07:26:45,948 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 456 transitions. Word has length 157 [2021-11-20 07:26:45,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:45,949 INFO L470 AbstractCegarLoop]: Abstraction has 330 states and 456 transitions. [2021-11-20 07:26:45,949 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-11-20 07:26:45,949 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 456 transitions. [2021-11-20 07:26:45,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-11-20 07:26:45,951 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:45,952 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-11-20 07:26:45,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-20 07:26:45,952 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:45,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:45,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1460013805, now seen corresponding path program 1 times [2021-11-20 07:26:45,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:45,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995456829] [2021-11-20 07:26:45,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:45,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:26:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:26:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:26:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:26:46,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:26:46,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:26:46,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:26:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:26:46,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:26:46,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:26:46,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:26:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:26:46,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:26:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,097 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2021-11-20 07:26:46,097 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:46,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995456829] [2021-11-20 07:26:46,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995456829] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:46,098 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:46,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 07:26:46,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398875289] [2021-11-20 07:26:46,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:46,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 07:26:46,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:46,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 07:26:46,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 07:26:46,100 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-11-20 07:26:46,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:46,174 INFO L93 Difference]: Finished difference Result 484 states and 684 transitions. [2021-11-20 07:26:46,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 07:26:46,174 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-11-20 07:26:46,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:46,177 INFO L225 Difference]: With dead ends: 484 [2021-11-20 07:26:46,177 INFO L226 Difference]: Without dead ends: 313 [2021-11-20 07:26:46,178 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-11-20 07:26:46,179 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-11-20 07:26:46,179 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-11-20 07:26:46,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2021-11-20 07:26:46,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2021-11-20 07:26:46,191 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-11-20 07:26:46,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 429 transitions. [2021-11-20 07:26:46,193 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 429 transitions. Word has length 172 [2021-11-20 07:26:46,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:46,194 INFO L470 AbstractCegarLoop]: Abstraction has 313 states and 429 transitions. [2021-11-20 07:26:46,194 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-11-20 07:26:46,194 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 429 transitions. [2021-11-20 07:26:46,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-11-20 07:26:46,197 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:46,197 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-11-20 07:26:46,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-20 07:26:46,198 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:46,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:46,198 INFO L85 PathProgramCache]: Analyzing trace with hash 409048779, now seen corresponding path program 1 times [2021-11-20 07:26:46,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:46,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429706605] [2021-11-20 07:26:46,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:46,199 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:46,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:26:46,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:26:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:26:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:26:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:26:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:26:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:26:46,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:26:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:26:46,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:26:46,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:26:46,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:26:46,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:46,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,314 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2021-11-20 07:26:46,314 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:46,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429706605] [2021-11-20 07:26:46,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429706605] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:46,314 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:46,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 07:26:46,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817018910] [2021-11-20 07:26:46,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:46,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 07:26:46,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:46,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 07:26:46,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 07:26:46,318 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-11-20 07:26:46,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:46,371 INFO L93 Difference]: Finished difference Result 467 states and 657 transitions. [2021-11-20 07:26:46,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 07:26:46,372 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-11-20 07:26:46,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:46,375 INFO L225 Difference]: With dead ends: 467 [2021-11-20 07:26:46,375 INFO L226 Difference]: Without dead ends: 294 [2021-11-20 07:26:46,377 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-11-20 07:26:46,379 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-11-20 07:26:46,379 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-11-20 07:26:46,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-11-20 07:26:46,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2021-11-20 07:26:46,390 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-11-20 07:26:46,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 400 transitions. [2021-11-20 07:26:46,393 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 400 transitions. Word has length 174 [2021-11-20 07:26:46,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:46,393 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 400 transitions. [2021-11-20 07:26:46,394 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-11-20 07:26:46,394 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 400 transitions. [2021-11-20 07:26:46,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-11-20 07:26:46,396 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:46,396 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-11-20 07:26:46,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-20 07:26:46,397 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:46,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:46,397 INFO L85 PathProgramCache]: Analyzing trace with hash 222848508, now seen corresponding path program 1 times [2021-11-20 07:26:46,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:46,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937160138] [2021-11-20 07:26:46,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:46,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:26:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:26:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:26:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:26:46,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:26:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:26:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:26:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:26:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:26:46,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:26:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:26:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:26:46,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:26:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,526 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2021-11-20 07:26:46,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:46,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937160138] [2021-11-20 07:26:46,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937160138] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:46,527 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:46,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 07:26:46,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702697669] [2021-11-20 07:26:46,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:46,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 07:26:46,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:46,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 07:26:46,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 07:26:46,528 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-11-20 07:26:46,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:46,548 INFO L93 Difference]: Finished difference Result 447 states and 627 transitions. [2021-11-20 07:26:46,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 07:26:46,549 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-11-20 07:26:46,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:46,551 INFO L225 Difference]: With dead ends: 447 [2021-11-20 07:26:46,552 INFO L226 Difference]: Without dead ends: 294 [2021-11-20 07:26:46,552 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-11-20 07:26:46,553 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-11-20 07:26:46,553 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-11-20 07:26:46,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-11-20 07:26:46,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2021-11-20 07:26:46,588 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-11-20 07:26:46,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 394 transitions. [2021-11-20 07:26:46,591 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 394 transitions. Word has length 175 [2021-11-20 07:26:46,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:46,592 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 394 transitions. [2021-11-20 07:26:46,592 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-11-20 07:26:46,592 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 394 transitions. [2021-11-20 07:26:46,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2021-11-20 07:26:46,596 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:46,596 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-11-20 07:26:46,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-20 07:26:46,596 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:46,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:46,597 INFO L85 PathProgramCache]: Analyzing trace with hash 312728436, now seen corresponding path program 1 times [2021-11-20 07:26:46,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:46,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194739943] [2021-11-20 07:26:46,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:46,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:26:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:26:46,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:26:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:26:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:26:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:26:46,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:26:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:26:46,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:26:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:26:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:26:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:26:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,733 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2021-11-20 07:26:46,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:46,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194739943] [2021-11-20 07:26:46,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194739943] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:26:46,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523209168] [2021-11-20 07:26:46,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:46,734 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:26:46,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:26:46,739 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:26:46,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-20 07:26:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:46,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 07:26:46,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:26:47,213 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2021-11-20 07:26:47,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:26:47,582 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2021-11-20 07:26:47,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523209168] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-20 07:26:47,583 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-20 07:26:47,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2021-11-20 07:26:47,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589081328] [2021-11-20 07:26:47,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:47,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 07:26:47,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:47,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 07:26:47,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-20 07:26:47,586 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-11-20 07:26:47,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:47,630 INFO L93 Difference]: Finished difference Result 468 states and 649 transitions. [2021-11-20 07:26:47,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 07:26:47,631 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-11-20 07:26:47,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:47,634 INFO L225 Difference]: With dead ends: 468 [2021-11-20 07:26:47,634 INFO L226 Difference]: Without dead ends: 273 [2021-11-20 07:26:47,635 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-11-20 07:26:47,636 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-11-20 07:26:47,636 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-11-20 07:26:47,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-11-20 07:26:47,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2021-11-20 07:26:47,648 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-11-20 07:26:47,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 363 transitions. [2021-11-20 07:26:47,651 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 363 transitions. Word has length 182 [2021-11-20 07:26:47,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:47,651 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 363 transitions. [2021-11-20 07:26:47,652 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-11-20 07:26:47,652 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 363 transitions. [2021-11-20 07:26:47,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2021-11-20 07:26:47,655 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:47,655 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-11-20 07:26:47,693 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-20 07:26:47,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-20 07:26:47,884 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:47,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:47,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1687421607, now seen corresponding path program 1 times [2021-11-20 07:26:47,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:47,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126248735] [2021-11-20 07:26:47,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:47,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:47,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:26:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:47,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:26:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:47,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:26:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:47,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:26:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:47,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:26:47,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:47,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:47,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:47,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:26:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:47,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:26:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:47,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:26:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:47,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:26:47,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:47,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:26:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:47,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:26:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:47,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:26:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:47,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:26:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:48,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:26:48,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:48,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-20 07:26:48,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:48,006 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2021-11-20 07:26:48,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:48,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126248735] [2021-11-20 07:26:48,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126248735] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:48,007 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:48,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 07:26:48,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740122869] [2021-11-20 07:26:48,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:48,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 07:26:48,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:48,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 07:26:48,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 07:26:48,009 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-11-20 07:26:48,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:48,052 INFO L93 Difference]: Finished difference Result 425 states and 591 transitions. [2021-11-20 07:26:48,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 07:26:48,052 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-11-20 07:26:48,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:48,055 INFO L225 Difference]: With dead ends: 425 [2021-11-20 07:26:48,055 INFO L226 Difference]: Without dead ends: 279 [2021-11-20 07:26:48,056 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-11-20 07:26:48,057 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-11-20 07:26:48,057 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-11-20 07:26:48,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-11-20 07:26:48,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2021-11-20 07:26:48,068 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-11-20 07:26:48,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 366 transitions. [2021-11-20 07:26:48,070 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 366 transitions. Word has length 206 [2021-11-20 07:26:48,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:48,072 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 366 transitions. [2021-11-20 07:26:48,072 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-11-20 07:26:48,072 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 366 transitions. [2021-11-20 07:26:48,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2021-11-20 07:26:48,075 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:48,075 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-11-20 07:26:48,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-20 07:26:48,076 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:48,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:48,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1286095815, now seen corresponding path program 1 times [2021-11-20 07:26:48,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:48,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780961272] [2021-11-20 07:26:48,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:48,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:48,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:48,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:26:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:48,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:26:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:48,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:26:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:48,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:26:48,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:48,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:26:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:48,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:48,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:26:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:48,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:26:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:48,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:26:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:48,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:26:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:48,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:26:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:48,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:26:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:48,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:26:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:48,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:26:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:48,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:26:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:48,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-20 07:26:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:48,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-20 07:26:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:48,234 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2021-11-20 07:26:48,235 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:48,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780961272] [2021-11-20 07:26:48,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780961272] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:26:48,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239475732] [2021-11-20 07:26:48,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:48,236 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:26:48,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:26:48,240 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:26:48,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-20 07:26:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:48,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 07:26:48,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:26:48,750 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2021-11-20 07:26:48,750 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 07:26:48,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239475732] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:48,750 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 07:26:48,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-11-20 07:26:48,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809051364] [2021-11-20 07:26:48,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:48,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 07:26:48,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:48,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 07:26:48,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 07:26:48,753 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-11-20 07:26:48,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:48,784 INFO L93 Difference]: Finished difference Result 434 states and 598 transitions. [2021-11-20 07:26:48,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 07:26:48,785 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-11-20 07:26:48,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:48,789 INFO L225 Difference]: With dead ends: 434 [2021-11-20 07:26:48,789 INFO L226 Difference]: Without dead ends: 284 [2021-11-20 07:26:48,790 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-11-20 07:26:48,791 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-11-20 07:26:48,791 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-11-20 07:26:48,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-11-20 07:26:48,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2021-11-20 07:26:48,801 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-11-20 07:26:48,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 370 transitions. [2021-11-20 07:26:48,804 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 370 transitions. Word has length 215 [2021-11-20 07:26:48,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:48,806 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 370 transitions. [2021-11-20 07:26:48,807 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-11-20 07:26:48,807 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 370 transitions. [2021-11-20 07:26:48,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2021-11-20 07:26:48,811 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:48,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, 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-11-20 07:26:48,846 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-20 07:26:49,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:26:49,020 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:49,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:49,021 INFO L85 PathProgramCache]: Analyzing trace with hash -690820591, now seen corresponding path program 1 times [2021-11-20 07:26:49,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:49,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081534502] [2021-11-20 07:26:49,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:49,021 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:49,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:26:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:49,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:26:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:49,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:26:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:49,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:26:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:49,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:26:49,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:49,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:49,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:26:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:49,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:26:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:49,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:26:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:49,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:26:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:49,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:26:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:49,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:26:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:49,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:26:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:49,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:26:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:49,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:26:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:49,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-20 07:26:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:49,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-20 07:26:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:49,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-11-20 07:26:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:49,169 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2021-11-20 07:26:49,169 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:49,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081534502] [2021-11-20 07:26:49,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081534502] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:26:49,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599489719] [2021-11-20 07:26:49,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:49,170 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:26:49,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:26:49,175 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:26:49,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-20 07:26:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:49,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 07:26:49,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:26:49,686 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2021-11-20 07:26:49,686 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 07:26:49,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599489719] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:49,686 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 07:26:49,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-11-20 07:26:49,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149301040] [2021-11-20 07:26:49,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:49,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 07:26:49,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:49,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 07:26:49,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 07:26:49,692 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-11-20 07:26:49,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:49,723 INFO L93 Difference]: Finished difference Result 436 states and 596 transitions. [2021-11-20 07:26:49,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 07:26:49,724 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-11-20 07:26:49,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:49,727 INFO L225 Difference]: With dead ends: 436 [2021-11-20 07:26:49,727 INFO L226 Difference]: Without dead ends: 281 [2021-11-20 07:26:49,728 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-11-20 07:26:49,729 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-11-20 07:26:49,729 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-11-20 07:26:49,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-11-20 07:26:49,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2021-11-20 07:26:49,743 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-11-20 07:26:49,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 365 transitions. [2021-11-20 07:26:49,745 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 365 transitions. Word has length 225 [2021-11-20 07:26:49,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:49,746 INFO L470 AbstractCegarLoop]: Abstraction has 281 states and 365 transitions. [2021-11-20 07:26:49,746 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-11-20 07:26:49,746 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 365 transitions. [2021-11-20 07:26:49,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2021-11-20 07:26:49,751 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:49,751 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-11-20 07:26:49,789 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-20 07:26:49,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:26:49,968 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:49,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:49,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1815976528, now seen corresponding path program 1 times [2021-11-20 07:26:49,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:49,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121996227] [2021-11-20 07:26:49,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:49,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:26:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:26:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:26:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:26:50,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:26:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:26:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:26:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:26:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:26:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:26:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:26:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:26:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:26:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:26:50,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-20 07:26:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-20 07:26:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-11-20 07:26:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-11-20 07:26:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,100 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2021-11-20 07:26:50,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:50,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121996227] [2021-11-20 07:26:50,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121996227] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:50,101 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:50,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 07:26:50,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548744053] [2021-11-20 07:26:50,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:50,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 07:26:50,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:50,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 07:26:50,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 07:26:50,106 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-11-20 07:26:50,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:50,356 INFO L93 Difference]: Finished difference Result 478 states and 656 transitions. [2021-11-20 07:26:50,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 07:26:50,356 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-11-20 07:26:50,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:50,359 INFO L225 Difference]: With dead ends: 478 [2021-11-20 07:26:50,359 INFO L226 Difference]: Without dead ends: 324 [2021-11-20 07:26:50,360 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-11-20 07:26:50,361 INFO L933 BasicCegarLoop]: 313 mSDtfsCounter, 185 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2021-11-20 07:26:50,361 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.2s Time] [2021-11-20 07:26:50,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-11-20 07:26:50,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 280. [2021-11-20 07:26:50,375 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-11-20 07:26:50,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 362 transitions. [2021-11-20 07:26:50,378 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 362 transitions. Word has length 234 [2021-11-20 07:26:50,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:50,379 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 362 transitions. [2021-11-20 07:26:50,379 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-11-20 07:26:50,379 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 362 transitions. [2021-11-20 07:26:50,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2021-11-20 07:26:50,382 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:50,383 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-11-20 07:26:50,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-20 07:26:50,383 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:50,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:50,384 INFO L85 PathProgramCache]: Analyzing trace with hash 869606888, now seen corresponding path program 1 times [2021-11-20 07:26:50,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:50,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006082099] [2021-11-20 07:26:50,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:50,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:26:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:26:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:26:50,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:26:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:26:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:26:50,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:26:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:26:50,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:26:50,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:26:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:26:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:26:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:26:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:26:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-20 07:26:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-20 07:26:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-11-20 07:26:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-11-20 07:26:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:50,596 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2021-11-20 07:26:50,597 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:50,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006082099] [2021-11-20 07:26:50,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006082099] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:50,597 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:50,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 07:26:50,598 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098468985] [2021-11-20 07:26:50,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:50,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 07:26:50,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:50,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 07:26:50,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 07:26:50,599 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-11-20 07:26:51,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:51,078 INFO L93 Difference]: Finished difference Result 657 states and 878 transitions. [2021-11-20 07:26:51,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 07:26:51,079 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-11-20 07:26:51,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:51,084 INFO L225 Difference]: With dead ends: 657 [2021-11-20 07:26:51,084 INFO L226 Difference]: Without dead ends: 504 [2021-11-20 07:26:51,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-20 07:26:51,090 INFO L933 BasicCegarLoop]: 329 mSDtfsCounter, 419 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2021-11-20 07:26:51,090 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.4s Time] [2021-11-20 07:26:51,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2021-11-20 07:26:51,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 441. [2021-11-20 07:26:51,121 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-11-20 07:26:51,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 579 transitions. [2021-11-20 07:26:51,125 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 579 transitions. Word has length 237 [2021-11-20 07:26:51,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:51,126 INFO L470 AbstractCegarLoop]: Abstraction has 441 states and 579 transitions. [2021-11-20 07:26:51,126 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-11-20 07:26:51,126 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 579 transitions. [2021-11-20 07:26:51,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2021-11-20 07:26:51,149 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:51,150 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-11-20 07:26:51,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-20 07:26:51,150 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:51,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:51,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1758726155, now seen corresponding path program 1 times [2021-11-20 07:26:51,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:51,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496524749] [2021-11-20 07:26:51,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:51,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:26:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:26:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:26:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:26:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:26:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:26:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:26:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:26:51,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:26:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:26:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:26:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:26:51,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:26:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:26:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-20 07:26:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-20 07:26:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-11-20 07:26:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-11-20 07:26:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2021-11-20 07:26:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2021-11-20 07:26:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2021-11-20 07:26:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,371 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2021-11-20 07:26:51,372 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:51,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496524749] [2021-11-20 07:26:51,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496524749] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:51,372 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:51,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 07:26:51,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751026145] [2021-11-20 07:26:51,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:51,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 07:26:51,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:51,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 07:26:51,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 07:26:51,375 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-11-20 07:26:51,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:51,726 INFO L93 Difference]: Finished difference Result 932 states and 1277 transitions. [2021-11-20 07:26:51,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 07:26:51,727 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-11-20 07:26:51,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:51,732 INFO L225 Difference]: With dead ends: 932 [2021-11-20 07:26:51,732 INFO L226 Difference]: Without dead ends: 695 [2021-11-20 07:26:51,733 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-11-20 07:26:51,734 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.3s IncrementalHoareTripleChecker+Time [2021-11-20 07:26:51,734 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.3s Time] [2021-11-20 07:26:51,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2021-11-20 07:26:51,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 533. [2021-11-20 07:26:51,772 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-11-20 07:26:51,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 700 transitions. [2021-11-20 07:26:51,776 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 700 transitions. Word has length 264 [2021-11-20 07:26:51,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:51,777 INFO L470 AbstractCegarLoop]: Abstraction has 533 states and 700 transitions. [2021-11-20 07:26:51,777 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-11-20 07:26:51,777 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 700 transitions. [2021-11-20 07:26:51,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2021-11-20 07:26:51,781 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:51,782 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-11-20 07:26:51,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-20 07:26:51,782 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:51,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:51,783 INFO L85 PathProgramCache]: Analyzing trace with hash -378112666, now seen corresponding path program 1 times [2021-11-20 07:26:51,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:51,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688210682] [2021-11-20 07:26:51,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:51,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:51,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:26:51,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:26:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:26:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:26:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:26:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:26:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:26:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:26:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:26:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:26:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:26:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:26:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:26:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:26:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-20 07:26:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-20 07:26:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-11-20 07:26:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:51,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-11-20 07:26:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:52,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2021-11-20 07:26:52,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:52,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2021-11-20 07:26:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:52,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2021-11-20 07:26:52,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:52,017 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2021-11-20 07:26:52,018 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:52,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688210682] [2021-11-20 07:26:52,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688210682] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:52,018 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:26:52,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 07:26:52,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025096175] [2021-11-20 07:26:52,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:52,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 07:26:52,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:52,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 07:26:52,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 07:26:52,020 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-11-20 07:26:52,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:52,366 INFO L93 Difference]: Finished difference Result 1127 states and 1536 transitions. [2021-11-20 07:26:52,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 07:26:52,367 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-11-20 07:26:52,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:52,373 INFO L225 Difference]: With dead ends: 1127 [2021-11-20 07:26:52,373 INFO L226 Difference]: Without dead ends: 833 [2021-11-20 07:26:52,375 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-11-20 07:26:52,376 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.3s IncrementalHoareTripleChecker+Time [2021-11-20 07:26:52,376 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.3s Time] [2021-11-20 07:26:52,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2021-11-20 07:26:52,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 655. [2021-11-20 07:26:52,429 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-11-20 07:26:52,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 862 transitions. [2021-11-20 07:26:52,434 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 862 transitions. Word has length 265 [2021-11-20 07:26:52,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:52,435 INFO L470 AbstractCegarLoop]: Abstraction has 655 states and 862 transitions. [2021-11-20 07:26:52,435 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-11-20 07:26:52,435 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 862 transitions. [2021-11-20 07:26:52,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2021-11-20 07:26:52,440 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:52,440 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-11-20 07:26:52,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-20 07:26:52,441 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:52,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:52,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1594763960, now seen corresponding path program 1 times [2021-11-20 07:26:52,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:52,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457670549] [2021-11-20 07:26:52,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:52,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:52,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:26:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:52,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:26:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:52,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:26:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:52,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:26:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:52,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:26:52,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:52,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:52,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:26:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:52,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:26:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:52,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:26:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:52,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:26:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:52,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:26:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:52,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:26:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:52,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:26:52,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:52,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:26:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:52,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:26:52,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:52,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-20 07:26:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:52,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-20 07:26:52,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:52,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-11-20 07:26:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:52,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-11-20 07:26:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:52,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-11-20 07:26:52,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:52,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2021-11-20 07:26:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:52,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2021-11-20 07:26:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:52,631 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 603 trivial. 0 not checked. [2021-11-20 07:26:52,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:52,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457670549] [2021-11-20 07:26:52,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457670549] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:26:52,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038467484] [2021-11-20 07:26:52,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:52,632 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:26:52,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:26:52,636 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:26:52,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-20 07:26:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:52,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 913 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-20 07:26:52,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:26:53,283 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2021-11-20 07:26:53,284 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 07:26:53,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038467484] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:53,284 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 07:26:53,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2021-11-20 07:26:53,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436162795] [2021-11-20 07:26:53,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:53,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 07:26:53,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:53,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 07:26:53,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-20 07:26:53,287 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-11-20 07:26:53,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:53,410 INFO L93 Difference]: Finished difference Result 1045 states and 1410 transitions. [2021-11-20 07:26:53,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 07:26:53,410 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-11-20 07:26:53,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:53,415 INFO L225 Difference]: With dead ends: 1045 [2021-11-20 07:26:53,416 INFO L226 Difference]: Without dead ends: 655 [2021-11-20 07:26:53,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-20 07:26:53,418 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.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:26:53,418 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.1s Time] [2021-11-20 07:26:53,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2021-11-20 07:26:53,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2021-11-20 07:26:53,457 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-11-20 07:26:53,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 856 transitions. [2021-11-20 07:26:53,461 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 856 transitions. Word has length 266 [2021-11-20 07:26:53,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:53,462 INFO L470 AbstractCegarLoop]: Abstraction has 655 states and 856 transitions. [2021-11-20 07:26:53,463 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-11-20 07:26:53,463 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 856 transitions. [2021-11-20 07:26:53,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2021-11-20 07:26:53,468 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:53,468 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-11-20 07:26:53,507 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-20 07:26:53,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-11-20 07:26:53,684 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:53,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:53,684 INFO L85 PathProgramCache]: Analyzing trace with hash 723082873, now seen corresponding path program 1 times [2021-11-20 07:26:53,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:53,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328422463] [2021-11-20 07:26:53,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:53,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:53,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:26:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:53,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:26:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:53,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:26:53,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:53,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:26:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:53,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:26:53,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:53,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:53,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:26:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:53,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:26:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:53,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:26:53,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:53,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:26:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:53,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:26:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:53,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:26:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:53,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:26:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:53,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:26:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:53,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:26:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:53,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-20 07:26:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:53,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-20 07:26:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:53,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-11-20 07:26:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:53,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-11-20 07:26:53,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:53,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-11-20 07:26:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:53,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-11-20 07:26:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:53,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2021-11-20 07:26:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:53,877 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 617 trivial. 0 not checked. [2021-11-20 07:26:53,878 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:53,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328422463] [2021-11-20 07:26:53,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328422463] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:26:53,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527467309] [2021-11-20 07:26:53,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:53,879 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:26:53,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:26:53,880 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:26:53,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-20 07:26:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:54,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 914 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-20 07:26:54,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:26:54,484 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2021-11-20 07:26:54,484 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 07:26:54,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527467309] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:54,485 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 07:26:54,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2021-11-20 07:26:54,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965676935] [2021-11-20 07:26:54,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:54,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 07:26:54,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:54,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 07:26:54,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-20 07:26:54,488 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-11-20 07:26:54,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:54,582 INFO L93 Difference]: Finished difference Result 1045 states and 1396 transitions. [2021-11-20 07:26:54,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 07:26:54,582 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-11-20 07:26:54,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:54,587 INFO L225 Difference]: With dead ends: 1045 [2021-11-20 07:26:54,587 INFO L226 Difference]: Without dead ends: 667 [2021-11-20 07:26:54,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-20 07:26:54,589 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-11-20 07:26:54,591 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-11-20 07:26:54,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2021-11-20 07:26:54,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2021-11-20 07:26:54,629 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-11-20 07:26:54,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 870 transitions. [2021-11-20 07:26:54,633 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 870 transitions. Word has length 267 [2021-11-20 07:26:54,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:54,634 INFO L470 AbstractCegarLoop]: Abstraction has 667 states and 870 transitions. [2021-11-20 07:26:54,634 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-11-20 07:26:54,634 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 870 transitions. [2021-11-20 07:26:54,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2021-11-20 07:26:54,636 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:54,637 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-11-20 07:26:54,676 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-20 07:26:54,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:26:54,855 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:54,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:54,856 INFO L85 PathProgramCache]: Analyzing trace with hash -185468270, now seen corresponding path program 1 times [2021-11-20 07:26:54,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:54,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756309177] [2021-11-20 07:26:54,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:54,857 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:54,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:26:54,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:54,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:26:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:54,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:26:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:54,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:26:54,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:54,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:26:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:55,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:55,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:26:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:55,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:26:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:55,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:26:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:55,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:26:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:55,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:26:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:55,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:26:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:55,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:26:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:55,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:26:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:55,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:26:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:55,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-20 07:26:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:55,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-20 07:26:55,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:55,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-11-20 07:26:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:55,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-11-20 07:26:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:55,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-11-20 07:26:55,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:55,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-11-20 07:26:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:55,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-11-20 07:26:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:55,078 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2021-11-20 07:26:55,078 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:55,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756309177] [2021-11-20 07:26:55,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756309177] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:26:55,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173947574] [2021-11-20 07:26:55,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:55,079 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:26:55,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:26:55,084 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:26:55,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-20 07:26:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:55,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 915 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-20 07:26:55,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:26:55,716 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2021-11-20 07:26:55,716 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 07:26:55,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173947574] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:26:55,717 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 07:26:55,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 14 [2021-11-20 07:26:55,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968722915] [2021-11-20 07:26:55,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:26:55,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 07:26:55,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:55,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 07:26:55,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-11-20 07:26:55,719 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-11-20 07:26:55,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:26:55,939 INFO L93 Difference]: Finished difference Result 1441 states and 2083 transitions. [2021-11-20 07:26:55,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 07:26:55,940 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-11-20 07:26:55,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:26:55,950 INFO L225 Difference]: With dead ends: 1441 [2021-11-20 07:26:55,951 INFO L226 Difference]: Without dead ends: 1439 [2021-11-20 07:26:55,952 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-11-20 07:26:55,953 INFO L933 BasicCegarLoop]: 507 mSDtfsCounter, 553 mSDsluCounter, 2300 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-11-20 07:26:55,953 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-11-20 07:26:55,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2021-11-20 07:26:56,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 673. [2021-11-20 07:26:56,009 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-11-20 07:26:56,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 876 transitions. [2021-11-20 07:26:56,013 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 876 transitions. Word has length 268 [2021-11-20 07:26:56,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:26:56,014 INFO L470 AbstractCegarLoop]: Abstraction has 673 states and 876 transitions. [2021-11-20 07:26:56,014 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-11-20 07:26:56,014 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 876 transitions. [2021-11-20 07:26:56,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2021-11-20 07:26:56,017 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:26:56,017 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-11-20 07:26:56,056 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-20 07:26:56,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-20 07:26:56,241 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:26:56,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:26:56,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1915412215, now seen corresponding path program 1 times [2021-11-20 07:26:56,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:26:56,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137812043] [2021-11-20 07:26:56,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:56,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:26:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:56,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:26:56,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:56,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:26:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:56,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:26:56,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:56,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:26:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:56,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:26:56,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:56,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:26:56,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:56,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:26:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:56,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:26:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:56,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:26:56,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:56,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:26:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:56,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:26:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:56,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:26:56,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:56,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:26:56,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:56,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:26:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:56,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:26:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:56,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-20 07:26:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:56,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-20 07:26:56,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:56,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-11-20 07:26:56,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:56,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-11-20 07:26:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:56,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-11-20 07:26:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:56,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-11-20 07:26:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:56,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-11-20 07:26:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:56,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2021-11-20 07:26:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:56,557 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 142 proven. 27 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2021-11-20 07:26:56,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:26:56,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137812043] [2021-11-20 07:26:56,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137812043] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:26:56,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467558317] [2021-11-20 07:26:56,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:26:56,558 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:26:56,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:26:56,559 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:26:56,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-20 07:26:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:26:56,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-20 07:26:56,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:26:57,412 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 251 proven. 33 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2021-11-20 07:26:57,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:26:58,199 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 146 proven. 23 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2021-11-20 07:26:58,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467558317] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 07:26:58,200 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 07:26:58,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 19 [2021-11-20 07:26:58,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103242572] [2021-11-20 07:26:58,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 07:26:58,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-20 07:26:58,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:26:58,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-20 07:26:58,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-11-20 07:26:58,203 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-11-20 07:27:00,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:27:00,126 INFO L93 Difference]: Finished difference Result 1913 states and 2671 transitions. [2021-11-20 07:27:00,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-20 07:27:00,126 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-11-20 07:27:00,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:27:00,137 INFO L225 Difference]: With dead ends: 1913 [2021-11-20 07:27:00,137 INFO L226 Difference]: Without dead ends: 1517 [2021-11-20 07:27:00,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 598 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=211, Invalid=1121, Unknown=0, NotChecked=0, Total=1332 [2021-11-20 07:27:00,140 INFO L933 BasicCegarLoop]: 382 mSDtfsCounter, 685 mSDsluCounter, 3272 mSDsCounter, 0 mSdLazyCounter, 1766 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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, 1.3s IncrementalHoareTripleChecker+Time [2021-11-20 07:27:00,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [733 Valid, 3654 Invalid, 1966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 1766 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-20 07:27:00,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2021-11-20 07:27:00,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 940. [2021-11-20 07:27:00,203 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-11-20 07:27:00,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1220 transitions. [2021-11-20 07:27:00,210 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1220 transitions. Word has length 276 [2021-11-20 07:27:00,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:27:00,211 INFO L470 AbstractCegarLoop]: Abstraction has 940 states and 1220 transitions. [2021-11-20 07:27:00,211 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-11-20 07:27:00,211 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1220 transitions. [2021-11-20 07:27:00,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2021-11-20 07:27:00,214 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:27:00,215 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-11-20 07:27:00,253 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-20 07:27:00,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-11-20 07:27:00,440 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:27:00,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:27:00,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1417941064, now seen corresponding path program 1 times [2021-11-20 07:27:00,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:27:00,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585177079] [2021-11-20 07:27:00,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:27:00,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:27:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:00,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:27:00,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:00,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:27:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:00,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:27:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:00,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:27:00,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:00,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:27:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:00,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:27:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:00,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:27:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:00,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:27:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:00,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:27:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:00,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:27:00,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:00,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:27:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:00,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:27:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:00,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:27:00,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:00,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:27:00,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:00,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:27:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:00,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-20 07:27:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:00,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-20 07:27:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:00,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-11-20 07:27:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:00,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-11-20 07:27:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:00,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-11-20 07:27:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:00,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-11-20 07:27:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:00,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-11-20 07:27:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:00,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2021-11-20 07:27:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:00,616 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2021-11-20 07:27:00,616 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:27:00,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585177079] [2021-11-20 07:27:00,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585177079] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:27:00,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812881540] [2021-11-20 07:27:00,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:27:00,617 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:27:00,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:27:00,618 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:27:00,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-20 07:27:00,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:00,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 07:27:00,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:27:01,169 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2021-11-20 07:27:01,169 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 07:27:01,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812881540] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:27:01,170 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 07:27:01,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-11-20 07:27:01,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95561969] [2021-11-20 07:27:01,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:27:01,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 07:27:01,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:27:01,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 07:27:01,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 07:27:01,177 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-11-20 07:27:01,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:27:01,283 INFO L93 Difference]: Finished difference Result 1743 states and 2304 transitions. [2021-11-20 07:27:01,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 07:27:01,284 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-11-20 07:27:01,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:27:01,290 INFO L225 Difference]: With dead ends: 1743 [2021-11-20 07:27:01,291 INFO L226 Difference]: Without dead ends: 924 [2021-11-20 07:27:01,293 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-11-20 07:27:01,294 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-11-20 07:27:01,294 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-11-20 07:27:01,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2021-11-20 07:27:01,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 924. [2021-11-20 07:27:01,347 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-11-20 07:27:01,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1187 transitions. [2021-11-20 07:27:01,352 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1187 transitions. Word has length 276 [2021-11-20 07:27:01,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:27:01,353 INFO L470 AbstractCegarLoop]: Abstraction has 924 states and 1187 transitions. [2021-11-20 07:27:01,353 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-11-20 07:27:01,353 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1187 transitions. [2021-11-20 07:27:01,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2021-11-20 07:27:01,356 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:27:01,357 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-11-20 07:27:01,391 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-20 07:27:01,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-11-20 07:27:01,572 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:27:01,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:27:01,572 INFO L85 PathProgramCache]: Analyzing trace with hash -818721709, now seen corresponding path program 1 times [2021-11-20 07:27:01,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:27:01,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711098275] [2021-11-20 07:27:01,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:27:01,573 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:27:01,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:01,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:27:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:01,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:27:01,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:01,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:27:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:01,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:27:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:01,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:27:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:01,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:27:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:01,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:27:01,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:01,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:27:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:01,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:27:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:01,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:27:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:01,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:27:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:01,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:27:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:01,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:27:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:01,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:27:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:01,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-20 07:27:01,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:01,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-20 07:27:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:01,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-11-20 07:27:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:01,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2021-11-20 07:27:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:01,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2021-11-20 07:27:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:01,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2021-11-20 07:27:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:01,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2021-11-20 07:27:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:01,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-11-20 07:27:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:01,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2021-11-20 07:27:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:01,707 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 121 proven. 19 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2021-11-20 07:27:01,707 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:27:01,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711098275] [2021-11-20 07:27:01,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711098275] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:27:01,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967063006] [2021-11-20 07:27:01,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:27:01,708 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:27:01,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:27:01,712 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:27:01,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-20 07:27:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:01,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 07:27:01,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:27:02,326 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2021-11-20 07:27:02,326 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 07:27:02,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967063006] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:27:02,327 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 07:27:02,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-11-20 07:27:02,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596808718] [2021-11-20 07:27:02,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:27:02,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 07:27:02,328 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:27:02,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 07:27:02,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 07:27:02,329 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-11-20 07:27:02,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:27:02,441 INFO L93 Difference]: Finished difference Result 1576 states and 2065 transitions. [2021-11-20 07:27:02,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 07:27:02,442 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-11-20 07:27:02,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:27:02,447 INFO L225 Difference]: With dead ends: 1576 [2021-11-20 07:27:02,447 INFO L226 Difference]: Without dead ends: 764 [2021-11-20 07:27:02,449 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-11-20 07:27:02,450 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.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:27:02,468 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.1s Time] [2021-11-20 07:27:02,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2021-11-20 07:27:02,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 764. [2021-11-20 07:27:02,525 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-11-20 07:27:02,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 979 transitions. [2021-11-20 07:27:02,529 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 979 transitions. Word has length 279 [2021-11-20 07:27:02,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:27:02,529 INFO L470 AbstractCegarLoop]: Abstraction has 764 states and 979 transitions. [2021-11-20 07:27:02,530 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-11-20 07:27:02,530 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 979 transitions. [2021-11-20 07:27:02,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2021-11-20 07:27:02,533 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:27:02,534 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-11-20 07:27:02,569 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-20 07:27:02,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:27:02,760 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:27:02,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:27:02,760 INFO L85 PathProgramCache]: Analyzing trace with hash -2031857474, now seen corresponding path program 1 times [2021-11-20 07:27:02,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:27:02,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402649780] [2021-11-20 07:27:02,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:27:02,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:27:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:02,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:27:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:02,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:27:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:02,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:27:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:02,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:27:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:02,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:27:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:02,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:27:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:02,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:27:02,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:02,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:27:02,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:02,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:27:02,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:02,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:27:02,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:02,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:27:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:02,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:27:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:02,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:27:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:02,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:27:02,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:02,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:27:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:02,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-20 07:27:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:02,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-20 07:27:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:02,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-11-20 07:27:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:03,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-11-20 07:27:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:03,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-11-20 07:27:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:03,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-11-20 07:27:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:03,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-11-20 07:27:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:03,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2021-11-20 07:27:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:03,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2021-11-20 07:27:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:03,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2021-11-20 07:27:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:03,037 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2021-11-20 07:27:03,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:27:03,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402649780] [2021-11-20 07:27:03,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402649780] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:27:03,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619405884] [2021-11-20 07:27:03,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:27:03,039 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:27:03,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:27:03,044 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:27:03,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-20 07:27:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:03,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-20 07:27:03,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:27:03,751 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2021-11-20 07:27:03,751 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 07:27:03,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619405884] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:27:03,751 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 07:27:03,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2021-11-20 07:27:03,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685259796] [2021-11-20 07:27:03,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:27:03,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-20 07:27:03,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:27:03,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-20 07:27:03,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2021-11-20 07:27:03,753 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-11-20 07:27:04,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:27:04,659 INFO L93 Difference]: Finished difference Result 2072 states and 2753 transitions. [2021-11-20 07:27:04,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-20 07:27:04,660 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-11-20 07:27:04,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:27:04,672 INFO L225 Difference]: With dead ends: 2072 [2021-11-20 07:27:04,673 INFO L226 Difference]: Without dead ends: 1672 [2021-11-20 07:27:04,675 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=1094, Unknown=0, NotChecked=0, Total=1260 [2021-11-20 07:27:04,676 INFO L933 BasicCegarLoop]: 401 mSDtfsCounter, 1216 mSDsluCounter, 2853 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.6s IncrementalHoareTripleChecker+Time [2021-11-20 07:27:04,676 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.6s Time] [2021-11-20 07:27:04,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2021-11-20 07:27:04,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 919. [2021-11-20 07:27:04,738 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-11-20 07:27:04,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1180 transitions. [2021-11-20 07:27:04,742 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1180 transitions. Word has length 291 [2021-11-20 07:27:04,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:27:04,743 INFO L470 AbstractCegarLoop]: Abstraction has 919 states and 1180 transitions. [2021-11-20 07:27:04,743 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-11-20 07:27:04,743 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1180 transitions. [2021-11-20 07:27:04,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2021-11-20 07:27:04,746 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:27:04,746 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-11-20 07:27:04,781 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-20 07:27:04,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2021-11-20 07:27:04,960 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:27:04,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:27:04,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1472400859, now seen corresponding path program 1 times [2021-11-20 07:27:04,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:27:04,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796045335] [2021-11-20 07:27:04,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:27:04,960 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:27:05,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:27:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:27:05,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:27:05,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:27:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:27:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:27:05,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:27:05,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:27:05,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:27:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:27:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:27:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:27:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:27:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:27:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:27:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-20 07:27:05,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-20 07:27:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-11-20 07:27:05,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-11-20 07:27:05,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-11-20 07:27:05,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-11-20 07:27:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-11-20 07:27:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2021-11-20 07:27:05,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2021-11-20 07:27:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-11-20 07:27:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,163 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2021-11-20 07:27:05,163 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:27:05,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796045335] [2021-11-20 07:27:05,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796045335] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:27:05,164 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:27:05,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 07:27:05,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258660238] [2021-11-20 07:27:05,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:27:05,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 07:27:05,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:27:05,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 07:27:05,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-20 07:27:05,167 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-11-20 07:27:05,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:27:05,681 INFO L93 Difference]: Finished difference Result 2496 states and 3489 transitions. [2021-11-20 07:27:05,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 07:27:05,682 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-11-20 07:27:05,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:27:05,698 INFO L225 Difference]: With dead ends: 2496 [2021-11-20 07:27:05,699 INFO L226 Difference]: Without dead ends: 1923 [2021-11-20 07:27:05,701 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-11-20 07:27:05,702 INFO L933 BasicCegarLoop]: 548 mSDtfsCounter, 494 mSDsluCounter, 1590 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2021-11-20 07:27:05,702 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.4s Time] [2021-11-20 07:27:05,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2021-11-20 07:27:05,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 974. [2021-11-20 07:27:05,805 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-11-20 07:27:05,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1268 transitions. [2021-11-20 07:27:05,818 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1268 transitions. Word has length 297 [2021-11-20 07:27:05,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:27:05,819 INFO L470 AbstractCegarLoop]: Abstraction has 974 states and 1268 transitions. [2021-11-20 07:27:05,820 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-11-20 07:27:05,820 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1268 transitions. [2021-11-20 07:27:05,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2021-11-20 07:27:05,823 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:27:05,823 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-11-20 07:27:05,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-20 07:27:05,824 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:27:05,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:27:05,825 INFO L85 PathProgramCache]: Analyzing trace with hash -358014121, now seen corresponding path program 1 times [2021-11-20 07:27:05,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:27:05,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611367384] [2021-11-20 07:27:05,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:27:05,826 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:27:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:27:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:27:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:27:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:27:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:27:05,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:27:05,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:27:05,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:27:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:27:05,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:27:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:27:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:27:05,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:27:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:27:05,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:27:05,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:05,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-20 07:27:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:06,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-20 07:27:06,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:06,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-11-20 07:27:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:06,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-11-20 07:27:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:06,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-11-20 07:27:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:06,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-11-20 07:27:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:06,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-11-20 07:27:06,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:06,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2021-11-20 07:27:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:06,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2021-11-20 07:27:06,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:06,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-11-20 07:27:06,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:06,058 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2021-11-20 07:27:06,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:27:06,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611367384] [2021-11-20 07:27:06,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611367384] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:27:06,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137084306] [2021-11-20 07:27:06,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:27:06,059 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:27:06,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:27:06,064 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:27:06,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-20 07:27:06,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:06,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 997 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-20 07:27:06,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:27:07,096 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2021-11-20 07:27:07,097 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 07:27:07,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137084306] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:27:07,097 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 07:27:07,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 12 [2021-11-20 07:27:07,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576525225] [2021-11-20 07:27:07,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:27:07,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-20 07:27:07,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:27:07,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-20 07:27:07,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-11-20 07:27:07,107 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-11-20 07:27:08,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:27:08,407 INFO L93 Difference]: Finished difference Result 2479 states and 3355 transitions. [2021-11-20 07:27:08,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-20 07:27:08,407 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-11-20 07:27:08,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:27:08,420 INFO L225 Difference]: With dead ends: 2479 [2021-11-20 07:27:08,420 INFO L226 Difference]: Without dead ends: 1852 [2021-11-20 07:27:08,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 343 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2021-11-20 07:27:08,423 INFO L933 BasicCegarLoop]: 519 mSDtfsCounter, 1368 mSDsluCounter, 2977 mSDsCounter, 0 mSdLazyCounter, 1130 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.9s IncrementalHoareTripleChecker+Time [2021-11-20 07:27:08,424 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.9s Time] [2021-11-20 07:27:08,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2021-11-20 07:27:08,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 964. [2021-11-20 07:27:08,554 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-11-20 07:27:08,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1246 transitions. [2021-11-20 07:27:08,558 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1246 transitions. Word has length 297 [2021-11-20 07:27:08,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:27:08,559 INFO L470 AbstractCegarLoop]: Abstraction has 964 states and 1246 transitions. [2021-11-20 07:27:08,559 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-11-20 07:27:08,559 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1246 transitions. [2021-11-20 07:27:08,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2021-11-20 07:27:08,563 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:27:08,563 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-11-20 07:27:08,598 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-20 07:27:08,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-11-20 07:27:08,792 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:27:08,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:27:08,792 INFO L85 PathProgramCache]: Analyzing trace with hash 529040727, now seen corresponding path program 1 times [2021-11-20 07:27:08,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:27:08,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990554222] [2021-11-20 07:27:08,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:27:08,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:27:08,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:08,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:27:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:08,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:27:08,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:08,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:27:08,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:08,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:27:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:08,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:27:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:08,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:27:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:08,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:27:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:08,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:27:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:08,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:27:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:08,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:27:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:08,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:27:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:08,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:27:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:08,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:27:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:08,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:27:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:08,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:27:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:08,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-20 07:27:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:08,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-20 07:27:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:08,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-11-20 07:27:09,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:09,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-11-20 07:27:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:09,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-11-20 07:27:09,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:09,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-11-20 07:27:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:09,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-11-20 07:27:09,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:09,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2021-11-20 07:27:09,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:09,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2021-11-20 07:27:09,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:09,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-11-20 07:27:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:09,037 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2021-11-20 07:27:09,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:27:09,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990554222] [2021-11-20 07:27:09,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990554222] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:27:09,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453671754] [2021-11-20 07:27:09,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:27:09,039 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:27:09,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:27:09,040 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:27:09,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-20 07:27:09,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:09,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 997 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-20 07:27:09,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:27:09,833 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2021-11-20 07:27:09,834 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 07:27:09,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453671754] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:27:09,834 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 07:27:09,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2021-11-20 07:27:09,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098216227] [2021-11-20 07:27:09,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:27:09,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-20 07:27:09,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:27:09,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-20 07:27:09,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2021-11-20 07:27:09,836 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-11-20 07:27:11,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:27:11,094 INFO L93 Difference]: Finished difference Result 3176 states and 4307 transitions. [2021-11-20 07:27:11,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-20 07:27:11,095 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-11-20 07:27:11,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:27:11,112 INFO L225 Difference]: With dead ends: 3176 [2021-11-20 07:27:11,112 INFO L226 Difference]: Without dead ends: 2562 [2021-11-20 07:27:11,115 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=942, Unknown=0, NotChecked=0, Total=1122 [2021-11-20 07:27:11,116 INFO L933 BasicCegarLoop]: 555 mSDtfsCounter, 1316 mSDsluCounter, 3435 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.8s IncrementalHoareTripleChecker+Time [2021-11-20 07:27:11,116 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.8s Time] [2021-11-20 07:27:11,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2021-11-20 07:27:11,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 1345. [2021-11-20 07:27:11,254 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-11-20 07:27:11,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1747 transitions. [2021-11-20 07:27:11,260 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1747 transitions. Word has length 297 [2021-11-20 07:27:11,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:27:11,261 INFO L470 AbstractCegarLoop]: Abstraction has 1345 states and 1747 transitions. [2021-11-20 07:27:11,261 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-11-20 07:27:11,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1747 transitions. [2021-11-20 07:27:11,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2021-11-20 07:27:11,264 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:27:11,265 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-11-20 07:27:11,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-20 07:27:11,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:27:11,479 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:27:11,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:27:11,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1597737013, now seen corresponding path program 1 times [2021-11-20 07:27:11,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:27:11,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163100716] [2021-11-20 07:27:11,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:27:11,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:27:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:11,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:27:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:11,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:27:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:11,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:27:11,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:11,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:27:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:11,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:27:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:11,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:27:11,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:11,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:27:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:11,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:27:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:11,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:27:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:11,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:27:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:11,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:27:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:11,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:27:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:11,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:27:11,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:11,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:27:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:11,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:27:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:11,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-20 07:27:11,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:11,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-20 07:27:11,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:11,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-11-20 07:27:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:11,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-11-20 07:27:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:11,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-11-20 07:27:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:11,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-11-20 07:27:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:11,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-11-20 07:27:11,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:11,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2021-11-20 07:27:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:11,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-11-20 07:27:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:11,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2021-11-20 07:27:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:11,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2021-11-20 07:27:11,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:11,669 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2021-11-20 07:27:11,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:27:11,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163100716] [2021-11-20 07:27:11,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163100716] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:27:11,670 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:27:11,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 07:27:11,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28035753] [2021-11-20 07:27:11,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:27:11,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 07:27:11,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:27:11,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 07:27:11,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 07:27:11,672 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-11-20 07:27:12,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:27:12,297 INFO L93 Difference]: Finished difference Result 2402 states and 3143 transitions. [2021-11-20 07:27:12,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 07:27:12,298 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-11-20 07:27:12,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:27:12,307 INFO L225 Difference]: With dead ends: 2402 [2021-11-20 07:27:12,308 INFO L226 Difference]: Without dead ends: 1424 [2021-11-20 07:27:12,310 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-11-20 07:27:12,311 INFO L933 BasicCegarLoop]: 384 mSDtfsCounter, 500 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2021-11-20 07:27:12,311 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.5s Time] [2021-11-20 07:27:12,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2021-11-20 07:27:12,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1151. [2021-11-20 07:27:12,409 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-11-20 07:27:12,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1477 transitions. [2021-11-20 07:27:12,413 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1477 transitions. Word has length 311 [2021-11-20 07:27:12,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:27:12,414 INFO L470 AbstractCegarLoop]: Abstraction has 1151 states and 1477 transitions. [2021-11-20 07:27:12,414 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-11-20 07:27:12,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1477 transitions. [2021-11-20 07:27:12,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2021-11-20 07:27:12,419 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:27:12,419 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-11-20 07:27:12,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-20 07:27:12,419 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:27:12,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:27:12,420 INFO L85 PathProgramCache]: Analyzing trace with hash 522126260, now seen corresponding path program 1 times [2021-11-20 07:27:12,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:27:12,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607693660] [2021-11-20 07:27:12,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:27:12,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:27:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:12,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:27:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:12,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:27:12,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:12,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:27:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:12,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:27:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:12,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:27:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:12,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:27:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:12,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:27:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:12,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:27:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:12,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:27:12,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:12,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:27:12,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:12,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:27:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:12,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:27:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:12,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:27:12,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:12,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:27:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:12,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:27:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:12,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-20 07:27:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:12,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-20 07:27:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:12,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-11-20 07:27:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:12,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-11-20 07:27:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:12,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-11-20 07:27:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:12,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-11-20 07:27:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:12,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-11-20 07:27:12,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:12,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2021-11-20 07:27:12,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:12,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-11-20 07:27:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:12,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-11-20 07:27:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:12,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2021-11-20 07:27:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:12,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2021-11-20 07:27:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:12,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2021-11-20 07:27:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:12,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2021-11-20 07:27:12,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:12,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2021-11-20 07:27:12,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:12,776 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 833 trivial. 0 not checked. [2021-11-20 07:27:12,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:27:12,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607693660] [2021-11-20 07:27:12,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607693660] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:27:12,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182011589] [2021-11-20 07:27:12,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:27:12,778 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:27:12,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:27:12,780 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:27:12,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-20 07:27:13,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:13,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 1279 conjuncts, 40 conjunts are in the unsatisfiable core [2021-11-20 07:27:13,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:27:13,799 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 151 proven. 33 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2021-11-20 07:27:13,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:27:14,556 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 49 proven. 2 refuted. 0 times theorem prover too weak. 829 trivial. 0 not checked. [2021-11-20 07:27:14,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182011589] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 07:27:14,557 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 07:27:14,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 9] total 29 [2021-11-20 07:27:14,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960849372] [2021-11-20 07:27:14,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 07:27:14,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-20 07:27:14,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:27:14,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-20 07:27:14,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2021-11-20 07:27:14,560 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-11-20 07:27:36,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:27:36,824 INFO L93 Difference]: Finished difference Result 12771 states and 18354 transitions. [2021-11-20 07:27:36,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 316 states. [2021-11-20 07:27:36,825 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-11-20 07:27:36,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:27:36,964 INFO L225 Difference]: With dead ends: 12771 [2021-11-20 07:27:36,964 INFO L226 Difference]: Without dead ends: 11987 [2021-11-20 07:27:37,002 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1229 GetRequests, 889 SyntacticMatches, 1 SemanticMatches, 339 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47948 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=7954, Invalid=107986, Unknown=0, NotChecked=0, Total=115940 [2021-11-20 07:27:37,003 INFO L933 BasicCegarLoop]: 986 mSDtfsCounter, 5253 mSDsluCounter, 15277 mSDsCounter, 0 mSdLazyCounter, 23047 mSolverCounterSat, 4331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s 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, 12.9s IncrementalHoareTripleChecker+Time [2021-11-20 07:27:37,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5279 Valid, 16263 Invalid, 27378 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4331 Valid, 23047 Invalid, 0 Unknown, 0 Unchecked, 12.9s Time] [2021-11-20 07:27:37,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11987 states. [2021-11-20 07:27:37,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11987 to 2956. [2021-11-20 07:27:37,585 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-11-20 07:27:37,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2956 states to 2956 states and 3829 transitions. [2021-11-20 07:27:37,598 INFO L78 Accepts]: Start accepts. Automaton has 2956 states and 3829 transitions. Word has length 350 [2021-11-20 07:27:37,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:27:37,599 INFO L470 AbstractCegarLoop]: Abstraction has 2956 states and 3829 transitions. [2021-11-20 07:27:37,599 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-11-20 07:27:37,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2956 states and 3829 transitions. [2021-11-20 07:27:37,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2021-11-20 07:27:37,608 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:27:37,608 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-11-20 07:27:37,647 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-20 07:27:37,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-11-20 07:27:37,824 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:27:37,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:27:37,824 INFO L85 PathProgramCache]: Analyzing trace with hash -2072375083, now seen corresponding path program 1 times [2021-11-20 07:27:37,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:27:37,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345898264] [2021-11-20 07:27:37,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:27:37,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:27:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:37,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:27:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:37,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:27:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:37,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:27:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:37,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:27:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:37,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:27:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:37,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:27:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:37,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:27:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:37,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:27:37,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:37,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:27:37,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:37,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:27:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:37,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:27:37,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:37,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:27:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:37,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:27:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:37,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:27:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:37,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:27:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:37,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-20 07:27:37,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:37,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-20 07:27:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:38,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-11-20 07:27:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:38,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-11-20 07:27:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:38,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-11-20 07:27:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:38,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-11-20 07:27:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:38,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-11-20 07:27:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:38,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2021-11-20 07:27:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:38,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-11-20 07:27:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:38,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-11-20 07:27:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:38,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2021-11-20 07:27:38,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:38,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2021-11-20 07:27:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:38,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2021-11-20 07:27:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:38,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2021-11-20 07:27:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:38,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2021-11-20 07:27:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:38,040 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2021-11-20 07:27:38,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:27:38,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345898264] [2021-11-20 07:27:38,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345898264] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:27:38,041 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:27:38,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 07:27:38,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517671481] [2021-11-20 07:27:38,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:27:38,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 07:27:38,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:27:38,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 07:27:38,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-20 07:27:38,045 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-11-20 07:27:38,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:27:38,693 INFO L93 Difference]: Finished difference Result 5518 states and 7188 transitions. [2021-11-20 07:27:38,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 07:27:38,693 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-11-20 07:27:38,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:27:38,704 INFO L225 Difference]: With dead ends: 5518 [2021-11-20 07:27:38,705 INFO L226 Difference]: Without dead ends: 2956 [2021-11-20 07:27:38,711 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-20 07:27:38,711 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 377 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2021-11-20 07:27:38,712 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.3s Time] [2021-11-20 07:27:38,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2021-11-20 07:27:38,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 2956. [2021-11-20 07:27:38,984 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-11-20 07:27:38,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2956 states to 2956 states and 3826 transitions. [2021-11-20 07:27:38,993 INFO L78 Accepts]: Start accepts. Automaton has 2956 states and 3826 transitions. Word has length 350 [2021-11-20 07:27:38,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:27:38,994 INFO L470 AbstractCegarLoop]: Abstraction has 2956 states and 3826 transitions. [2021-11-20 07:27:38,994 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-11-20 07:27:38,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2956 states and 3826 transitions. [2021-11-20 07:27:39,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2021-11-20 07:27:39,004 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:27:39,004 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-11-20 07:27:39,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-20 07:27:39,005 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:27:39,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:27:39,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1816454027, now seen corresponding path program 1 times [2021-11-20 07:27:39,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:27:39,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700259807] [2021-11-20 07:27:39,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:27:39,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:27:39,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:39,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:27:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:39,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:27:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:39,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:27:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:39,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:27:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:39,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:27:39,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:39,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:27:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:39,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:27:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:39,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:27:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:39,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:27:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:39,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:27:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:39,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:27:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:39,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:27:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:39,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:27:39,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:39,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:27:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:39,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:27:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:39,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-20 07:27:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:39,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-20 07:27:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:39,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-11-20 07:27:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:39,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-11-20 07:27:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:39,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-11-20 07:27:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:39,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-11-20 07:27:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:39,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-11-20 07:27:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:39,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2021-11-20 07:27:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:39,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-11-20 07:27:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:39,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-11-20 07:27:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:39,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2021-11-20 07:27:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:39,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2021-11-20 07:27:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:39,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2021-11-20 07:27:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:39,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2021-11-20 07:27:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:39,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2021-11-20 07:27:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:39,171 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 854 trivial. 0 not checked. [2021-11-20 07:27:39,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:27:39,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700259807] [2021-11-20 07:27:39,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700259807] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:27:39,172 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:27:39,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 07:27:39,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242529814] [2021-11-20 07:27:39,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:27:39,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 07:27:39,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:27:39,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 07:27:39,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 07:27:39,174 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-11-20 07:27:39,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:27:39,870 INFO L93 Difference]: Finished difference Result 7976 states and 10384 transitions. [2021-11-20 07:27:39,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 07:27:39,871 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-11-20 07:27:39,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:27:39,890 INFO L225 Difference]: With dead ends: 7976 [2021-11-20 07:27:39,891 INFO L226 Difference]: Without dead ends: 5394 [2021-11-20 07:27:39,898 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-11-20 07:27:39,899 INFO L933 BasicCegarLoop]: 304 mSDtfsCounter, 215 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2021-11-20 07:27:39,899 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.3s Time] [2021-11-20 07:27:39,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5394 states. [2021-11-20 07:27:40,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5394 to 3346. [2021-11-20 07:27:40,330 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-11-20 07:27:40,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3346 states to 3346 states and 4324 transitions. [2021-11-20 07:27:40,340 INFO L78 Accepts]: Start accepts. Automaton has 3346 states and 4324 transitions. Word has length 350 [2021-11-20 07:27:40,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:27:40,341 INFO L470 AbstractCegarLoop]: Abstraction has 3346 states and 4324 transitions. [2021-11-20 07:27:40,341 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-11-20 07:27:40,341 INFO L276 IsEmpty]: Start isEmpty. Operand 3346 states and 4324 transitions. [2021-11-20 07:27:40,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2021-11-20 07:27:40,352 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:27:40,352 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-11-20 07:27:40,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-20 07:27:40,353 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:27:40,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:27:40,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1483810889, now seen corresponding path program 1 times [2021-11-20 07:27:40,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:27:40,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594285581] [2021-11-20 07:27:40,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:27:40,354 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:27:40,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:40,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:27:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:40,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:27:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:40,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:27:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:40,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:27:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:40,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:27:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:40,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:27:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:40,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:27:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:40,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:27:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:40,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:27:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:40,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:27:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:40,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:27:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:40,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:27:40,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:40,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:27:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:40,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:27:40,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:40,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:27:40,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:40,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-20 07:27:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:40,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-20 07:27:40,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:40,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-11-20 07:27:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:40,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-11-20 07:27:40,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:40,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-11-20 07:27:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:40,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-11-20 07:27:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:40,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-11-20 07:27:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:40,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2021-11-20 07:27:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:40,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-11-20 07:27:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:40,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-11-20 07:27:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:40,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2021-11-20 07:27:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:40,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2021-11-20 07:27:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:40,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2021-11-20 07:27:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:40,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2021-11-20 07:27:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:40,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2021-11-20 07:27:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:40,518 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2021-11-20 07:27:40,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:27:40,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594285581] [2021-11-20 07:27:40,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594285581] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:27:40,519 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:27:40,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 07:27:40,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952854970] [2021-11-20 07:27:40,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:27:40,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 07:27:40,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:27:40,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 07:27:40,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 07:27:40,521 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-11-20 07:27:41,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:27:41,022 INFO L93 Difference]: Finished difference Result 6737 states and 8695 transitions. [2021-11-20 07:27:41,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 07:27:41,023 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-11-20 07:27:41,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:27:41,035 INFO L225 Difference]: With dead ends: 6737 [2021-11-20 07:27:41,035 INFO L226 Difference]: Without dead ends: 3266 [2021-11-20 07:27:41,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-20 07:27:41,044 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 107 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2021-11-20 07:27:41,045 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.2s Time] [2021-11-20 07:27:41,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2021-11-20 07:27:41,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 3266. [2021-11-20 07:27:41,469 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-11-20 07:27:41,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 4149 transitions. [2021-11-20 07:27:41,478 INFO L78 Accepts]: Start accepts. Automaton has 3266 states and 4149 transitions. Word has length 350 [2021-11-20 07:27:41,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:27:41,479 INFO L470 AbstractCegarLoop]: Abstraction has 3266 states and 4149 transitions. [2021-11-20 07:27:41,479 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-11-20 07:27:41,480 INFO L276 IsEmpty]: Start isEmpty. Operand 3266 states and 4149 transitions. [2021-11-20 07:27:41,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2021-11-20 07:27:41,491 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:27:41,491 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-11-20 07:27:41,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-20 07:27:41,492 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:27:41,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:27:41,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1962062639, now seen corresponding path program 1 times [2021-11-20 07:27:41,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:27:41,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592796587] [2021-11-20 07:27:41,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:27:41,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:27:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:41,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:27:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:41,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:27:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:41,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:27:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:41,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:27:41,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:41,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:27:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:41,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:27:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:41,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:27:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:41,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:27:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:41,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:27:41,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:41,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:27:41,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:41,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:27:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:41,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:27:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:41,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:27:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:41,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:27:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:41,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:27:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:41,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-20 07:27:41,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:41,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-20 07:27:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:41,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-11-20 07:27:41,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:41,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-11-20 07:27:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:41,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-11-20 07:27:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:41,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-11-20 07:27:41,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:41,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-11-20 07:27:41,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:41,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2021-11-20 07:27:41,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:41,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2021-11-20 07:27:41,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:41,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-11-20 07:27:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:41,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2021-11-20 07:27:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:41,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2021-11-20 07:27:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:41,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2021-11-20 07:27:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:41,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2021-11-20 07:27:41,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:41,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2021-11-20 07:27:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:41,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2021-11-20 07:27:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:41,663 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 910 trivial. 0 not checked. [2021-11-20 07:27:41,663 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:27:41,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592796587] [2021-11-20 07:27:41,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592796587] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:27:41,664 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:27:41,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 07:27:41,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99306783] [2021-11-20 07:27:41,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:27:41,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 07:27:41,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:27:41,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 07:27:41,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 07:27:41,666 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-11-20 07:27:42,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:27:42,149 INFO L93 Difference]: Finished difference Result 6124 states and 7812 transitions. [2021-11-20 07:27:42,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 07:27:42,150 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-11-20 07:27:42,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:27:42,161 INFO L225 Difference]: With dead ends: 6124 [2021-11-20 07:27:42,161 INFO L226 Difference]: Without dead ends: 3171 [2021-11-20 07:27:42,167 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-11-20 07:27:42,168 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.2s IncrementalHoareTripleChecker+Time [2021-11-20 07:27:42,168 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.2s Time] [2021-11-20 07:27:42,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3171 states. [2021-11-20 07:27:42,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3171 to 3171. [2021-11-20 07:27:42,552 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-11-20 07:27:42,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3171 states to 3171 states and 3993 transitions. [2021-11-20 07:27:42,561 INFO L78 Accepts]: Start accepts. Automaton has 3171 states and 3993 transitions. Word has length 360 [2021-11-20 07:27:42,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:27:42,562 INFO L470 AbstractCegarLoop]: Abstraction has 3171 states and 3993 transitions. [2021-11-20 07:27:42,562 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-11-20 07:27:42,562 INFO L276 IsEmpty]: Start isEmpty. Operand 3171 states and 3993 transitions. [2021-11-20 07:27:42,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2021-11-20 07:27:42,573 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:27:42,573 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-11-20 07:27:42,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-20 07:27:42,574 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:27:42,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:27:42,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1339907605, now seen corresponding path program 1 times [2021-11-20 07:27:42,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:27:42,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553986532] [2021-11-20 07:27:42,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:27:42,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:27:42,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:42,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:27:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:42,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:27:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:42,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:27:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:42,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:27:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:42,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:27:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:42,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:27:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:42,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:27:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:42,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:27:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:42,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:27:42,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:42,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:27:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:42,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:27:42,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:42,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:27:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:42,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:27:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:42,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:27:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:42,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:27:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:42,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-20 07:27:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:42,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-20 07:27:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:42,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2021-11-20 07:27:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:42,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2021-11-20 07:27:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:42,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-11-20 07:27:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:42,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-11-20 07:27:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:42,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-11-20 07:27:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:42,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2021-11-20 07:27:42,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:42,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2021-11-20 07:27:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:42,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2021-11-20 07:27:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:42,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2021-11-20 07:27:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:42,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2021-11-20 07:27:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:42,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2021-11-20 07:27:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:42,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2021-11-20 07:27:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:42,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2021-11-20 07:27:42,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:42,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2021-11-20 07:27:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:42,905 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 890 trivial. 0 not checked. [2021-11-20 07:27:42,906 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:27:42,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553986532] [2021-11-20 07:27:42,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553986532] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:27:42,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178242144] [2021-11-20 07:27:42,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:27:42,907 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:27:42,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:27:42,911 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:27:42,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-20 07:27:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:27:43,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 1304 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-20 07:27:43,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:27:44,064 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 277 proven. 80 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2021-11-20 07:27:44,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:27:45,086 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 34 proven. 78 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2021-11-20 07:27:45,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178242144] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 07:27:45,087 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 07:27:45,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 33 [2021-11-20 07:27:45,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539219944] [2021-11-20 07:27:45,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 07:27:45,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-11-20 07:27:45,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:27:45,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-11-20 07:27:45,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=973, Unknown=0, NotChecked=0, Total=1056 [2021-11-20 07:27:45,090 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-11-20 07:28:32,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:28:32,094 INFO L93 Difference]: Finished difference Result 37278 states and 50296 transitions. [2021-11-20 07:28:32,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 677 states. [2021-11-20 07:28:32,094 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-11-20 07:28:32,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:28:32,223 INFO L225 Difference]: With dead ends: 37278 [2021-11-20 07:28:32,223 INFO L226 Difference]: Without dead ends: 34508 [2021-11-20 07:28:32,301 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1488 GetRequests, 782 SyntacticMatches, 1 SemanticMatches, 705 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226139 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=34812, Invalid=464330, Unknown=0, NotChecked=0, Total=499142 [2021-11-20 07:28:32,302 INFO L933 BasicCegarLoop]: 2465 mSDtfsCounter, 5000 mSDsluCounter, 39308 mSDsCounter, 0 mSdLazyCounter, 40684 mSolverCounterSat, 7153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5000 SdHoareTripleChecker+Valid, 41773 SdHoareTripleChecker+Invalid, 47837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 7153 IncrementalHoareTripleChecker+Valid, 40684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:28:32,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5000 Valid, 41773 Invalid, 47837 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [7153 Valid, 40684 Invalid, 0 Unknown, 0 Unchecked, 21.1s Time] [2021-11-20 07:28:32,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34508 states. [2021-11-20 07:28:33,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34508 to 4836. [2021-11-20 07:28:33,362 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-11-20 07:28:33,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4836 states to 4836 states and 6081 transitions. [2021-11-20 07:28:33,383 INFO L78 Accepts]: Start accepts. Automaton has 4836 states and 6081 transitions. Word has length 361 [2021-11-20 07:28:33,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:28:33,384 INFO L470 AbstractCegarLoop]: Abstraction has 4836 states and 6081 transitions. [2021-11-20 07:28:33,384 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-11-20 07:28:33,384 INFO L276 IsEmpty]: Start isEmpty. Operand 4836 states and 6081 transitions. [2021-11-20 07:28:33,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2021-11-20 07:28:33,401 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:28:33,402 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-11-20 07:28:33,441 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-20 07:28:33,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2021-11-20 07:28:33,616 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:28:33,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:28:33,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1214808755, now seen corresponding path program 1 times [2021-11-20 07:28:33,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:28:33,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498592061] [2021-11-20 07:28:33,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:28:33,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:28:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:33,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:28:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:33,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:28:33,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:33,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:28:33,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:33,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:28:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:33,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:28:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:33,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:28:33,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:33,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:28:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:33,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:28:33,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:33,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:28:33,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:33,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:28:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:33,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:28:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:33,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:28:33,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:33,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:28:33,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:33,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:28:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:33,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:28:33,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:33,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-20 07:28:33,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:33,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-20 07:28:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:33,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2021-11-20 07:28:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:33,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2021-11-20 07:28:33,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:33,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-11-20 07:28:33,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:33,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-11-20 07:28:33,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:33,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-11-20 07:28:33,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:33,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2021-11-20 07:28:33,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:33,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2021-11-20 07:28:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:33,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2021-11-20 07:28:33,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:33,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2021-11-20 07:28:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:33,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2021-11-20 07:28:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:33,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2021-11-20 07:28:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:33,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2021-11-20 07:28:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:33,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2021-11-20 07:28:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:33,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2021-11-20 07:28:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:33,852 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 929 trivial. 0 not checked. [2021-11-20 07:28:33,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:28:33,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498592061] [2021-11-20 07:28:33,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498592061] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:28:33,853 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:28:33,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 07:28:33,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570884533] [2021-11-20 07:28:33,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:28:33,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 07:28:33,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:28:33,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 07:28:33,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-20 07:28:33,855 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-11-20 07:28:34,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:28:34,608 INFO L93 Difference]: Finished difference Result 9218 states and 11633 transitions. [2021-11-20 07:28:34,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 07:28:34,609 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-11-20 07:28:34,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:28:34,627 INFO L225 Difference]: With dead ends: 9218 [2021-11-20 07:28:34,627 INFO L226 Difference]: Without dead ends: 4840 [2021-11-20 07:28:34,639 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-20 07:28:34,640 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.3s IncrementalHoareTripleChecker+Time [2021-11-20 07:28:34,640 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.3s Time] [2021-11-20 07:28:34,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4840 states. [2021-11-20 07:28:35,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4840 to 4828. [2021-11-20 07:28:35,387 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-11-20 07:28:35,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4828 states to 4828 states and 6069 transitions. [2021-11-20 07:28:35,397 INFO L78 Accepts]: Start accepts. Automaton has 4828 states and 6069 transitions. Word has length 361 [2021-11-20 07:28:35,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:28:35,398 INFO L470 AbstractCegarLoop]: Abstraction has 4828 states and 6069 transitions. [2021-11-20 07:28:35,398 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-11-20 07:28:35,399 INFO L276 IsEmpty]: Start isEmpty. Operand 4828 states and 6069 transitions. [2021-11-20 07:28:35,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2021-11-20 07:28:35,415 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:28:35,415 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-11-20 07:28:35,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-11-20 07:28:35,416 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:28:35,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:28:35,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1734178564, now seen corresponding path program 1 times [2021-11-20 07:28:35,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:28:35,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599312726] [2021-11-20 07:28:35,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:28:35,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:28:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:35,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:28:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:35,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:28:35,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:35,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:28:35,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:35,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:28:35,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:35,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:28:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:35,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:28:35,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:35,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:28:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:35,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:28:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:35,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:28:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:35,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:28:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:35,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:28:35,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:35,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:28:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:35,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:28:35,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:35,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:28:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:35,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:28:35,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:35,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-20 07:28:35,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:35,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-20 07:28:35,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:35,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-11-20 07:28:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:35,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-11-20 07:28:35,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:35,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-11-20 07:28:35,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:35,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-11-20 07:28:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:35,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-11-20 07:28:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:35,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2021-11-20 07:28:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:35,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2021-11-20 07:28:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:35,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2021-11-20 07:28:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:35,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2021-11-20 07:28:35,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:35,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2021-11-20 07:28:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:35,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2021-11-20 07:28:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:35,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2021-11-20 07:28:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:35,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2021-11-20 07:28:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:35,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2021-11-20 07:28:35,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:35,863 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 890 trivial. 0 not checked. [2021-11-20 07:28:35,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:28:35,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599312726] [2021-11-20 07:28:35,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599312726] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:28:35,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269463087] [2021-11-20 07:28:35,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:28:35,864 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:28:35,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:28:35,865 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:28:35,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-20 07:28:36,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:28:36,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 1304 conjuncts, 40 conjunts are in the unsatisfiable core [2021-11-20 07:28:36,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:28:37,098 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 286 proven. 92 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2021-11-20 07:28:37,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:28:38,214 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 44 proven. 199 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2021-11-20 07:28:38,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269463087] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 07:28:38,214 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 07:28:38,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 18] total 41 [2021-11-20 07:28:38,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143452704] [2021-11-20 07:28:38,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 07:28:38,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-11-20 07:28:38,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:28:38,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-11-20 07:28:38,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1533, Unknown=0, NotChecked=0, Total=1640 [2021-11-20 07:28:38,217 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-11-20 07:29:14,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:29:14,145 INFO L93 Difference]: Finished difference Result 51053 states and 69541 transitions. [2021-11-20 07:29:14,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 371 states. [2021-11-20 07:29:14,145 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-11-20 07:29:14,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:29:14,291 INFO L225 Difference]: With dead ends: 51053 [2021-11-20 07:29:14,291 INFO L226 Difference]: Without dead ends: 46743 [2021-11-20 07:29:14,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1179 GetRequests, 772 SyntacticMatches, 0 SemanticMatches, 407 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69568 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=12708, Invalid=154164, Unknown=0, NotChecked=0, Total=166872 [2021-11-20 07:29:14,328 INFO L933 BasicCegarLoop]: 1221 mSDtfsCounter, 4616 mSDsluCounter, 23620 mSDsCounter, 0 mSdLazyCounter, 25369 mSolverCounterSat, 2904 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s 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, 12.8s IncrementalHoareTripleChecker+Time [2021-11-20 07:29:14,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4628 Valid, 24841 Invalid, 28273 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2904 Valid, 25369 Invalid, 0 Unknown, 0 Unchecked, 12.8s Time] [2021-11-20 07:29:14,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46743 states. [2021-11-20 07:29:15,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46743 to 6590. [2021-11-20 07:29:15,834 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-11-20 07:29:15,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6590 states to 6590 states and 8144 transitions. [2021-11-20 07:29:15,858 INFO L78 Accepts]: Start accepts. Automaton has 6590 states and 8144 transitions. Word has length 361 [2021-11-20 07:29:15,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:29:15,859 INFO L470 AbstractCegarLoop]: Abstraction has 6590 states and 8144 transitions. [2021-11-20 07:29:15,860 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-11-20 07:29:15,860 INFO L276 IsEmpty]: Start isEmpty. Operand 6590 states and 8144 transitions. [2021-11-20 07:29:15,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2021-11-20 07:29:15,878 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:29:15,879 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-11-20 07:29:15,915 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-20 07:29:16,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2021-11-20 07:29:16,092 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:29:16,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:29:16,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1157638044, now seen corresponding path program 1 times [2021-11-20 07:29:16,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:29:16,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168533907] [2021-11-20 07:29:16,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:29:16,092 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:29:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:16,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:29:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:16,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:29:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:16,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-20 07:29:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:16,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-20 07:29:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:16,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-20 07:29:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:16,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:29:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:16,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:29:16,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:16,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:29:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:16,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-20 07:29:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:16,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:29:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:16,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:29:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:16,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:29:16,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:16,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-11-20 07:29:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:16,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:29:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:16,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:29:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:16,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-20 07:29:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:16,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-11-20 07:29:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:16,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2021-11-20 07:29:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:16,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2021-11-20 07:29:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:16,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2021-11-20 07:29:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:16,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2021-11-20 07:29:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:16,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2021-11-20 07:29:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:16,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2021-11-20 07:29:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:16,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2021-11-20 07:29:16,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:16,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2021-11-20 07:29:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:16,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2021-11-20 07:29:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:16,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2021-11-20 07:29:16,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:16,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2021-11-20 07:29:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:16,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2021-11-20 07:29:16,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:16,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2021-11-20 07:29:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:16,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 349 [2021-11-20 07:29:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:16,242 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 9 proven. 136 refuted. 0 times theorem prover too weak. 798 trivial. 0 not checked. [2021-11-20 07:29:16,242 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:29:16,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168533907] [2021-11-20 07:29:16,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168533907] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:29:16,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309833646] [2021-11-20 07:29:16,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:29:16,243 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:29:16,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:29:16,248 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:29:16,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-20 07:29:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:16,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 1302 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 07:29:16,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:29:17,156 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 671 trivial. 0 not checked. [2021-11-20 07:29:17,157 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 07:29:17,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309833646] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:29:17,157 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 07:29:17,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2021-11-20 07:29:17,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744577002] [2021-11-20 07:29:17,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:29:17,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 07:29:17,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:29:17,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 07:29:17,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-20 07:29:17,160 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-11-20 07:29:18,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:29:18,225 INFO L93 Difference]: Finished difference Result 12444 states and 15440 transitions. [2021-11-20 07:29:18,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 07:29:18,225 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-11-20 07:29:18,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:29:18,250 INFO L225 Difference]: With dead ends: 12444 [2021-11-20 07:29:18,250 INFO L226 Difference]: Without dead ends: 6653 [2021-11-20 07:29:18,262 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-11-20 07:29:18,263 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-11-20 07:29:18,264 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-11-20 07:29:18,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6653 states. [2021-11-20 07:29:19,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6653 to 6632. [2021-11-20 07:29:19,357 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-11-20 07:29:19,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6632 states to 6632 states and 8172 transitions. [2021-11-20 07:29:19,369 INFO L78 Accepts]: Start accepts. Automaton has 6632 states and 8172 transitions. Word has length 364 [2021-11-20 07:29:19,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:29:19,370 INFO L470 AbstractCegarLoop]: Abstraction has 6632 states and 8172 transitions. [2021-11-20 07:29:19,371 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-11-20 07:29:19,371 INFO L276 IsEmpty]: Start isEmpty. Operand 6632 states and 8172 transitions. [2021-11-20 07:29:19,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2021-11-20 07:29:19,389 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:29:19,390 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-11-20 07:29:19,428 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-20 07:29:19,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:29:19,604 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:29:19,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:29:19,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1253418756, now seen corresponding path program 1 times [2021-11-20 07:29:19,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:29:19,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372657120] [2021-11-20 07:29:19,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:29:19,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:29:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:19,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:29:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:19,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:29:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:19,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-20 07:29:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:19,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-20 07:29:19,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:19,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-20 07:29:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:19,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:29:19,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:19,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:29:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:19,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:29:19,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:19,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-20 07:29:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:19,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:29:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:19,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:29:19,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:19,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:29:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:19,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-11-20 07:29:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:19,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:29:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:19,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:29:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:19,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-20 07:29:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:19,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-11-20 07:29:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:19,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2021-11-20 07:29:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:19,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2021-11-20 07:29:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:19,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2021-11-20 07:29:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:19,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2021-11-20 07:29:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:19,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-11-20 07:29:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:19,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2021-11-20 07:29:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:19,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2021-11-20 07:29:19,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:19,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2021-11-20 07:29:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:19,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2021-11-20 07:29:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:19,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-11-20 07:29:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:19,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2021-11-20 07:29:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:19,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2021-11-20 07:29:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:19,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2021-11-20 07:29:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:19,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2021-11-20 07:29:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:19,761 INFO L134 CoverageAnalysis]: Checked inductivity of 949 backedges. 9 proven. 136 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2021-11-20 07:29:19,761 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:29:19,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372657120] [2021-11-20 07:29:19,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372657120] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:29:19,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241965242] [2021-11-20 07:29:19,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:29:19,762 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:29:19,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:29:19,763 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:29:19,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-20 07:29:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:19,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 1306 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 07:29:19,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:29:20,441 INFO L134 CoverageAnalysis]: Checked inductivity of 949 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2021-11-20 07:29:20,441 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 07:29:20,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241965242] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:29:20,441 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 07:29:20,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-11-20 07:29:20,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588731917] [2021-11-20 07:29:20,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:29:20,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 07:29:20,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:29:20,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 07:29:20,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 07:29:20,443 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-11-20 07:29:21,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:29:21,221 INFO L93 Difference]: Finished difference Result 12716 states and 15709 transitions. [2021-11-20 07:29:21,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 07:29:21,221 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-11-20 07:29:21,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:29:21,242 INFO L225 Difference]: With dead ends: 12716 [2021-11-20 07:29:21,242 INFO L226 Difference]: Without dead ends: 6085 [2021-11-20 07:29:21,254 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-11-20 07:29:21,255 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 28 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:29:21,255 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.1s Time] [2021-11-20 07:29:21,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6085 states. [2021-11-20 07:29:22,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6085 to 6085. [2021-11-20 07:29:22,322 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-11-20 07:29:22,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6085 states to 6085 states and 7530 transitions. [2021-11-20 07:29:22,334 INFO L78 Accepts]: Start accepts. Automaton has 6085 states and 7530 transitions. Word has length 365 [2021-11-20 07:29:22,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:29:22,334 INFO L470 AbstractCegarLoop]: Abstraction has 6085 states and 7530 transitions. [2021-11-20 07:29:22,334 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-11-20 07:29:22,334 INFO L276 IsEmpty]: Start isEmpty. Operand 6085 states and 7530 transitions. [2021-11-20 07:29:22,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2021-11-20 07:29:22,345 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:29:22,346 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-11-20 07:29:22,367 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-11-20 07:29:22,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:29:22,546 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:29:22,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:29:22,547 INFO L85 PathProgramCache]: Analyzing trace with hash -867693373, now seen corresponding path program 1 times [2021-11-20 07:29:22,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:29:22,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099837022] [2021-11-20 07:29:22,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:29:22,547 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:29:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:22,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:29:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:22,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:29:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:22,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:29:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:22,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:29:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:22,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:29:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:22,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:29:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:22,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:29:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:22,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:29:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:22,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:29:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:22,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:29:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:22,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:29:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:22,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:29:22,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:22,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:29:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:22,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:29:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:22,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:29:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:22,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-20 07:29:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:22,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-20 07:29:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:22,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-11-20 07:29:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:22,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-11-20 07:29:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:22,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-11-20 07:29:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:22,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2021-11-20 07:29:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:22,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-11-20 07:29:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:22,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2021-11-20 07:29:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:22,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2021-11-20 07:29:22,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:22,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2021-11-20 07:29:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:22,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2021-11-20 07:29:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:22,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2021-11-20 07:29:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:22,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 322 [2021-11-20 07:29:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:22,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2021-11-20 07:29:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:22,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2021-11-20 07:29:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:22,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2021-11-20 07:29:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:22,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2021-11-20 07:29:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:22,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 16 proven. 34 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2021-11-20 07:29:22,896 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:29:22,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099837022] [2021-11-20 07:29:22,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099837022] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:29:22,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219281819] [2021-11-20 07:29:22,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:29:22,906 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:29:22,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:29:22,922 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:29:22,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-20 07:29:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:23,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 1331 conjuncts, 64 conjunts are in the unsatisfiable core [2021-11-20 07:29:23,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:29:24,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 482 proven. 210 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2021-11-20 07:29:24,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:29:26,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 112 proven. 194 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2021-11-20 07:29:26,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219281819] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 07:29:26,580 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 07:29:26,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 26, 21] total 55 [2021-11-20 07:29:26,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172459119] [2021-11-20 07:29:26,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 07:29:26,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-11-20 07:29:26,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:29:26,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-11-20 07:29:26,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=2761, Unknown=0, NotChecked=0, Total=2970 [2021-11-20 07:29:26,583 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-11-20 07:30:13,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:30:13,146 INFO L93 Difference]: Finished difference Result 49444 states and 67208 transitions. [2021-11-20 07:30:13,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 371 states. [2021-11-20 07:30:13,147 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-11-20 07:30:13,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:30:13,257 INFO L225 Difference]: With dead ends: 49444 [2021-11-20 07:30:13,257 INFO L226 Difference]: Without dead ends: 43970 [2021-11-20 07:30:13,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1208 GetRequests, 788 SyntacticMatches, 0 SemanticMatches, 420 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70208 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=10011, Invalid=167651, Unknown=0, NotChecked=0, Total=177662 [2021-11-20 07:30:13,288 INFO L933 BasicCegarLoop]: 2196 mSDtfsCounter, 3988 mSDsluCounter, 52968 mSDsCounter, 0 mSdLazyCounter, 44628 mSolverCounterSat, 3508 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.3s 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, 23.8s IncrementalHoareTripleChecker+Time [2021-11-20 07:30:13,289 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4016 Valid, 55164 Invalid, 48136 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [3508 Valid, 44628 Invalid, 0 Unknown, 0 Unchecked, 23.8s Time] [2021-11-20 07:30:13,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43970 states. [2021-11-20 07:30:14,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43970 to 6103. [2021-11-20 07:30:14,790 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-11-20 07:30:14,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6103 states to 6103 states and 7548 transitions. [2021-11-20 07:30:14,806 INFO L78 Accepts]: Start accepts. Automaton has 6103 states and 7548 transitions. Word has length 372 [2021-11-20 07:30:14,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:30:14,807 INFO L470 AbstractCegarLoop]: Abstraction has 6103 states and 7548 transitions. [2021-11-20 07:30:14,807 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-11-20 07:30:14,807 INFO L276 IsEmpty]: Start isEmpty. Operand 6103 states and 7548 transitions. [2021-11-20 07:30:14,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2021-11-20 07:30:14,815 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:30:14,815 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-11-20 07:30:14,840 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-11-20 07:30:15,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2021-11-20 07:30:15,017 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:30:15,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:30:15,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1702339438, now seen corresponding path program 1 times [2021-11-20 07:30:15,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:30:15,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866220083] [2021-11-20 07:30:15,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:30:15,018 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:30:15,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:15,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:30:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:15,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:30:15,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:15,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:30:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:15,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:30:15,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:15,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:30:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:15,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:30:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:15,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:30:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:15,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:30:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:15,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:30:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:15,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:30:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:15,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:30:15,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:15,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:30:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:15,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:30:15,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:15,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:30:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:15,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:30:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:15,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-20 07:30:15,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:15,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-20 07:30:15,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:15,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-11-20 07:30:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:15,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-11-20 07:30:15,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:15,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-11-20 07:30:15,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:15,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2021-11-20 07:30:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:15,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-11-20 07:30:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:15,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2021-11-20 07:30:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:15,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2021-11-20 07:30:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:15,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2021-11-20 07:30:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:15,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2021-11-20 07:30:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:15,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2021-11-20 07:30:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:15,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-11-20 07:30:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:15,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2021-11-20 07:30:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:15,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2021-11-20 07:30:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:15,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2021-11-20 07:30:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:15,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2021-11-20 07:30:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:15,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2021-11-20 07:30:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:15,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1066 trivial. 0 not checked. [2021-11-20 07:30:15,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:30:15,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866220083] [2021-11-20 07:30:15,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866220083] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:30:15,222 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:30:15,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 07:30:15,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866854144] [2021-11-20 07:30:15,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:30:15,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 07:30:15,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:30:15,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 07:30:15,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-20 07:30:15,224 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-11-20 07:30:16,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:30:16,456 INFO L93 Difference]: Finished difference Result 11684 states and 14501 transitions. [2021-11-20 07:30:16,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 07:30:16,457 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-11-20 07:30:16,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:30:16,466 INFO L225 Difference]: With dead ends: 11684 [2021-11-20 07:30:16,466 INFO L226 Difference]: Without dead ends: 6109 [2021-11-20 07:30:16,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-20 07:30:16,471 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.3s IncrementalHoareTripleChecker+Time [2021-11-20 07:30:16,471 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.3s Time] [2021-11-20 07:30:16,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6109 states. [2021-11-20 07:30:17,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6109 to 6091. [2021-11-20 07:30:17,493 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-11-20 07:30:17,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6091 states to 6091 states and 7530 transitions. [2021-11-20 07:30:17,505 INFO L78 Accepts]: Start accepts. Automaton has 6091 states and 7530 transitions. Word has length 383 [2021-11-20 07:30:17,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:30:17,505 INFO L470 AbstractCegarLoop]: Abstraction has 6091 states and 7530 transitions. [2021-11-20 07:30:17,506 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-11-20 07:30:17,506 INFO L276 IsEmpty]: Start isEmpty. Operand 6091 states and 7530 transitions. [2021-11-20 07:30:17,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2021-11-20 07:30:17,517 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:30:17,517 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-11-20 07:30:17,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-11-20 07:30:17,518 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:30:17,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:30:17,518 INFO L85 PathProgramCache]: Analyzing trace with hash 20866322, now seen corresponding path program 1 times [2021-11-20 07:30:17,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:30:17,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447745247] [2021-11-20 07:30:17,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:30:17,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:30:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:17,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:30:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:17,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:30:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:17,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:30:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:17,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:30:17,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:17,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:30:17,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:17,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:30:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:17,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:30:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:17,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:30:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:17,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:30:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:17,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:30:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:17,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:30:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:17,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:30:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:17,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:30:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:17,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:30:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:17,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:30:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:17,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-20 07:30:17,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:17,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-20 07:30:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:17,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-11-20 07:30:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:17,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-11-20 07:30:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:17,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-11-20 07:30:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:17,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2021-11-20 07:30:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:17,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-11-20 07:30:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:17,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2021-11-20 07:30:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:17,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2021-11-20 07:30:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:17,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2021-11-20 07:30:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:17,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2021-11-20 07:30:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:17,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2021-11-20 07:30:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:17,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-11-20 07:30:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:17,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2021-11-20 07:30:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:17,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2021-11-20 07:30:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:17,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2021-11-20 07:30:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:17,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2021-11-20 07:30:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:17,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2021-11-20 07:30:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:17,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2021-11-20 07:30:17,684 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:30:17,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447745247] [2021-11-20 07:30:17,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447745247] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:30:17,685 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:30:17,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 07:30:17,685 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588125186] [2021-11-20 07:30:17,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:30:17,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 07:30:17,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:30:17,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 07:30:17,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 07:30:17,687 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-11-20 07:30:18,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:30:18,491 INFO L93 Difference]: Finished difference Result 8872 states and 10981 transitions. [2021-11-20 07:30:18,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 07:30:18,491 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-11-20 07:30:18,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:30:18,497 INFO L225 Difference]: With dead ends: 8872 [2021-11-20 07:30:18,498 INFO L226 Difference]: Without dead ends: 3302 [2021-11-20 07:30:18,503 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-11-20 07:30:18,503 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.2s IncrementalHoareTripleChecker+Time [2021-11-20 07:30:18,504 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.2s Time] [2021-11-20 07:30:18,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3302 states. [2021-11-20 07:30:19,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3302 to 3302. [2021-11-20 07:30:19,033 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-11-20 07:30:19,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3302 states to 3302 states and 4039 transitions. [2021-11-20 07:30:19,039 INFO L78 Accepts]: Start accepts. Automaton has 3302 states and 4039 transitions. Word has length 383 [2021-11-20 07:30:19,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:30:19,039 INFO L470 AbstractCegarLoop]: Abstraction has 3302 states and 4039 transitions. [2021-11-20 07:30:19,039 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-11-20 07:30:19,039 INFO L276 IsEmpty]: Start isEmpty. Operand 3302 states and 4039 transitions. [2021-11-20 07:30:19,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2021-11-20 07:30:19,044 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:30:19,044 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-11-20 07:30:19,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-11-20 07:30:19,044 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:30:19,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:30:19,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1998056988, now seen corresponding path program 1 times [2021-11-20 07:30:19,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:30:19,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151637014] [2021-11-20 07:30:19,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:30:19,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:30:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:19,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:30:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:19,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:30:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:19,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:30:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:19,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:30:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:19,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:30:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:19,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:30:19,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:19,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:30:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:19,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:30:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:19,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:30:19,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:19,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:30:19,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:19,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:30:19,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:19,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:30:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:19,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:30:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:19,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:30:19,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:19,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:30:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:19,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-20 07:30:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:19,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-20 07:30:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:19,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-11-20 07:30:19,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:19,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-11-20 07:30:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:19,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-11-20 07:30:19,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:19,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2021-11-20 07:30:19,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:19,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-11-20 07:30:19,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:19,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2021-11-20 07:30:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:19,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2021-11-20 07:30:19,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:19,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2021-11-20 07:30:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:19,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2021-11-20 07:30:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:19,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2021-11-20 07:30:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:19,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-11-20 07:30:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:19,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2021-11-20 07:30:19,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:19,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2021-11-20 07:30:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:19,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2021-11-20 07:30:19,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:19,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2021-11-20 07:30:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:19,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2021-11-20 07:30:19,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:19,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 52 proven. 51 refuted. 0 times theorem prover too weak. 962 trivial. 0 not checked. [2021-11-20 07:30:19,428 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:30:19,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151637014] [2021-11-20 07:30:19,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151637014] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:30:19,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190773009] [2021-11-20 07:30:19,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:30:19,429 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:30:19,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:30:19,432 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:30:19,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-20 07:30:19,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:19,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 1356 conjuncts, 62 conjunts are in the unsatisfiable core [2021-11-20 07:30:19,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:30:21,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 542 proven. 221 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2021-11-20 07:30:21,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:30:22,708 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger: modulus not positive [2021-11-20 07:30:22,708 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-20 07:30:22,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2021-11-20 07:30:22,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702826994] [2021-11-20 07:30:22,708 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-20 07:30:22,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-20 07:30:22,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:30:22,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-20 07:30:22,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2366, Unknown=0, NotChecked=0, Total=2550 [2021-11-20 07:30:22,709 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-11-20 07:30:27,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:30:27,551 INFO L93 Difference]: Finished difference Result 15059 states and 18818 transitions. [2021-11-20 07:30:27,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-11-20 07:30:27,551 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-11-20 07:30:27,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:30:27,574 INFO L225 Difference]: With dead ends: 15059 [2021-11-20 07:30:27,574 INFO L226 Difference]: Without dead ends: 12281 [2021-11-20 07:30:27,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 717 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1518 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=652, Invalid=7180, Unknown=0, NotChecked=0, Total=7832 [2021-11-20 07:30:27,579 INFO L933 BasicCegarLoop]: 449 mSDtfsCounter, 1239 mSDsluCounter, 3429 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2021-11-20 07:30:27,579 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.3s Time] [2021-11-20 07:30:27,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12281 states. [2021-11-20 07:30:28,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12281 to 4730. [2021-11-20 07:30:28,363 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-11-20 07:30:28,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4730 states to 4730 states and 5806 transitions. [2021-11-20 07:30:28,375 INFO L78 Accepts]: Start accepts. Automaton has 4730 states and 5806 transitions. Word has length 383 [2021-11-20 07:30:28,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:30:28,376 INFO L470 AbstractCegarLoop]: Abstraction has 4730 states and 5806 transitions. [2021-11-20 07:30:28,377 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-11-20 07:30:28,377 INFO L276 IsEmpty]: Start isEmpty. Operand 4730 states and 5806 transitions. [2021-11-20 07:30:28,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2021-11-20 07:30:28,384 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:30:28,384 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-11-20 07:30:28,406 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-11-20 07:30:28,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2021-11-20 07:30:28,585 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:30:28,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:30:28,586 INFO L85 PathProgramCache]: Analyzing trace with hash -103486524, now seen corresponding path program 1 times [2021-11-20 07:30:28,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:30:28,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032252543] [2021-11-20 07:30:28,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:30:28,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:30:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:28,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:30:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:28,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:30:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:28,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:30:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:28,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:30:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:28,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:30:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:28,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:30:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:28,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:30:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:28,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:30:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:28,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:30:28,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:28,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:30:28,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:28,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:30:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:28,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:30:28,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:28,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:30:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:28,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:30:28,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:28,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:30:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:28,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-20 07:30:28,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:28,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-20 07:30:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:28,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-11-20 07:30:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:28,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-11-20 07:30:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:28,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-11-20 07:30:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:28,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2021-11-20 07:30:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:28,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-11-20 07:30:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:28,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2021-11-20 07:30:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:28,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2021-11-20 07:30:28,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:28,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2021-11-20 07:30:28,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:28,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2021-11-20 07:30:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:28,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2021-11-20 07:30:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:28,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-11-20 07:30:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:28,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2021-11-20 07:30:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:28,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2021-11-20 07:30:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:28,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2021-11-20 07:30:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:28,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2021-11-20 07:30:28,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:28,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2021-11-20 07:30:28,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:28,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1068 backedges. 36 proven. 66 refuted. 0 times theorem prover too weak. 966 trivial. 0 not checked. [2021-11-20 07:30:28,936 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:30:28,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032252543] [2021-11-20 07:30:28,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032252543] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:30:28,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84728531] [2021-11-20 07:30:28,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:30:28,937 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:30:28,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:30:28,943 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:30:28,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-20 07:30:29,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:29,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 1357 conjuncts, 62 conjunts are in the unsatisfiable core [2021-11-20 07:30:29,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:30:30,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1068 backedges. 545 proven. 221 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2021-11-20 07:30:30,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:30:31,983 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger: modulus not positive [2021-11-20 07:30:31,984 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-20 07:30:31,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2021-11-20 07:30:31,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831674478] [2021-11-20 07:30:31,984 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-20 07:30:31,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-20 07:30:31,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:30:31,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-20 07:30:31,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2345, Unknown=0, NotChecked=0, Total=2550 [2021-11-20 07:30:31,985 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-11-20 07:30:34,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:30:34,954 INFO L93 Difference]: Finished difference Result 9021 states and 11127 transitions. [2021-11-20 07:30:34,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-11-20 07:30:34,955 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-11-20 07:30:34,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:30:34,962 INFO L225 Difference]: With dead ends: 9021 [2021-11-20 07:30:34,962 INFO L226 Difference]: Without dead ends: 4878 [2021-11-20 07:30:34,965 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 782 GetRequests, 698 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1543 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=798, Invalid=6512, Unknown=0, NotChecked=0, Total=7310 [2021-11-20 07:30:34,966 INFO L933 BasicCegarLoop]: 640 mSDtfsCounter, 825 mSDsluCounter, 4294 mSDsCounter, 0 mSdLazyCounter, 2181 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 1.1s IncrementalHoareTripleChecker+Time [2021-11-20 07:30:34,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [855 Valid, 4934 Invalid, 2414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 2181 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-20 07:30:34,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4878 states. [2021-11-20 07:30:35,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4878 to 3651. [2021-11-20 07:30:35,567 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-11-20 07:30:35,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3651 states to 3651 states and 4437 transitions. [2021-11-20 07:30:35,573 INFO L78 Accepts]: Start accepts. Automaton has 3651 states and 4437 transitions. Word has length 383 [2021-11-20 07:30:35,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:30:35,573 INFO L470 AbstractCegarLoop]: Abstraction has 3651 states and 4437 transitions. [2021-11-20 07:30:35,574 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-11-20 07:30:35,574 INFO L276 IsEmpty]: Start isEmpty. Operand 3651 states and 4437 transitions. [2021-11-20 07:30:35,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2021-11-20 07:30:35,579 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:30:35,579 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-11-20 07:30:35,600 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-11-20 07:30:35,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2021-11-20 07:30:35,780 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:30:35,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:30:35,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1809377308, now seen corresponding path program 1 times [2021-11-20 07:30:35,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:30:35,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597185411] [2021-11-20 07:30:35,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:30:35,780 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:30:35,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:36,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:30:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:36,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:30:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:36,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:30:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:36,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:30:36,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:36,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:30:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:36,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:30:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:36,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:30:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:36,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:30:36,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:36,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:30:36,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:36,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:30:36,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:36,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:30:36,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:36,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:30:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:36,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:30:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:36,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:30:36,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:36,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:30:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:36,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-20 07:30:36,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:36,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-20 07:30:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:36,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-11-20 07:30:36,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:36,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2021-11-20 07:30:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:36,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-11-20 07:30:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:36,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2021-11-20 07:30:36,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:36,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-11-20 07:30:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:36,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2021-11-20 07:30:36,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:36,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2021-11-20 07:30:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:36,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2021-11-20 07:30:36,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:36,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2021-11-20 07:30:36,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:36,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2021-11-20 07:30:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:36,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-11-20 07:30:36,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:36,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2021-11-20 07:30:36,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:36,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2021-11-20 07:30:36,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:36,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2021-11-20 07:30:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:36,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2021-11-20 07:30:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:36,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2021-11-20 07:30:36,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:36,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2021-11-20 07:30:36,174 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:30:36,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597185411] [2021-11-20 07:30:36,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597185411] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:30:36,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330721991] [2021-11-20 07:30:36,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:30:36,175 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:30:36,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:30:36,180 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:30:36,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-11-20 07:30:36,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:36,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 1356 conjuncts, 62 conjunts are in the unsatisfiable core [2021-11-20 07:30:36,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:30:37,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 542 proven. 221 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2021-11-20 07:30:37,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:30:39,367 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger: modulus not positive [2021-11-20 07:30:39,367 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-20 07:30:39,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2021-11-20 07:30:39,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53658862] [2021-11-20 07:30:39,368 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-20 07:30:39,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-20 07:30:39,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:30:39,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-20 07:30:39,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2569, Unknown=0, NotChecked=0, Total=2756 [2021-11-20 07:30:39,369 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-11-20 07:30:47,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:30:47,796 INFO L93 Difference]: Finished difference Result 16024 states and 20339 transitions. [2021-11-20 07:30:47,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-11-20 07:30:47,797 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-11-20 07:30:47,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:30:47,827 INFO L225 Difference]: With dead ends: 16024 [2021-11-20 07:30:47,827 INFO L226 Difference]: Without dead ends: 12960 [2021-11-20 07:30:47,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 830 GetRequests, 703 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3767 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1591, Invalid=14921, Unknown=0, NotChecked=0, Total=16512 [2021-11-20 07:30:47,838 INFO L933 BasicCegarLoop]: 930 mSDtfsCounter, 1371 mSDsluCounter, 5894 mSDsCounter, 0 mSdLazyCounter, 6061 mSolverCounterSat, 649 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.8s IncrementalHoareTripleChecker+Time [2021-11-20 07:30:47,838 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.8s Time] [2021-11-20 07:30:47,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12960 states. [2021-11-20 07:30:48,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12960 to 3651. [2021-11-20 07:30:48,618 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-11-20 07:30:48,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3651 states to 3651 states and 4437 transitions. [2021-11-20 07:30:48,625 INFO L78 Accepts]: Start accepts. Automaton has 3651 states and 4437 transitions. Word has length 383 [2021-11-20 07:30:48,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:30:48,626 INFO L470 AbstractCegarLoop]: Abstraction has 3651 states and 4437 transitions. [2021-11-20 07:30:48,626 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-11-20 07:30:48,626 INFO L276 IsEmpty]: Start isEmpty. Operand 3651 states and 4437 transitions. [2021-11-20 07:30:48,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2021-11-20 07:30:48,631 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:30:48,631 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-11-20 07:30:48,652 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-11-20 07:30:48,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:30:48,832 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:30:48,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:30:48,832 INFO L85 PathProgramCache]: Analyzing trace with hash 872240243, now seen corresponding path program 1 times [2021-11-20 07:30:48,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:30:48,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46858066] [2021-11-20 07:30:48,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:30:48,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:30:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:49,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:30:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:49,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:30:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:49,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:30:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:49,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:30:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:49,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:30:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:49,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:30:49,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:49,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:30:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:49,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:30:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:49,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:30:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:49,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:30:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:49,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:30:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:49,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:30:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:49,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:30:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:49,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:30:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:49,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:30:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:49,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-20 07:30:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:49,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-20 07:30:49,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:49,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-11-20 07:30:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:49,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-11-20 07:30:49,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:49,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2021-11-20 07:30:49,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:49,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2021-11-20 07:30:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:49,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2021-11-20 07:30:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:49,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2021-11-20 07:30:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:49,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2021-11-20 07:30:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:49,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2021-11-20 07:30:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:49,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2021-11-20 07:30:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:49,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2021-11-20 07:30:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:49,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2021-11-20 07:30:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:49,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2021-11-20 07:30:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:49,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2021-11-20 07:30:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:49,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2021-11-20 07:30:49,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:49,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2021-11-20 07:30:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:49,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2021-11-20 07:30:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:49,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2021-11-20 07:30:49,213 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:30:49,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46858066] [2021-11-20 07:30:49,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46858066] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:30:49,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918492090] [2021-11-20 07:30:49,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:30:49,214 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:30:49,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:30:49,219 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:30:49,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-11-20 07:30:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:30:49,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 1357 conjuncts, 62 conjunts are in the unsatisfiable core [2021-11-20 07:30:49,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:30:51,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 542 proven. 221 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2021-11-20 07:30:51,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:30:52,352 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger: modulus not positive [2021-11-20 07:30:52,352 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-20 07:30:52,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2021-11-20 07:30:52,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051824858] [2021-11-20 07:30:52,353 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-20 07:30:52,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-20 07:30:52,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:30:52,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-20 07:30:52,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2569, Unknown=0, NotChecked=0, Total=2756 [2021-11-20 07:30:52,355 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-11-20 07:31:01,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:31:01,020 INFO L93 Difference]: Finished difference Result 15966 states and 20281 transitions. [2021-11-20 07:31:01,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-11-20 07:31:01,020 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-11-20 07:31:01,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:31:01,041 INFO L225 Difference]: With dead ends: 15966 [2021-11-20 07:31:01,041 INFO L226 Difference]: Without dead ends: 12902 [2021-11-20 07:31:01,048 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 832 GetRequests, 705 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3766 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1591, Invalid=14921, Unknown=0, NotChecked=0, Total=16512 [2021-11-20 07:31:01,049 INFO L933 BasicCegarLoop]: 930 mSDtfsCounter, 1370 mSDsluCounter, 5894 mSDsCounter, 0 mSdLazyCounter, 6061 mSolverCounterSat, 698 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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, 2.8s IncrementalHoareTripleChecker+Time [2021-11-20 07:31:01,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1385 Valid, 6824 Invalid, 6759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [698 Valid, 6061 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2021-11-20 07:31:01,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12902 states. [2021-11-20 07:31:01,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12902 to 3641. [2021-11-20 07:31:01,858 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-11-20 07:31:01,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3641 states to 3641 states and 4427 transitions. [2021-11-20 07:31:01,866 INFO L78 Accepts]: Start accepts. Automaton has 3641 states and 4427 transitions. Word has length 384 [2021-11-20 07:31:01,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:31:01,867 INFO L470 AbstractCegarLoop]: Abstraction has 3641 states and 4427 transitions. [2021-11-20 07:31:01,867 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-11-20 07:31:01,867 INFO L276 IsEmpty]: Start isEmpty. Operand 3641 states and 4427 transitions. [2021-11-20 07:31:01,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2021-11-20 07:31:01,874 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:31:01,875 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-11-20 07:31:01,914 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-11-20 07:31:02,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:31:02,088 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:31:02,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:31:02,088 INFO L85 PathProgramCache]: Analyzing trace with hash 962300533, now seen corresponding path program 1 times [2021-11-20 07:31:02,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:31:02,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080093878] [2021-11-20 07:31:02,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:31:02,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:31:02,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:02,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:31:02,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:02,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:31:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:02,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:31:02,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:02,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:31:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:02,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:31:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:02,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:31:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:02,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:31:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:02,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:31:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:02,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:31:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:02,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:31:02,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:02,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:31:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:02,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:31:02,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:02,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:31:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:02,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:31:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:02,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:31:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:02,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-20 07:31:02,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:02,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-20 07:31:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:02,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-11-20 07:31:02,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:02,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2021-11-20 07:31:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:02,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2021-11-20 07:31:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:02,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2021-11-20 07:31:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:02,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2021-11-20 07:31:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:02,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2021-11-20 07:31:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:02,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2021-11-20 07:31:02,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:02,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2021-11-20 07:31:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:02,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2021-11-20 07:31:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:02,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2021-11-20 07:31:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:02,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2021-11-20 07:31:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:02,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2021-11-20 07:31:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:02,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2021-11-20 07:31:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:02,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2021-11-20 07:31:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:02,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2021-11-20 07:31:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:02,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2021-11-20 07:31:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:02,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1057 trivial. 0 not checked. [2021-11-20 07:31:02,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:31:02,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080093878] [2021-11-20 07:31:02,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080093878] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:31:02,252 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:31:02,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 07:31:02,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965642711] [2021-11-20 07:31:02,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:31:02,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 07:31:02,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:31:02,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 07:31:02,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 07:31:02,254 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-11-20 07:31:03,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:31:03,038 INFO L93 Difference]: Finished difference Result 5769 states and 7045 transitions. [2021-11-20 07:31:03,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 07:31:03,039 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-11-20 07:31:03,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:31:03,043 INFO L225 Difference]: With dead ends: 5769 [2021-11-20 07:31:03,043 INFO L226 Difference]: Without dead ends: 2454 [2021-11-20 07:31:03,048 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-11-20 07:31:03,049 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-11-20 07:31:03,049 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-11-20 07:31:03,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2454 states. [2021-11-20 07:31:03,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2454 to 2454. [2021-11-20 07:31:03,528 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-11-20 07:31:03,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2454 states to 2454 states and 2975 transitions. [2021-11-20 07:31:03,533 INFO L78 Accepts]: Start accepts. Automaton has 2454 states and 2975 transitions. Word has length 384 [2021-11-20 07:31:03,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:31:03,534 INFO L470 AbstractCegarLoop]: Abstraction has 2454 states and 2975 transitions. [2021-11-20 07:31:03,534 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-11-20 07:31:03,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2454 states and 2975 transitions. [2021-11-20 07:31:03,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2021-11-20 07:31:03,540 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:31:03,540 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-11-20 07:31:03,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-11-20 07:31:03,541 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:31:03,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:31:03,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1519421243, now seen corresponding path program 1 times [2021-11-20 07:31:03,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:31:03,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428414109] [2021-11-20 07:31:03,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:31:03,542 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:31:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:03,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:31:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:03,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:31:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:03,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:31:03,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:03,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:31:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:03,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:31:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:03,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:31:03,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:03,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:31:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:03,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:31:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:03,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:31:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:03,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:31:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:03,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:31:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:03,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:31:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:03,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:31:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:03,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:31:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:03,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:31:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:03,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-20 07:31:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:03,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-20 07:31:03,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:03,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-11-20 07:31:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:03,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-11-20 07:31:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:03,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-11-20 07:31:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:03,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2021-11-20 07:31:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:03,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2021-11-20 07:31:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:03,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2021-11-20 07:31:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:03,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2021-11-20 07:31:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:03,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2021-11-20 07:31:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:03,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2021-11-20 07:31:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:03,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2021-11-20 07:31:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:03,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2021-11-20 07:31:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:03,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2021-11-20 07:31:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:03,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2021-11-20 07:31:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:03,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2021-11-20 07:31:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:03,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2021-11-20 07:31:03,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:03,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2021-11-20 07:31:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:03,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-11-20 07:31:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:03,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1060 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 1023 trivial. 0 not checked. [2021-11-20 07:31:03,753 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:31:03,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428414109] [2021-11-20 07:31:03,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428414109] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:31:03,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982242101] [2021-11-20 07:31:03,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:31:03,754 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:31:03,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:31:03,755 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:31:03,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-11-20 07:31:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:04,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 1380 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-20 07:31:04,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:31:04,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1060 backedges. 127 proven. 307 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2021-11-20 07:31:04,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:31:05,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1060 backedges. 17 proven. 33 refuted. 0 times theorem prover too weak. 1010 trivial. 0 not checked. [2021-11-20 07:31:05,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982242101] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 07:31:05,568 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 07:31:05,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12] total 20 [2021-11-20 07:31:05,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693464201] [2021-11-20 07:31:05,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 07:31:05,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-20 07:31:05,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:31:05,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-20 07:31:05,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2021-11-20 07:31:05,570 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-11-20 07:31:13,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:31:13,196 INFO L93 Difference]: Finished difference Result 12366 states and 15752 transitions. [2021-11-20 07:31:13,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2021-11-20 07:31:13,196 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-11-20 07:31:13,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:31:13,213 INFO L225 Difference]: With dead ends: 12366 [2021-11-20 07:31:13,213 INFO L226 Difference]: Without dead ends: 10378 [2021-11-20 07:31:13,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 994 GetRequests, 881 SyntacticMatches, 1 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4336 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1160, Invalid=11722, Unknown=0, NotChecked=0, Total=12882 [2021-11-20 07:31:13,218 INFO L933 BasicCegarLoop]: 592 mSDtfsCounter, 2989 mSDsluCounter, 7297 mSDsCounter, 0 mSdLazyCounter, 5645 mSolverCounterSat, 1097 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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, 2.7s IncrementalHoareTripleChecker+Time [2021-11-20 07:31:13,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3000 Valid, 7889 Invalid, 6742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1097 Valid, 5645 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2021-11-20 07:31:13,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10378 states. [2021-11-20 07:31:14,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10378 to 4023. [2021-11-20 07:31:14,172 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-11-20 07:31:14,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4023 states to 4023 states and 4829 transitions. [2021-11-20 07:31:14,179 INFO L78 Accepts]: Start accepts. Automaton has 4023 states and 4829 transitions. Word has length 389 [2021-11-20 07:31:14,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:31:14,180 INFO L470 AbstractCegarLoop]: Abstraction has 4023 states and 4829 transitions. [2021-11-20 07:31:14,180 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-11-20 07:31:14,180 INFO L276 IsEmpty]: Start isEmpty. Operand 4023 states and 4829 transitions. [2021-11-20 07:31:14,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2021-11-20 07:31:14,183 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:31:14,184 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-11-20 07:31:14,205 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-11-20 07:31:14,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2021-11-20 07:31:14,384 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:31:14,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:31:14,385 INFO L85 PathProgramCache]: Analyzing trace with hash 49162586, now seen corresponding path program 1 times [2021-11-20 07:31:14,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:31:14,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591517576] [2021-11-20 07:31:14,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:31:14,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:31:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:14,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:31:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:14,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:31:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:14,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:31:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:14,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:31:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:14,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:31:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:14,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:31:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:14,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:31:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:14,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:31:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:14,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:31:14,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:14,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:31:14,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:14,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:31:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:14,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:31:14,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:14,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:31:14,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:14,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:31:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:14,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:31:14,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:14,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-20 07:31:14,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:14,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-20 07:31:14,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:14,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-11-20 07:31:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:14,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2021-11-20 07:31:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:14,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2021-11-20 07:31:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:14,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-11-20 07:31:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:14,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-11-20 07:31:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:14,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2021-11-20 07:31:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:14,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2021-11-20 07:31:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:14,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2021-11-20 07:31:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:14,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2021-11-20 07:31:14,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:14,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2021-11-20 07:31:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:14,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 313 [2021-11-20 07:31:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:14,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2021-11-20 07:31:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:14,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2021-11-20 07:31:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:14,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2021-11-20 07:31:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:14,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2021-11-20 07:31:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:14,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2021-11-20 07:31:14,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:14,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2021-11-20 07:31:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:14,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1119 backedges. 29 proven. 4 refuted. 0 times theorem prover too weak. 1086 trivial. 0 not checked. [2021-11-20 07:31:14,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:31:14,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591517576] [2021-11-20 07:31:14,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591517576] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:31:14,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120895471] [2021-11-20 07:31:14,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:31:14,582 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:31:14,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:31:14,583 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:31:14,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-11-20 07:31:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:14,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 1388 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-20 07:31:14,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:31:15,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1119 backedges. 283 proven. 5 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2021-11-20 07:31:15,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:31:16,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1119 backedges. 39 proven. 6 refuted. 0 times theorem prover too weak. 1074 trivial. 0 not checked. [2021-11-20 07:31:16,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120895471] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 07:31:16,078 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 07:31:16,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 21 [2021-11-20 07:31:16,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280915723] [2021-11-20 07:31:16,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 07:31:16,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-20 07:31:16,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:31:16,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-20 07:31:16,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2021-11-20 07:31:16,080 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-11-20 07:31:20,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:31:20,041 INFO L93 Difference]: Finished difference Result 10784 states and 13317 transitions. [2021-11-20 07:31:20,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-20 07:31:20,041 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-11-20 07:31:20,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:31:20,058 INFO L225 Difference]: With dead ends: 10784 [2021-11-20 07:31:20,058 INFO L226 Difference]: Without dead ends: 7158 [2021-11-20 07:31:20,065 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 890 GetRequests, 848 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=273, Invalid=1619, Unknown=0, NotChecked=0, Total=1892 [2021-11-20 07:31:20,066 INFO L933 BasicCegarLoop]: 429 mSDtfsCounter, 1741 mSDsluCounter, 4054 mSDsCounter, 0 mSdLazyCounter, 3153 mSolverCounterSat, 519 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2021-11-20 07:31:20,066 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.4s Time] [2021-11-20 07:31:20,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7158 states. [2021-11-20 07:31:21,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7158 to 3855. [2021-11-20 07:31:21,118 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-11-20 07:31:21,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3855 states to 3855 states and 4556 transitions. [2021-11-20 07:31:21,124 INFO L78 Accepts]: Start accepts. Automaton has 3855 states and 4556 transitions. Word has length 392 [2021-11-20 07:31:21,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:31:21,124 INFO L470 AbstractCegarLoop]: Abstraction has 3855 states and 4556 transitions. [2021-11-20 07:31:21,125 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-11-20 07:31:21,125 INFO L276 IsEmpty]: Start isEmpty. Operand 3855 states and 4556 transitions. [2021-11-20 07:31:21,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2021-11-20 07:31:21,128 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:31:21,128 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-11-20 07:31:21,153 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2021-11-20 07:31:21,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2021-11-20 07:31:21,329 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:31:21,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:31:21,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1107538834, now seen corresponding path program 1 times [2021-11-20 07:31:21,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:31:21,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356329599] [2021-11-20 07:31:21,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:31:21,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:31:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:21,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-20 07:31:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:21,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 07:31:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:21,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-20 07:31:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:21,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-20 07:31:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:21,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-20 07:31:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:21,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-20 07:31:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:21,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-20 07:31:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:21,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-20 07:31:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:21,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 07:31:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:21,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-20 07:31:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:21,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:31:21,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:21,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-20 07:31:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:21,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-20 07:31:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:21,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-20 07:31:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:21,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 07:31:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:21,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-20 07:31:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:21,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2021-11-20 07:31:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:21,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2021-11-20 07:31:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:21,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-11-20 07:31:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:21,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-11-20 07:31:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:21,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2021-11-20 07:31:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:21,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-11-20 07:31:21,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:21,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2021-11-20 07:31:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:21,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2021-11-20 07:31:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:21,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2021-11-20 07:31:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:21,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2021-11-20 07:31:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:21,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2021-11-20 07:31:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:21,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-11-20 07:31:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:21,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2021-11-20 07:31:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:21,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2021-11-20 07:31:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:21,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2021-11-20 07:31:21,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:21,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2021-11-20 07:31:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:21,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2021-11-20 07:31:21,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:21,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 378 [2021-11-20 07:31:21,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:21,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 139 proven. 132 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2021-11-20 07:31:21,710 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:31:21,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356329599] [2021-11-20 07:31:21,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356329599] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 07:31:21,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785772235] [2021-11-20 07:31:21,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:31:21,711 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:31:21,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:31:21,716 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 07:31:21,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-11-20 07:31:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:31:21,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 1381 conjuncts, 62 conjunts are in the unsatisfiable core [2021-11-20 07:31:21,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:31:23,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 607 proven. 221 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2021-11-20 07:31:23,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:31:25,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 157 proven. 155 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2021-11-20 07:31:25,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785772235] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 07:31:25,523 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 07:31:25,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 25, 20] total 48 [2021-11-20 07:31:25,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837388175] [2021-11-20 07:31:25,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 07:31:25,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-11-20 07:31:25,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:31:25,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-11-20 07:31:25,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=2048, Unknown=0, NotChecked=0, Total=2256 [2021-11-20 07:31:25,527 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-11-20 07:31:30,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:31:30,960 INFO L93 Difference]: Finished difference Result 7953 states and 9578 transitions. [2021-11-20 07:31:30,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-11-20 07:31:30,960 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-11-20 07:31:30,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:31:30,966 INFO L225 Difference]: With dead ends: 7953 [2021-11-20 07:31:30,966 INFO L226 Difference]: Without dead ends: 4519 [2021-11-20 07:31:30,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 911 GetRequests, 826 SyntacticMatches, 3 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1635 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=801, Invalid=6171, Unknown=0, NotChecked=0, Total=6972 [2021-11-20 07:31:30,970 INFO L933 BasicCegarLoop]: 330 mSDtfsCounter, 779 mSDsluCounter, 6312 mSDsCounter, 0 mSdLazyCounter, 4416 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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.7s IncrementalHoareTripleChecker+Time [2021-11-20 07:31:30,970 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.7s Time] [2021-11-20 07:31:30,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4519 states. [2021-11-20 07:31:31,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4519 to 3862. [2021-11-20 07:31:31,854 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-11-20 07:31:31,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3862 states to 3862 states and 4559 transitions. [2021-11-20 07:31:31,861 INFO L78 Accepts]: Start accepts. Automaton has 3862 states and 4559 transitions. Word has length 394 [2021-11-20 07:31:31,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:31:31,861 INFO L470 AbstractCegarLoop]: Abstraction has 3862 states and 4559 transitions. [2021-11-20 07:31:31,861 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-11-20 07:31:31,861 INFO L276 IsEmpty]: Start isEmpty. Operand 3862 states and 4559 transitions. [2021-11-20 07:31:31,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2021-11-20 07:31:31,867 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:31:31,868 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-11-20 07:31:31,903 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2021-11-20 07:31:32,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 07:31:32,088 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:31:32,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:31:32,088 INFO L85 PathProgramCache]: Analyzing trace with hash -340747451, now seen corresponding path program 1 times [2021-11-20 07:31:32,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:31:32,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672775237] [2021-11-20 07:31:32,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:31:32,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:31:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 07:31:32,138 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 07:31:32,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 07:31:32,358 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 07:31:32,359 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-20 07:31:32,360 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-20 07:31:32,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-11-20 07:31:32,365 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-11-20 07:31:32,369 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-20 07:31:32,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:31:32 BoogieIcfgContainer [2021-11-20 07:31:32,695 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-20 07:31:32,696 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-20 07:31:32,696 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-20 07:31:32,696 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-20 07:31:32,697 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:26:42" (3/4) ... [2021-11-20 07:31:32,699 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-20 07:31:33,038 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/witness.graphml [2021-11-20 07:31:33,039 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-20 07:31:33,040 INFO L158 Benchmark]: Toolchain (without parser) took 292204.61ms. Allocated memory was 81.8MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 43.3MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2021-11-20 07:31:33,040 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 81.8MB. Free memory is still 60.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 07:31:33,040 INFO L158 Benchmark]: CACSL2BoogieTranslator took 476.85ms. Allocated memory was 81.8MB in the beginning and 107.0MB in the end (delta: 25.2MB). Free memory was 43.1MB in the beginning and 77.6MB in the end (delta: -34.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-20 07:31:33,048 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.06ms. Allocated memory is still 107.0MB. Free memory was 77.6MB in the beginning and 75.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 07:31:33,049 INFO L158 Benchmark]: Boogie Preprocessor took 84.77ms. Allocated memory is still 107.0MB. Free memory was 75.0MB in the beginning and 72.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 07:31:33,049 INFO L158 Benchmark]: RCFGBuilder took 788.02ms. Allocated memory is still 107.0MB. Free memory was 72.9MB in the beginning and 47.8MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2021-11-20 07:31:33,050 INFO L158 Benchmark]: TraceAbstraction took 290447.60ms. Allocated memory was 107.0MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 47.1MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2021-11-20 07:31:33,050 INFO L158 Benchmark]: Witness Printer took 342.85ms. Allocated memory is still 2.7GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 67.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2021-11-20 07:31:33,051 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.31ms. Allocated memory is still 81.8MB. Free memory is still 60.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 476.85ms. Allocated memory was 81.8MB in the beginning and 107.0MB in the end (delta: 25.2MB). Free memory was 43.1MB in the beginning and 77.6MB in the end (delta: -34.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.06ms. Allocated memory is still 107.0MB. Free memory was 77.6MB in the beginning and 75.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.77ms. Allocated memory is still 107.0MB. Free memory was 75.0MB in the beginning and 72.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 788.02ms. Allocated memory is still 107.0MB. Free memory was 72.9MB in the beginning and 47.8MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 290447.60ms. Allocated memory was 107.0MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 47.1MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 342.85ms. Allocated memory is still 2.7GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 67.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 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: 290.0s, OverallIterations: 57, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.3s, AutomataDifference: 212.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39437 SdHoareTripleChecker+Valid, 93.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38819 mSDsluCounter, 227969 SdHoareTripleChecker+Invalid, 78.4s 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, 1.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17529 GetRequests, 14688 SyntacticMatches, 10 SemanticMatches, 2831 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431432 ImplicationChecksByTransitivity, 78.2s 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: 18.6s AutomataMinimizationTime, 56 MinimizatonAttempts, 162517 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.1s SsaConstructionTime, 4.0s SatisfiabilityAnalysisTime, 33.2s 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-11-20 07:31:33,102 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1eab60f-b379-443c-87fe-d81fa00f3032/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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