/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/product-lines/elevator_spec1_product25.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 18:19:13,700 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 18:19:13,703 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 18:19:13,737 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 18:19:13,737 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 18:19:13,739 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 18:19:13,740 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 18:19:13,754 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 18:19:13,758 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 18:19:13,766 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 18:19:13,767 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 18:19:13,772 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 18:19:13,772 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 18:19:13,773 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 18:19:13,777 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 18:19:13,778 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 18:19:13,779 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 18:19:13,780 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 18:19:13,784 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 18:19:13,790 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 18:19:13,796 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 18:19:13,798 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 18:19:13,799 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 18:19:13,801 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 18:19:13,807 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 18:19:13,807 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 18:19:13,807 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 18:19:13,813 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 18:19:13,814 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 18:19:13,815 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 18:19:13,815 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 18:19:13,819 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 18:19:13,820 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 18:19:13,821 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 18:19:13,823 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 18:19:13,824 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 18:19:13,824 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 18:19:13,825 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 18:19:13,826 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 18:19:13,827 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 18:19:13,827 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 18:19:13,829 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 18:19:13,875 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 18:19:13,875 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 18:19:13,878 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 18:19:13,878 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 18:19:13,879 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 18:19:13,879 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 18:19:13,879 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 18:19:13,879 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 18:19:13,879 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 18:19:13,880 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 18:19:13,880 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 18:19:13,880 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 18:19:13,880 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 18:19:13,880 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 18:19:13,881 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 18:19:13,885 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 18:19:13,885 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 18:19:13,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 18:19:13,885 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 18:19:13,886 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 18:19:13,886 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 18:19:13,886 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 18:19:13,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 18:19:13,886 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 18:19:13,886 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 18:19:13,887 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 18:19:14,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 18:19:14,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 18:19:14,301 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 18:19:14,302 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 18:19:14,303 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 18:19:14,304 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec1_product25.cil.c [2021-01-06 18:19:14,391 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/564003673/7edd0305e4624e918be1e2c001ed74a2/FLAGad267cd5a [2021-01-06 18:19:15,173 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 18:19:15,173 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec1_product25.cil.c [2021-01-06 18:19:15,199 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/564003673/7edd0305e4624e918be1e2c001ed74a2/FLAGad267cd5a [2021-01-06 18:19:15,406 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/564003673/7edd0305e4624e918be1e2c001ed74a2 [2021-01-06 18:19:15,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 18:19:15,411 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 18:19:15,413 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 18:19:15,413 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 18:19:15,418 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 18:19:15,419 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 06:19:15" (1/1) ... [2021-01-06 18:19:15,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@702e5f64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:19:15, skipping insertion in model container [2021-01-06 18:19:15,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 06:19:15" (1/1) ... [2021-01-06 18:19:15,428 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 18:19:15,496 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~excep~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~cf~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_15~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_15~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_16~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_16~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_17~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_18~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_17~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_19~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_19~0,] left hand side expression in assignment: lhs: VariableLHS[~excep~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_15~1,] left hand side expression in assignment: lhs: VariableLHS[~cf~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~1,] left hand side expression in assignment: lhs: VariableLHS[~mem_16~1,] left hand side expression in assignment: lhs: VariableLHS[~cf~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~1,] left hand side expression in assignment: lhs: VariableLHS[~mem_17~1,] left hand side expression in assignment: address: IdentifierExpression[~mem_17~1,] left hand side expression in assignment: lhs: VariableLHS[~excep~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~1,] left hand side expression in assignment: lhs: VariableLHS[~mem_16~2,] left hand side expression in assignment: lhs: VariableLHS[~cf~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~2,] left hand side expression in assignment: lhs: VariableLHS[~mem_17~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~2,] left hand side expression in assignment: lhs: VariableLHS[~mem_18~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp15~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_19~1,] left hand side expression in assignment: lhs: VariableLHS[~cf~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~new~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_18~2,] left hand side expression in assignment: address: IdentifierExpression[~mem_18~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_19~2,] left hand side expression in assignment: address: IdentifierExpression[~mem_19~2,] left hand side expression in assignment: lhs: VariableLHS[~head~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_20~0,] left hand side expression in assignment: lhs: VariableLHS[~next~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_21~0,] left hand side expression in assignment: lhs: VariableLHS[~excep~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~3,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~count,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp15~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp16~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_22~0,] left hand side expression in assignment: lhs: VariableLHS[~head~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mem_23~0,] left hand side expression in assignment: lhs: VariableLHS[~excep~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp17~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~mem_24~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~2,] left hand side expression in assignment: lhs: VariableLHS[~mem_12~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_13~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_12~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~4,] left hand side expression in assignment: lhs: VariableLHS[~mem_13~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] [2021-01-06 18:19:15,777 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec1_product25.cil.c[13083,13096] left hand side expression in assignment: lhs: VariableLHS[~nd~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~maxLength~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~counter~0,] left hand side expression in assignment: lhs: VariableLHS[~counter~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~action~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: lhs: VariableLHS[~origin~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~floor~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~calls_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__utac__ad__arg1~0,] left hand side expression in assignment: lhs: VariableLHS[~calls_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~9,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~10,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~10,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~10,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~10,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~10,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~10,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~10,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~12,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~12,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~12,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~12,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~12,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~12,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~12,] left hand side expression in assignment: lhs: VariableLHS[~currentFloorID~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentFloorID~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~persons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~weight~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~weight~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~17,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentFloorID~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentFloorID~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~2,] left hand side expression in assignment: lhs: VariableLHS[~doorState~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~24,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~3,] left hand side expression in assignment: lhs: VariableLHS[~doorState~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp15~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp16~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp17~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp18~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp19~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp20~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~25,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp21~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~10,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp22~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~8,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp24~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp25~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp26~0,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] [2021-01-06 18:19:16,158 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 18:19:16,179 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~excep~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~cf~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_15~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_15~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_16~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_16~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_17~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_18~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_17~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_19~0,] left hand side expression in assignment: address: IdentifierExpression[~mem_19~0,] left hand side expression in assignment: lhs: VariableLHS[~excep~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_15~1,] left hand side expression in assignment: lhs: VariableLHS[~cf~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~1,] left hand side expression in assignment: lhs: VariableLHS[~mem_16~1,] left hand side expression in assignment: lhs: VariableLHS[~cf~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~1,] left hand side expression in assignment: lhs: VariableLHS[~mem_17~1,] left hand side expression in assignment: address: IdentifierExpression[~mem_17~1,] left hand side expression in assignment: lhs: VariableLHS[~excep~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~1,] left hand side expression in assignment: lhs: VariableLHS[~mem_16~2,] left hand side expression in assignment: lhs: VariableLHS[~cf~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~2,] left hand side expression in assignment: lhs: VariableLHS[~mem_17~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~2,] left hand side expression in assignment: lhs: VariableLHS[~mem_18~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp15~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_19~1,] left hand side expression in assignment: lhs: VariableLHS[~cf~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~new~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_18~2,] left hand side expression in assignment: address: IdentifierExpression[~mem_18~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_19~2,] left hand side expression in assignment: address: IdentifierExpression[~mem_19~2,] left hand side expression in assignment: lhs: VariableLHS[~head~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_20~0,] left hand side expression in assignment: lhs: VariableLHS[~next~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_21~0,] left hand side expression in assignment: lhs: VariableLHS[~excep~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~3,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: VariableLHS[~count,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp15~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp16~0,] left hand side expression in assignment: lhs: VariableLHS[~mem_22~0,] left hand side expression in assignment: lhs: VariableLHS[~head~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mem_23~0,] left hand side expression in assignment: lhs: VariableLHS[~excep~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp17~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~mem_24~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~2,] left hand side expression in assignment: lhs: VariableLHS[~mem_12~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_13~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp5~3,] left hand side expression in assignment: lhs: VariableLHS[~mem_12~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~4,] left hand side expression in assignment: lhs: VariableLHS[~mem_13~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] [2021-01-06 18:19:16,239 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec1_product25.cil.c[13083,13096] left hand side expression in assignment: lhs: VariableLHS[~nd~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~maxLength~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~counter~0,] left hand side expression in assignment: lhs: VariableLHS[~counter~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~action~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: lhs: VariableLHS[~origin~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~floor~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~calls_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__utac__ad__arg1~0,] left hand side expression in assignment: lhs: VariableLHS[~calls_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~9,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~10,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~10,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~10,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~10,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~10,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~10,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~10,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~11,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~12,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~12,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~12,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~12,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~12,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~12,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~12,] left hand side expression in assignment: lhs: VariableLHS[~currentFloorID~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentFloorID~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~persons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~weight~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~weight~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~17,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentFloorID~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentFloorID~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~2,] left hand side expression in assignment: lhs: VariableLHS[~doorState~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~24,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~3,] left hand side expression in assignment: lhs: VariableLHS[~doorState~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp9~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp10~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp11~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp12~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp13~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp14~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp15~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp16~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp17~1,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp18~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp19~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp20~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~25,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp21~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~10,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp22~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~8,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp24~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp25~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp26~0,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] [2021-01-06 18:19:16,322 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 18:19:16,381 INFO L208 MainTranslator]: Completed translation [2021-01-06 18:19:16,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:19:16 WrapperNode [2021-01-06 18:19:16,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 18:19:16,383 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 18:19:16,383 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 18:19:16,384 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 18:19:16,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:19:16" (1/1) ... [2021-01-06 18:19:16,422 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:19:16" (1/1) ... [2021-01-06 18:19:16,638 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 18:19:16,641 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 18:19:16,641 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 18:19:16,641 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 18:19:16,652 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:19:16" (1/1) ... [2021-01-06 18:19:16,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:19:16" (1/1) ... [2021-01-06 18:19:16,688 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:19:16" (1/1) ... [2021-01-06 18:19:16,688 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:19:16" (1/1) ... [2021-01-06 18:19:16,783 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:19:16" (1/1) ... [2021-01-06 18:19:16,846 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:19:16" (1/1) ... [2021-01-06 18:19:16,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:19:16" (1/1) ... [2021-01-06 18:19:16,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 18:19:16,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 18:19:16,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 18:19:16,912 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 18:19:16,913 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:19:16" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 18:19:17,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 18:19:17,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 18:19:17,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 18:19:17,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 18:19:22,653 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 18:19:22,653 INFO L299 CfgBuilder]: Removed 589 assume(true) statements. [2021-01-06 18:19:22,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 06:19:22 BoogieIcfgContainer [2021-01-06 18:19:22,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 18:19:22,660 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 18:19:22,660 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 18:19:22,663 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 18:19:22,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 06:19:15" (1/3) ... [2021-01-06 18:19:22,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a257ea0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 06:19:22, skipping insertion in model container [2021-01-06 18:19:22,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:19:16" (2/3) ... [2021-01-06 18:19:22,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a257ea0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 06:19:22, skipping insertion in model container [2021-01-06 18:19:22,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 06:19:22" (3/3) ... [2021-01-06 18:19:22,667 INFO L111 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product25.cil.c [2021-01-06 18:19:22,673 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 18:19:22,687 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2021-01-06 18:19:22,705 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-01-06 18:19:22,756 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 18:19:22,756 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 18:19:22,756 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 18:19:22,756 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 18:19:22,756 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 18:19:22,756 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 18:19:22,757 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 18:19:22,757 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 18:19:22,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2511 states. [2021-01-06 18:19:22,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-01-06 18:19:22,827 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:22,828 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:19:22,828 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:19:22,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:22,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1148200267, now seen corresponding path program 1 times [2021-01-06 18:19:22,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:22,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332183303] [2021-01-06 18:19:22,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:23,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:19:23,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332183303] [2021-01-06 18:19:23,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:23,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:19:23,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234264312] [2021-01-06 18:19:23,256 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 18:19:23,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:23,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 18:19:23,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:19:23,273 INFO L87 Difference]: Start difference. First operand 2511 states. Second operand 3 states. [2021-01-06 18:19:23,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:23,636 INFO L93 Difference]: Finished difference Result 7453 states and 14051 transitions. [2021-01-06 18:19:23,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 18:19:23,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2021-01-06 18:19:23,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:23,702 INFO L225 Difference]: With dead ends: 7453 [2021-01-06 18:19:23,702 INFO L226 Difference]: Without dead ends: 4947 [2021-01-06 18:19:23,717 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:19:23,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4947 states. [2021-01-06 18:19:23,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4947 to 2507. [2021-01-06 18:19:23,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2507 states. [2021-01-06 18:19:23,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 4714 transitions. [2021-01-06 18:19:23,909 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 4714 transitions. Word has length 47 [2021-01-06 18:19:23,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:23,910 INFO L481 AbstractCegarLoop]: Abstraction has 2507 states and 4714 transitions. [2021-01-06 18:19:23,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 18:19:23,910 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 4714 transitions. [2021-01-06 18:19:23,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-06 18:19:23,914 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:23,914 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:19:23,915 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 18:19:23,915 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:19:23,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:23,916 INFO L82 PathProgramCache]: Analyzing trace with hash 293547687, now seen corresponding path program 1 times [2021-01-06 18:19:23,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:23,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850912891] [2021-01-06 18:19:23,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:24,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:19:24,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850912891] [2021-01-06 18:19:24,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:24,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 18:19:24,063 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879553372] [2021-01-06 18:19:24,064 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 18:19:24,064 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:24,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 18:19:24,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:19:24,066 INFO L87 Difference]: Start difference. First operand 2507 states and 4714 transitions. Second operand 6 states. [2021-01-06 18:19:24,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:24,797 INFO L93 Difference]: Finished difference Result 9803 states and 18453 transitions. [2021-01-06 18:19:24,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 18:19:24,798 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2021-01-06 18:19:24,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:24,842 INFO L225 Difference]: With dead ends: 9803 [2021-01-06 18:19:24,843 INFO L226 Difference]: Without dead ends: 7339 [2021-01-06 18:19:24,854 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-01-06 18:19:24,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7339 states. [2021-01-06 18:19:24,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7339 to 2503. [2021-01-06 18:19:24,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2503 states. [2021-01-06 18:19:25,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2503 states to 2503 states and 4703 transitions. [2021-01-06 18:19:25,009 INFO L78 Accepts]: Start accepts. Automaton has 2503 states and 4703 transitions. Word has length 54 [2021-01-06 18:19:25,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:25,010 INFO L481 AbstractCegarLoop]: Abstraction has 2503 states and 4703 transitions. [2021-01-06 18:19:25,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 18:19:25,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2503 states and 4703 transitions. [2021-01-06 18:19:25,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-01-06 18:19:25,016 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:25,017 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:19:25,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 18:19:25,017 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:19:25,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:25,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1945578502, now seen corresponding path program 1 times [2021-01-06 18:19:25,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:25,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139637854] [2021-01-06 18:19:25,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:25,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:19:25,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139637854] [2021-01-06 18:19:25,275 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:25,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:19:25,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234557257] [2021-01-06 18:19:25,276 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:19:25,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:25,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:19:25,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:19:25,279 INFO L87 Difference]: Start difference. First operand 2503 states and 4703 transitions. Second operand 4 states. [2021-01-06 18:19:25,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:25,777 INFO L93 Difference]: Finished difference Result 7397 states and 13918 transitions. [2021-01-06 18:19:25,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:19:25,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2021-01-06 18:19:25,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:25,806 INFO L225 Difference]: With dead ends: 7397 [2021-01-06 18:19:25,806 INFO L226 Difference]: Without dead ends: 4937 [2021-01-06 18:19:25,812 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-01-06 18:19:25,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4937 states. [2021-01-06 18:19:25,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4937 to 2503. [2021-01-06 18:19:25,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2503 states. [2021-01-06 18:19:25,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2503 states to 2503 states and 4694 transitions. [2021-01-06 18:19:25,949 INFO L78 Accepts]: Start accepts. Automaton has 2503 states and 4694 transitions. Word has length 56 [2021-01-06 18:19:25,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:25,956 INFO L481 AbstractCegarLoop]: Abstraction has 2503 states and 4694 transitions. [2021-01-06 18:19:25,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:19:25,957 INFO L276 IsEmpty]: Start isEmpty. Operand 2503 states and 4694 transitions. [2021-01-06 18:19:25,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-01-06 18:19:25,961 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:25,962 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:19:25,962 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 18:19:25,962 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:19:25,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:25,963 INFO L82 PathProgramCache]: Analyzing trace with hash 895503117, now seen corresponding path program 1 times [2021-01-06 18:19:25,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:25,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317115633] [2021-01-06 18:19:25,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:26,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:19:26,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317115633] [2021-01-06 18:19:26,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:26,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:19:26,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767961863] [2021-01-06 18:19:26,097 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:19:26,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:26,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:19:26,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:19:26,099 INFO L87 Difference]: Start difference. First operand 2503 states and 4694 transitions. Second operand 4 states. [2021-01-06 18:19:26,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:26,621 INFO L93 Difference]: Finished difference Result 7397 states and 13900 transitions. [2021-01-06 18:19:26,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:19:26,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2021-01-06 18:19:26,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:26,677 INFO L225 Difference]: With dead ends: 7397 [2021-01-06 18:19:26,677 INFO L226 Difference]: Without dead ends: 4937 [2021-01-06 18:19:26,682 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-01-06 18:19:26,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4937 states. [2021-01-06 18:19:26,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4937 to 2503. [2021-01-06 18:19:26,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2503 states. [2021-01-06 18:19:26,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2503 states to 2503 states and 4685 transitions. [2021-01-06 18:19:26,818 INFO L78 Accepts]: Start accepts. Automaton has 2503 states and 4685 transitions. Word has length 58 [2021-01-06 18:19:26,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:26,820 INFO L481 AbstractCegarLoop]: Abstraction has 2503 states and 4685 transitions. [2021-01-06 18:19:26,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:19:26,821 INFO L276 IsEmpty]: Start isEmpty. Operand 2503 states and 4685 transitions. [2021-01-06 18:19:26,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-01-06 18:19:26,824 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:26,825 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:19:26,825 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 18:19:26,825 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:19:26,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:26,826 INFO L82 PathProgramCache]: Analyzing trace with hash 83385338, now seen corresponding path program 1 times [2021-01-06 18:19:26,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:26,827 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290852767] [2021-01-06 18:19:26,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:26,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:19:26,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290852767] [2021-01-06 18:19:26,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:26,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:19:26,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656968389] [2021-01-06 18:19:26,930 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:19:26,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:26,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:19:26,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:19:26,932 INFO L87 Difference]: Start difference. First operand 2503 states and 4685 transitions. Second operand 4 states. [2021-01-06 18:19:27,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:27,614 INFO L93 Difference]: Finished difference Result 12205 states and 22932 transitions. [2021-01-06 18:19:27,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:19:27,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2021-01-06 18:19:27,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:27,645 INFO L225 Difference]: With dead ends: 12205 [2021-01-06 18:19:27,645 INFO L226 Difference]: Without dead ends: 9745 [2021-01-06 18:19:27,653 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-01-06 18:19:27,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9745 states. [2021-01-06 18:19:27,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9745 to 2503. [2021-01-06 18:19:27,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2503 states. [2021-01-06 18:19:27,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2503 states to 2503 states and 4681 transitions. [2021-01-06 18:19:27,905 INFO L78 Accepts]: Start accepts. Automaton has 2503 states and 4681 transitions. Word has length 60 [2021-01-06 18:19:27,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:27,905 INFO L481 AbstractCegarLoop]: Abstraction has 2503 states and 4681 transitions. [2021-01-06 18:19:27,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:19:27,905 INFO L276 IsEmpty]: Start isEmpty. Operand 2503 states and 4681 transitions. [2021-01-06 18:19:27,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-01-06 18:19:27,908 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:27,908 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:19:27,909 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 18:19:27,909 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:19:27,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:27,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1957588858, now seen corresponding path program 1 times [2021-01-06 18:19:27,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:27,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126675301] [2021-01-06 18:19:27,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:27,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:19:27,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126675301] [2021-01-06 18:19:27,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:27,997 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:19:27,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799750800] [2021-01-06 18:19:27,997 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:19:27,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:27,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:19:27,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:19:27,998 INFO L87 Difference]: Start difference. First operand 2503 states and 4681 transitions. Second operand 4 states. [2021-01-06 18:19:28,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:28,382 INFO L93 Difference]: Finished difference Result 9780 states and 18367 transitions. [2021-01-06 18:19:28,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:19:28,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2021-01-06 18:19:28,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:28,403 INFO L225 Difference]: With dead ends: 9780 [2021-01-06 18:19:28,404 INFO L226 Difference]: Without dead ends: 7299 [2021-01-06 18:19:28,412 INFO L677 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-01-06 18:19:28,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7299 states. [2021-01-06 18:19:28,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7299 to 2485. [2021-01-06 18:19:28,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2485 states. [2021-01-06 18:19:28,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2485 states to 2485 states and 4650 transitions. [2021-01-06 18:19:28,572 INFO L78 Accepts]: Start accepts. Automaton has 2485 states and 4650 transitions. Word has length 60 [2021-01-06 18:19:28,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:28,573 INFO L481 AbstractCegarLoop]: Abstraction has 2485 states and 4650 transitions. [2021-01-06 18:19:28,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:19:28,573 INFO L276 IsEmpty]: Start isEmpty. Operand 2485 states and 4650 transitions. [2021-01-06 18:19:28,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-01-06 18:19:28,575 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:28,576 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:19:28,576 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 18:19:28,576 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:19:28,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:28,581 INFO L82 PathProgramCache]: Analyzing trace with hash 988149685, now seen corresponding path program 1 times [2021-01-06 18:19:28,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:28,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833542753] [2021-01-06 18:19:28,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:28,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:19:28,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833542753] [2021-01-06 18:19:28,716 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:28,716 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:19:28,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158598656] [2021-01-06 18:19:28,718 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:19:28,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:28,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:19:28,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:19:28,719 INFO L87 Difference]: Start difference. First operand 2485 states and 4650 transitions. Second operand 4 states. [2021-01-06 18:19:29,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:29,137 INFO L93 Difference]: Finished difference Result 7361 states and 13813 transitions. [2021-01-06 18:19:29,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:19:29,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2021-01-06 18:19:29,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:29,151 INFO L225 Difference]: With dead ends: 7361 [2021-01-06 18:19:29,151 INFO L226 Difference]: Without dead ends: 4898 [2021-01-06 18:19:29,158 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-01-06 18:19:29,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4898 states. [2021-01-06 18:19:29,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4898 to 2485. [2021-01-06 18:19:29,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2485 states. [2021-01-06 18:19:29,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2485 states to 2485 states and 4644 transitions. [2021-01-06 18:19:29,333 INFO L78 Accepts]: Start accepts. Automaton has 2485 states and 4644 transitions. Word has length 61 [2021-01-06 18:19:29,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:29,333 INFO L481 AbstractCegarLoop]: Abstraction has 2485 states and 4644 transitions. [2021-01-06 18:19:29,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:19:29,334 INFO L276 IsEmpty]: Start isEmpty. Operand 2485 states and 4644 transitions. [2021-01-06 18:19:29,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-01-06 18:19:29,336 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:29,336 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:19:29,337 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 18:19:29,337 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:19:29,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:29,337 INFO L82 PathProgramCache]: Analyzing trace with hash -408560395, now seen corresponding path program 1 times [2021-01-06 18:19:29,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:29,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155103749] [2021-01-06 18:19:29,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:29,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:19:29,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155103749] [2021-01-06 18:19:29,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:29,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:19:29,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080202171] [2021-01-06 18:19:29,416 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:19:29,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:29,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:19:29,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:19:29,417 INFO L87 Difference]: Start difference. First operand 2485 states and 4644 transitions. Second operand 4 states. [2021-01-06 18:19:29,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:29,822 INFO L93 Difference]: Finished difference Result 7361 states and 13801 transitions. [2021-01-06 18:19:29,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:19:29,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2021-01-06 18:19:29,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:29,840 INFO L225 Difference]: With dead ends: 7361 [2021-01-06 18:19:29,840 INFO L226 Difference]: Without dead ends: 4898 [2021-01-06 18:19:29,847 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-01-06 18:19:29,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4898 states. [2021-01-06 18:19:29,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4898 to 2485. [2021-01-06 18:19:29,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2485 states. [2021-01-06 18:19:29,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2485 states to 2485 states and 4638 transitions. [2021-01-06 18:19:29,981 INFO L78 Accepts]: Start accepts. Automaton has 2485 states and 4638 transitions. Word has length 62 [2021-01-06 18:19:29,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:29,982 INFO L481 AbstractCegarLoop]: Abstraction has 2485 states and 4638 transitions. [2021-01-06 18:19:29,982 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:19:29,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2485 states and 4638 transitions. [2021-01-06 18:19:29,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-06 18:19:29,984 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:29,985 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:19:29,985 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 18:19:29,985 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:19:29,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:29,986 INFO L82 PathProgramCache]: Analyzing trace with hash -136533680, now seen corresponding path program 1 times [2021-01-06 18:19:29,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:29,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158380531] [2021-01-06 18:19:29,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:30,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:30,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:19:30,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158380531] [2021-01-06 18:19:30,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:30,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 18:19:30,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556839180] [2021-01-06 18:19:30,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 18:19:30,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:30,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 18:19:30,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 18:19:30,083 INFO L87 Difference]: Start difference. First operand 2485 states and 4638 transitions. Second operand 7 states. [2021-01-06 18:19:30,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:30,870 INFO L93 Difference]: Finished difference Result 12176 states and 22846 transitions. [2021-01-06 18:19:30,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 18:19:30,871 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2021-01-06 18:19:30,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:30,898 INFO L225 Difference]: With dead ends: 12176 [2021-01-06 18:19:30,898 INFO L226 Difference]: Without dead ends: 9719 [2021-01-06 18:19:30,906 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-01-06 18:19:30,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9719 states. [2021-01-06 18:19:31,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9719 to 2487. [2021-01-06 18:19:31,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2487 states. [2021-01-06 18:19:31,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2487 states to 2487 states and 4639 transitions. [2021-01-06 18:19:31,069 INFO L78 Accepts]: Start accepts. Automaton has 2487 states and 4639 transitions. Word has length 63 [2021-01-06 18:19:31,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:31,069 INFO L481 AbstractCegarLoop]: Abstraction has 2487 states and 4639 transitions. [2021-01-06 18:19:31,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 18:19:31,070 INFO L276 IsEmpty]: Start isEmpty. Operand 2487 states and 4639 transitions. [2021-01-06 18:19:31,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-06 18:19:31,078 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:31,078 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:19:31,078 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 18:19:31,079 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:19:31,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:31,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1390808651, now seen corresponding path program 1 times [2021-01-06 18:19:31,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:31,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478732349] [2021-01-06 18:19:31,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:31,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:19:31,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478732349] [2021-01-06 18:19:31,183 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:31,183 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 18:19:31,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204608657] [2021-01-06 18:19:31,184 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 18:19:31,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:31,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 18:19:31,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 18:19:31,185 INFO L87 Difference]: Start difference. First operand 2487 states and 4639 transitions. Second operand 7 states. [2021-01-06 18:19:31,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:31,854 INFO L93 Difference]: Finished difference Result 12168 states and 22825 transitions. [2021-01-06 18:19:31,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 18:19:31,855 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2021-01-06 18:19:31,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:31,890 INFO L225 Difference]: With dead ends: 12168 [2021-01-06 18:19:31,890 INFO L226 Difference]: Without dead ends: 9714 [2021-01-06 18:19:31,896 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-01-06 18:19:31,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9714 states. [2021-01-06 18:19:32,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9714 to 2492. [2021-01-06 18:19:32,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2492 states. [2021-01-06 18:19:32,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2492 states to 2492 states and 4647 transitions. [2021-01-06 18:19:32,063 INFO L78 Accepts]: Start accepts. Automaton has 2492 states and 4647 transitions. Word has length 65 [2021-01-06 18:19:32,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:32,064 INFO L481 AbstractCegarLoop]: Abstraction has 2492 states and 4647 transitions. [2021-01-06 18:19:32,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 18:19:32,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2492 states and 4647 transitions. [2021-01-06 18:19:32,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-01-06 18:19:32,067 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:32,067 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:19:32,067 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 18:19:32,067 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:19:32,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:32,069 INFO L82 PathProgramCache]: Analyzing trace with hash -366859568, now seen corresponding path program 1 times [2021-01-06 18:19:32,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:32,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360502054] [2021-01-06 18:19:32,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:32,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:32,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:19:32,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360502054] [2021-01-06 18:19:32,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:32,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:19:32,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262029798] [2021-01-06 18:19:32,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 18:19:32,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:32,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 18:19:32,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:19:32,144 INFO L87 Difference]: Start difference. First operand 2492 states and 4647 transitions. Second operand 3 states. [2021-01-06 18:19:32,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:32,272 INFO L93 Difference]: Finished difference Result 4926 states and 9212 transitions. [2021-01-06 18:19:32,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 18:19:32,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2021-01-06 18:19:32,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:32,278 INFO L225 Difference]: With dead ends: 4926 [2021-01-06 18:19:32,279 INFO L226 Difference]: Without dead ends: 2471 [2021-01-06 18:19:32,282 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:19:32,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2021-01-06 18:19:32,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 2471. [2021-01-06 18:19:32,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2471 states. [2021-01-06 18:19:32,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2471 states to 2471 states and 4611 transitions. [2021-01-06 18:19:32,397 INFO L78 Accepts]: Start accepts. Automaton has 2471 states and 4611 transitions. Word has length 67 [2021-01-06 18:19:32,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:32,398 INFO L481 AbstractCegarLoop]: Abstraction has 2471 states and 4611 transitions. [2021-01-06 18:19:32,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 18:19:32,398 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 4611 transitions. [2021-01-06 18:19:32,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-06 18:19:32,401 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:32,401 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:19:32,405 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 18:19:32,405 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:19:32,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:32,405 INFO L82 PathProgramCache]: Analyzing trace with hash -795842891, now seen corresponding path program 1 times [2021-01-06 18:19:32,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:32,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981648155] [2021-01-06 18:19:32,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:32,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:32,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:19:32,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981648155] [2021-01-06 18:19:32,491 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:32,491 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:19:32,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261069119] [2021-01-06 18:19:32,491 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:19:32,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:32,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:19:32,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:19:32,492 INFO L87 Difference]: Start difference. First operand 2471 states and 4611 transitions. Second operand 5 states. [2021-01-06 18:19:32,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:32,673 INFO L93 Difference]: Finished difference Result 4875 states and 9134 transitions. [2021-01-06 18:19:32,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:19:32,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2021-01-06 18:19:32,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:32,679 INFO L225 Difference]: With dead ends: 4875 [2021-01-06 18:19:32,679 INFO L226 Difference]: Without dead ends: 2465 [2021-01-06 18:19:32,682 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 18:19:32,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2465 states. [2021-01-06 18:19:32,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2465 to 2465. [2021-01-06 18:19:32,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2465 states. [2021-01-06 18:19:32,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2465 states and 4602 transitions. [2021-01-06 18:19:32,843 INFO L78 Accepts]: Start accepts. Automaton has 2465 states and 4602 transitions. Word has length 69 [2021-01-06 18:19:32,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:32,843 INFO L481 AbstractCegarLoop]: Abstraction has 2465 states and 4602 transitions. [2021-01-06 18:19:32,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:19:32,844 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 4602 transitions. [2021-01-06 18:19:32,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-06 18:19:32,846 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:32,846 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:19:32,846 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 18:19:32,847 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:19:32,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:32,847 INFO L82 PathProgramCache]: Analyzing trace with hash 495870773, now seen corresponding path program 1 times [2021-01-06 18:19:32,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:32,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688196800] [2021-01-06 18:19:32,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:32,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:32,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:19:32,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688196800] [2021-01-06 18:19:32,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:32,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:19:32,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208350193] [2021-01-06 18:19:32,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:19:32,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:32,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:19:32,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:19:32,918 INFO L87 Difference]: Start difference. First operand 2465 states and 4602 transitions. Second operand 4 states. [2021-01-06 18:19:33,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:33,056 INFO L93 Difference]: Finished difference Result 4869 states and 9125 transitions. [2021-01-06 18:19:33,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 18:19:33,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2021-01-06 18:19:33,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:33,067 INFO L225 Difference]: With dead ends: 4869 [2021-01-06 18:19:33,067 INFO L226 Difference]: Without dead ends: 2451 [2021-01-06 18:19:33,072 INFO L677 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-01-06 18:19:33,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2451 states. [2021-01-06 18:19:33,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2451 to 2451. [2021-01-06 18:19:33,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2451 states. [2021-01-06 18:19:33,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2451 states to 2451 states and 4581 transitions. [2021-01-06 18:19:33,193 INFO L78 Accepts]: Start accepts. Automaton has 2451 states and 4581 transitions. Word has length 69 [2021-01-06 18:19:33,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:33,193 INFO L481 AbstractCegarLoop]: Abstraction has 2451 states and 4581 transitions. [2021-01-06 18:19:33,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:19:33,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2451 states and 4581 transitions. [2021-01-06 18:19:33,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-06 18:19:33,196 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:33,196 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:19:33,196 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 18:19:33,196 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:19:33,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:33,197 INFO L82 PathProgramCache]: Analyzing trace with hash -528043870, now seen corresponding path program 1 times [2021-01-06 18:19:33,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:33,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490372335] [2021-01-06 18:19:33,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:33,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:33,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:19:33,270 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490372335] [2021-01-06 18:19:33,270 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:33,270 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 18:19:33,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895515116] [2021-01-06 18:19:33,271 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 18:19:33,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:33,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 18:19:33,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:19:33,272 INFO L87 Difference]: Start difference. First operand 2451 states and 4581 transitions. Second operand 6 states. [2021-01-06 18:19:33,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:33,523 INFO L93 Difference]: Finished difference Result 4869 states and 9120 transitions. [2021-01-06 18:19:33,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 18:19:33,524 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2021-01-06 18:19:33,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:33,528 INFO L225 Difference]: With dead ends: 4869 [2021-01-06 18:19:33,528 INFO L226 Difference]: Without dead ends: 2471 [2021-01-06 18:19:33,532 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-01-06 18:19:33,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2021-01-06 18:19:33,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 2451. [2021-01-06 18:19:33,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2451 states. [2021-01-06 18:19:33,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2451 states to 2451 states and 4580 transitions. [2021-01-06 18:19:33,645 INFO L78 Accepts]: Start accepts. Automaton has 2451 states and 4580 transitions. Word has length 70 [2021-01-06 18:19:33,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:33,646 INFO L481 AbstractCegarLoop]: Abstraction has 2451 states and 4580 transitions. [2021-01-06 18:19:33,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 18:19:33,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2451 states and 4580 transitions. [2021-01-06 18:19:33,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-01-06 18:19:33,648 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:33,649 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:19:33,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 18:19:33,649 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:19:33,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:33,650 INFO L82 PathProgramCache]: Analyzing trace with hash 667654126, now seen corresponding path program 1 times [2021-01-06 18:19:33,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:33,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685455029] [2021-01-06 18:19:33,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:33,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:19:33,723 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685455029] [2021-01-06 18:19:33,723 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:33,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 18:19:33,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811555809] [2021-01-06 18:19:33,724 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 18:19:33,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:33,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 18:19:33,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:19:33,725 INFO L87 Difference]: Start difference. First operand 2451 states and 4580 transitions. Second operand 6 states. [2021-01-06 18:19:34,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:34,000 INFO L93 Difference]: Finished difference Result 4859 states and 9101 transitions. [2021-01-06 18:19:34,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 18:19:34,001 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2021-01-06 18:19:34,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:34,003 INFO L225 Difference]: With dead ends: 4859 [2021-01-06 18:19:34,003 INFO L226 Difference]: Without dead ends: 2466 [2021-01-06 18:19:34,010 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-01-06 18:19:34,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2466 states. [2021-01-06 18:19:34,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2466 to 2451. [2021-01-06 18:19:34,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2451 states. [2021-01-06 18:19:34,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2451 states to 2451 states and 4579 transitions. [2021-01-06 18:19:34,166 INFO L78 Accepts]: Start accepts. Automaton has 2451 states and 4579 transitions. Word has length 71 [2021-01-06 18:19:34,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:34,166 INFO L481 AbstractCegarLoop]: Abstraction has 2451 states and 4579 transitions. [2021-01-06 18:19:34,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 18:19:34,167 INFO L276 IsEmpty]: Start isEmpty. Operand 2451 states and 4579 transitions. [2021-01-06 18:19:34,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 18:19:34,169 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:34,170 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:19:34,170 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 18:19:34,170 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:19:34,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:34,171 INFO L82 PathProgramCache]: Analyzing trace with hash 784818637, now seen corresponding path program 1 times [2021-01-06 18:19:34,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:34,171 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482589951] [2021-01-06 18:19:34,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:34,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:19:34,282 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482589951] [2021-01-06 18:19:34,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:34,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:19:34,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750377901] [2021-01-06 18:19:34,286 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:19:34,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:34,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:19:34,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:19:34,288 INFO L87 Difference]: Start difference. First operand 2451 states and 4579 transitions. Second operand 5 states. [2021-01-06 18:19:36,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:36,087 INFO L93 Difference]: Finished difference Result 9761 states and 18263 transitions. [2021-01-06 18:19:36,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 18:19:36,088 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2021-01-06 18:19:36,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:36,102 INFO L225 Difference]: With dead ends: 9761 [2021-01-06 18:19:36,102 INFO L226 Difference]: Without dead ends: 7383 [2021-01-06 18:19:36,109 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-01-06 18:19:36,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7383 states. [2021-01-06 18:19:36,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7383 to 2455. [2021-01-06 18:19:36,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2455 states. [2021-01-06 18:19:36,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2455 states to 2455 states and 4583 transitions. [2021-01-06 18:19:36,333 INFO L78 Accepts]: Start accepts. Automaton has 2455 states and 4583 transitions. Word has length 72 [2021-01-06 18:19:36,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:36,333 INFO L481 AbstractCegarLoop]: Abstraction has 2455 states and 4583 transitions. [2021-01-06 18:19:36,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:19:36,333 INFO L276 IsEmpty]: Start isEmpty. Operand 2455 states and 4583 transitions. [2021-01-06 18:19:36,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 18:19:36,335 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:36,336 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:19:36,336 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 18:19:36,336 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:19:36,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:36,336 INFO L82 PathProgramCache]: Analyzing trace with hash -631604357, now seen corresponding path program 1 times [2021-01-06 18:19:36,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:36,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510269984] [2021-01-06 18:19:36,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:36,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:19:36,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510269984] [2021-01-06 18:19:36,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:36,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:19:36,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944310014] [2021-01-06 18:19:36,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:19:36,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:36,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:19:36,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:19:36,444 INFO L87 Difference]: Start difference. First operand 2455 states and 4583 transitions. Second operand 4 states. [2021-01-06 18:19:38,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:38,430 INFO L93 Difference]: Finished difference Result 6239 states and 11684 transitions. [2021-01-06 18:19:38,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 18:19:38,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2021-01-06 18:19:38,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:38,435 INFO L225 Difference]: With dead ends: 6239 [2021-01-06 18:19:38,436 INFO L226 Difference]: Without dead ends: 3850 [2021-01-06 18:19:38,440 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:19:38,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3850 states. [2021-01-06 18:19:38,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3850 to 3420. [2021-01-06 18:19:38,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3420 states. [2021-01-06 18:19:38,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3420 states to 3420 states and 6393 transitions. [2021-01-06 18:19:38,648 INFO L78 Accepts]: Start accepts. Automaton has 3420 states and 6393 transitions. Word has length 73 [2021-01-06 18:19:38,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:38,648 INFO L481 AbstractCegarLoop]: Abstraction has 3420 states and 6393 transitions. [2021-01-06 18:19:38,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:19:38,649 INFO L276 IsEmpty]: Start isEmpty. Operand 3420 states and 6393 transitions. [2021-01-06 18:19:38,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 18:19:38,651 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:38,651 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:19:38,651 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 18:19:38,651 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:19:38,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:38,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1435945176, now seen corresponding path program 1 times [2021-01-06 18:19:38,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:38,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416465445] [2021-01-06 18:19:38,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:38,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:19:38,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416465445] [2021-01-06 18:19:38,781 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:38,781 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:19:38,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565316581] [2021-01-06 18:19:38,786 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:19:38,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:38,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:19:38,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:19:38,787 INFO L87 Difference]: Start difference. First operand 3420 states and 6393 transitions. Second operand 4 states. [2021-01-06 18:19:40,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:40,883 INFO L93 Difference]: Finished difference Result 7204 states and 13493 transitions. [2021-01-06 18:19:40,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 18:19:40,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2021-01-06 18:19:40,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:40,888 INFO L225 Difference]: With dead ends: 7204 [2021-01-06 18:19:40,888 INFO L226 Difference]: Without dead ends: 3850 [2021-01-06 18:19:40,892 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:19:40,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3850 states. [2021-01-06 18:19:41,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3850 to 3420. [2021-01-06 18:19:41,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3420 states. [2021-01-06 18:19:41,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3420 states to 3420 states and 6391 transitions. [2021-01-06 18:19:41,085 INFO L78 Accepts]: Start accepts. Automaton has 3420 states and 6391 transitions. Word has length 74 [2021-01-06 18:19:41,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:41,085 INFO L481 AbstractCegarLoop]: Abstraction has 3420 states and 6391 transitions. [2021-01-06 18:19:41,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:19:41,086 INFO L276 IsEmpty]: Start isEmpty. Operand 3420 states and 6391 transitions. [2021-01-06 18:19:41,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 18:19:41,088 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:41,088 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:19:41,088 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 18:19:41,088 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:19:41,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:41,089 INFO L82 PathProgramCache]: Analyzing trace with hash -445607754, now seen corresponding path program 1 times [2021-01-06 18:19:41,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:41,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283486013] [2021-01-06 18:19:41,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:41,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:41,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:19:41,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283486013] [2021-01-06 18:19:41,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:41,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:19:41,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250749720] [2021-01-06 18:19:41,177 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:19:41,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:41,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:19:41,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:19:41,178 INFO L87 Difference]: Start difference. First operand 3420 states and 6391 transitions. Second operand 4 states. [2021-01-06 18:19:43,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:43,312 INFO L93 Difference]: Finished difference Result 7204 states and 13490 transitions. [2021-01-06 18:19:43,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 18:19:43,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2021-01-06 18:19:43,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:43,317 INFO L225 Difference]: With dead ends: 7204 [2021-01-06 18:19:43,317 INFO L226 Difference]: Without dead ends: 3850 [2021-01-06 18:19:43,321 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:19:43,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3850 states. [2021-01-06 18:19:43,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3850 to 3420. [2021-01-06 18:19:43,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3420 states. [2021-01-06 18:19:43,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3420 states to 3420 states and 6389 transitions. [2021-01-06 18:19:43,526 INFO L78 Accepts]: Start accepts. Automaton has 3420 states and 6389 transitions. Word has length 75 [2021-01-06 18:19:43,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:43,526 INFO L481 AbstractCegarLoop]: Abstraction has 3420 states and 6389 transitions. [2021-01-06 18:19:43,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:19:43,526 INFO L276 IsEmpty]: Start isEmpty. Operand 3420 states and 6389 transitions. [2021-01-06 18:19:43,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 18:19:43,529 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:43,529 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:19:43,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 18:19:43,530 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:19:43,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:43,530 INFO L82 PathProgramCache]: Analyzing trace with hash -2067897629, now seen corresponding path program 1 times [2021-01-06 18:19:43,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:43,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623208785] [2021-01-06 18:19:43,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:43,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:19:43,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623208785] [2021-01-06 18:19:43,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:43,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:19:43,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224469025] [2021-01-06 18:19:43,617 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:19:43,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:43,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:19:43,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:19:43,618 INFO L87 Difference]: Start difference. First operand 3420 states and 6389 transitions. Second operand 5 states. [2021-01-06 18:19:45,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:45,213 INFO L93 Difference]: Finished difference Result 25683 states and 48265 transitions. [2021-01-06 18:19:45,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 18:19:45,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2021-01-06 18:19:45,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:45,236 INFO L225 Difference]: With dead ends: 25683 [2021-01-06 18:19:45,236 INFO L226 Difference]: Without dead ends: 22338 [2021-01-06 18:19:45,242 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-06 18:19:45,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22338 states. [2021-01-06 18:19:45,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22338 to 6113. [2021-01-06 18:19:45,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6113 states. [2021-01-06 18:19:45,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6113 states to 6113 states and 11452 transitions. [2021-01-06 18:19:45,656 INFO L78 Accepts]: Start accepts. Automaton has 6113 states and 11452 transitions. Word has length 75 [2021-01-06 18:19:45,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:45,656 INFO L481 AbstractCegarLoop]: Abstraction has 6113 states and 11452 transitions. [2021-01-06 18:19:45,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:19:45,656 INFO L276 IsEmpty]: Start isEmpty. Operand 6113 states and 11452 transitions. [2021-01-06 18:19:45,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 18:19:45,658 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:45,658 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:19:45,658 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 18:19:45,658 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:19:45,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:45,659 INFO L82 PathProgramCache]: Analyzing trace with hash 2093056161, now seen corresponding path program 1 times [2021-01-06 18:19:45,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:45,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204129320] [2021-01-06 18:19:45,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:45,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:45,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:19:45,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204129320] [2021-01-06 18:19:45,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:45,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:19:45,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105276389] [2021-01-06 18:19:45,716 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:19:45,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:45,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:19:45,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:19:45,716 INFO L87 Difference]: Start difference. First operand 6113 states and 11452 transitions. Second operand 4 states. [2021-01-06 18:19:46,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:46,298 INFO L93 Difference]: Finished difference Result 10787 states and 20115 transitions. [2021-01-06 18:19:46,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:19:46,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2021-01-06 18:19:46,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:46,308 INFO L225 Difference]: With dead ends: 10787 [2021-01-06 18:19:46,308 INFO L226 Difference]: Without dead ends: 8342 [2021-01-06 18:19:46,312 INFO L677 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-01-06 18:19:46,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8342 states. [2021-01-06 18:19:46,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8342 to 6119. [2021-01-06 18:19:46,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6119 states. [2021-01-06 18:19:46,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6119 states to 6119 states and 11458 transitions. [2021-01-06 18:19:46,643 INFO L78 Accepts]: Start accepts. Automaton has 6119 states and 11458 transitions. Word has length 75 [2021-01-06 18:19:46,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:46,644 INFO L481 AbstractCegarLoop]: Abstraction has 6119 states and 11458 transitions. [2021-01-06 18:19:46,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:19:46,644 INFO L276 IsEmpty]: Start isEmpty. Operand 6119 states and 11458 transitions. [2021-01-06 18:19:46,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-01-06 18:19:46,646 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:46,646 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:19:46,646 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 18:19:46,646 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:19:46,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:46,647 INFO L82 PathProgramCache]: Analyzing trace with hash -33420482, now seen corresponding path program 1 times [2021-01-06 18:19:46,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:46,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24738539] [2021-01-06 18:19:46,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:46,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:19:46,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24738539] [2021-01-06 18:19:46,705 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:46,705 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 18:19:46,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705632826] [2021-01-06 18:19:46,706 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 18:19:46,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:46,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 18:19:46,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:19:46,707 INFO L87 Difference]: Start difference. First operand 6119 states and 11458 transitions. Second operand 3 states. [2021-01-06 18:19:47,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:47,547 INFO L93 Difference]: Finished difference Result 8976 states and 16785 transitions. [2021-01-06 18:19:47,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 18:19:47,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2021-01-06 18:19:47,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:47,559 INFO L225 Difference]: With dead ends: 8976 [2021-01-06 18:19:47,559 INFO L226 Difference]: Without dead ends: 6264 [2021-01-06 18:19:47,565 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:19:47,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6264 states. [2021-01-06 18:19:48,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6264 to 6231. [2021-01-06 18:19:48,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6231 states. [2021-01-06 18:19:48,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6231 states to 6231 states and 11589 transitions. [2021-01-06 18:19:48,027 INFO L78 Accepts]: Start accepts. Automaton has 6231 states and 11589 transitions. Word has length 80 [2021-01-06 18:19:48,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:48,027 INFO L481 AbstractCegarLoop]: Abstraction has 6231 states and 11589 transitions. [2021-01-06 18:19:48,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 18:19:48,027 INFO L276 IsEmpty]: Start isEmpty. Operand 6231 states and 11589 transitions. [2021-01-06 18:19:48,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-01-06 18:19:48,029 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:48,030 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:19:48,030 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 18:19:48,030 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:19:48,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:48,030 INFO L82 PathProgramCache]: Analyzing trace with hash -822267008, now seen corresponding path program 1 times [2021-01-06 18:19:48,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:48,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885686206] [2021-01-06 18:19:48,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:48,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:48,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:19:48,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885686206] [2021-01-06 18:19:48,125 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:48,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:19:48,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383379820] [2021-01-06 18:19:48,130 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:19:48,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:48,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:19:48,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:19:48,131 INFO L87 Difference]: Start difference. First operand 6231 states and 11589 transitions. Second operand 4 states. [2021-01-06 18:19:49,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:49,081 INFO L93 Difference]: Finished difference Result 13610 states and 25329 transitions. [2021-01-06 18:19:49,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 18:19:49,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2021-01-06 18:19:49,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:49,094 INFO L225 Difference]: With dead ends: 13610 [2021-01-06 18:19:49,095 INFO L226 Difference]: Without dead ends: 10965 [2021-01-06 18:19:49,100 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:19:49,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10965 states. [2021-01-06 18:19:49,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10965 to 8767. [2021-01-06 18:19:49,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8767 states. [2021-01-06 18:19:49,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8767 states to 8767 states and 16322 transitions. [2021-01-06 18:19:49,556 INFO L78 Accepts]: Start accepts. Automaton has 8767 states and 16322 transitions. Word has length 81 [2021-01-06 18:19:49,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:49,556 INFO L481 AbstractCegarLoop]: Abstraction has 8767 states and 16322 transitions. [2021-01-06 18:19:49,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:19:49,556 INFO L276 IsEmpty]: Start isEmpty. Operand 8767 states and 16322 transitions. [2021-01-06 18:19:49,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-01-06 18:19:49,558 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:49,558 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:19:49,559 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 18:19:49,559 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:19:49,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:49,559 INFO L82 PathProgramCache]: Analyzing trace with hash -399565182, now seen corresponding path program 1 times [2021-01-06 18:19:49,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:49,560 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368429978] [2021-01-06 18:19:49,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:49,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:19:49,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368429978] [2021-01-06 18:19:49,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:49,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:19:49,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635272083] [2021-01-06 18:19:49,621 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 18:19:49,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:49,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 18:19:49,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:19:49,622 INFO L87 Difference]: Start difference. First operand 8767 states and 16322 transitions. Second operand 3 states. [2021-01-06 18:19:50,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:50,023 INFO L93 Difference]: Finished difference Result 15860 states and 29552 transitions. [2021-01-06 18:19:50,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 18:19:50,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2021-01-06 18:19:50,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:50,034 INFO L225 Difference]: With dead ends: 15860 [2021-01-06 18:19:50,034 INFO L226 Difference]: Without dead ends: 8745 [2021-01-06 18:19:50,042 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:19:50,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8745 states. [2021-01-06 18:19:50,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8745 to 8745. [2021-01-06 18:19:50,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8745 states. [2021-01-06 18:19:50,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8745 states to 8745 states and 16280 transitions. [2021-01-06 18:19:50,496 INFO L78 Accepts]: Start accepts. Automaton has 8745 states and 16280 transitions. Word has length 81 [2021-01-06 18:19:50,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:50,496 INFO L481 AbstractCegarLoop]: Abstraction has 8745 states and 16280 transitions. [2021-01-06 18:19:50,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 18:19:50,496 INFO L276 IsEmpty]: Start isEmpty. Operand 8745 states and 16280 transitions. [2021-01-06 18:19:50,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-01-06 18:19:50,498 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:50,498 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:19:50,498 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 18:19:50,499 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:19:50,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:50,499 INFO L82 PathProgramCache]: Analyzing trace with hash -619915260, now seen corresponding path program 1 times [2021-01-06 18:19:50,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:50,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003288315] [2021-01-06 18:19:50,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:50,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:19:50,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003288315] [2021-01-06 18:19:50,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:50,567 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:19:50,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220865948] [2021-01-06 18:19:50,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:19:50,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:50,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:19:50,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:19:50,568 INFO L87 Difference]: Start difference. First operand 8745 states and 16280 transitions. Second operand 5 states. [2021-01-06 18:19:52,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:52,416 INFO L93 Difference]: Finished difference Result 35930 states and 66670 transitions. [2021-01-06 18:19:52,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 18:19:52,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2021-01-06 18:19:52,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:52,454 INFO L225 Difference]: With dead ends: 35930 [2021-01-06 18:19:52,454 INFO L226 Difference]: Without dead ends: 30875 [2021-01-06 18:19:52,468 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-06 18:19:52,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30875 states. [2021-01-06 18:19:53,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30875 to 10674. [2021-01-06 18:19:53,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10674 states. [2021-01-06 18:19:53,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10674 states to 10674 states and 19707 transitions. [2021-01-06 18:19:53,208 INFO L78 Accepts]: Start accepts. Automaton has 10674 states and 19707 transitions. Word has length 83 [2021-01-06 18:19:53,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:53,209 INFO L481 AbstractCegarLoop]: Abstraction has 10674 states and 19707 transitions. [2021-01-06 18:19:53,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:19:53,209 INFO L276 IsEmpty]: Start isEmpty. Operand 10674 states and 19707 transitions. [2021-01-06 18:19:53,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-01-06 18:19:53,211 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:53,211 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:19:53,211 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 18:19:53,211 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:19:53,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:53,212 INFO L82 PathProgramCache]: Analyzing trace with hash -935222910, now seen corresponding path program 1 times [2021-01-06 18:19:53,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:53,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199147724] [2021-01-06 18:19:53,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:53,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:19:53,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199147724] [2021-01-06 18:19:53,302 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:53,302 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:19:53,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329390480] [2021-01-06 18:19:53,303 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:19:53,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:53,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:19:53,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:19:53,304 INFO L87 Difference]: Start difference. First operand 10674 states and 19707 transitions. Second operand 5 states. [2021-01-06 18:19:54,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:54,418 INFO L93 Difference]: Finished difference Result 17564 states and 32452 transitions. [2021-01-06 18:19:54,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:19:54,418 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2021-01-06 18:19:54,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:54,439 INFO L225 Difference]: With dead ends: 17564 [2021-01-06 18:19:54,439 INFO L226 Difference]: Without dead ends: 17551 [2021-01-06 18:19:54,443 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:19:54,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17551 states. [2021-01-06 18:19:55,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17551 to 10692. [2021-01-06 18:19:55,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10692 states. [2021-01-06 18:19:55,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10692 states to 10692 states and 19725 transitions. [2021-01-06 18:19:55,142 INFO L78 Accepts]: Start accepts. Automaton has 10692 states and 19725 transitions. Word has length 83 [2021-01-06 18:19:55,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:55,142 INFO L481 AbstractCegarLoop]: Abstraction has 10692 states and 19725 transitions. [2021-01-06 18:19:55,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:19:55,142 INFO L276 IsEmpty]: Start isEmpty. Operand 10692 states and 19725 transitions. [2021-01-06 18:19:55,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 18:19:55,144 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:55,144 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:19:55,144 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 18:19:55,144 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:19:55,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:55,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1660473767, now seen corresponding path program 1 times [2021-01-06 18:19:55,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:55,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668060161] [2021-01-06 18:19:55,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:55,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:19:55,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668060161] [2021-01-06 18:19:55,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:55,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 18:19:55,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161790865] [2021-01-06 18:19:55,220 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 18:19:55,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:55,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 18:19:55,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:19:55,221 INFO L87 Difference]: Start difference. First operand 10692 states and 19725 transitions. Second operand 6 states. [2021-01-06 18:19:55,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:55,802 INFO L93 Difference]: Finished difference Result 10711 states and 19743 transitions. [2021-01-06 18:19:55,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 18:19:55,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2021-01-06 18:19:55,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:55,815 INFO L225 Difference]: With dead ends: 10711 [2021-01-06 18:19:55,815 INFO L226 Difference]: Without dead ends: 10698 [2021-01-06 18:19:55,819 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-06 18:19:55,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10698 states. [2021-01-06 18:19:56,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10698 to 10692. [2021-01-06 18:19:56,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10692 states. [2021-01-06 18:19:56,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10692 states to 10692 states and 19715 transitions. [2021-01-06 18:19:56,682 INFO L78 Accepts]: Start accepts. Automaton has 10692 states and 19715 transitions. Word has length 85 [2021-01-06 18:19:56,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:56,682 INFO L481 AbstractCegarLoop]: Abstraction has 10692 states and 19715 transitions. [2021-01-06 18:19:56,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 18:19:56,683 INFO L276 IsEmpty]: Start isEmpty. Operand 10692 states and 19715 transitions. [2021-01-06 18:19:56,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-06 18:19:56,685 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:56,686 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:19:56,686 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 18:19:56,686 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:19:56,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:56,686 INFO L82 PathProgramCache]: Analyzing trace with hash -999376643, now seen corresponding path program 1 times [2021-01-06 18:19:56,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:56,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686629584] [2021-01-06 18:19:56,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:56,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:19:56,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686629584] [2021-01-06 18:19:56,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:56,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:19:56,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975021536] [2021-01-06 18:19:56,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:19:56,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:56,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:19:56,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:19:56,779 INFO L87 Difference]: Start difference. First operand 10692 states and 19715 transitions. Second operand 5 states. [2021-01-06 18:19:59,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:59,744 INFO L93 Difference]: Finished difference Result 44641 states and 82197 transitions. [2021-01-06 18:19:59,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 18:19:59,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2021-01-06 18:19:59,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:59,784 INFO L225 Difference]: With dead ends: 44641 [2021-01-06 18:19:59,784 INFO L226 Difference]: Without dead ends: 35866 [2021-01-06 18:19:59,793 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-01-06 18:19:59,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35866 states. [2021-01-06 18:20:00,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35866 to 10712. [2021-01-06 18:20:00,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10712 states. [2021-01-06 18:20:00,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10712 states to 10712 states and 19735 transitions. [2021-01-06 18:20:00,552 INFO L78 Accepts]: Start accepts. Automaton has 10712 states and 19735 transitions. Word has length 92 [2021-01-06 18:20:00,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:20:00,552 INFO L481 AbstractCegarLoop]: Abstraction has 10712 states and 19735 transitions. [2021-01-06 18:20:00,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:20:00,552 INFO L276 IsEmpty]: Start isEmpty. Operand 10712 states and 19735 transitions. [2021-01-06 18:20:00,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-01-06 18:20:00,555 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:20:00,555 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:20:00,556 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 18:20:00,556 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:20:00,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:20:00,556 INFO L82 PathProgramCache]: Analyzing trace with hash -91863215, now seen corresponding path program 1 times [2021-01-06 18:20:00,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:20:00,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360991936] [2021-01-06 18:20:00,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:20:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:20:00,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:20:00,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360991936] [2021-01-06 18:20:00,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:20:00,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:20:00,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49035384] [2021-01-06 18:20:00,617 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 18:20:00,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:20:00,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 18:20:00,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:20:00,618 INFO L87 Difference]: Start difference. First operand 10712 states and 19735 transitions. Second operand 3 states. [2021-01-06 18:20:02,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:20:02,490 INFO L93 Difference]: Finished difference Result 28496 states and 52424 transitions. [2021-01-06 18:20:02,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 18:20:02,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2021-01-06 18:20:02,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:20:02,514 INFO L225 Difference]: With dead ends: 28496 [2021-01-06 18:20:02,514 INFO L226 Difference]: Without dead ends: 19701 [2021-01-06 18:20:02,525 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:20:02,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19701 states. [2021-01-06 18:20:03,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19701 to 10524. [2021-01-06 18:20:03,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10524 states. [2021-01-06 18:20:03,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10524 states to 10524 states and 19327 transitions. [2021-01-06 18:20:03,477 INFO L78 Accepts]: Start accepts. Automaton has 10524 states and 19327 transitions. Word has length 93 [2021-01-06 18:20:03,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:20:03,478 INFO L481 AbstractCegarLoop]: Abstraction has 10524 states and 19327 transitions. [2021-01-06 18:20:03,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 18:20:03,478 INFO L276 IsEmpty]: Start isEmpty. Operand 10524 states and 19327 transitions. [2021-01-06 18:20:03,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 18:20:03,480 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:20:03,480 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:20:03,481 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 18:20:03,481 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:20:03,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:20:03,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1147808795, now seen corresponding path program 1 times [2021-01-06 18:20:03,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:20:03,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583178991] [2021-01-06 18:20:03,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:20:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:20:03,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:20:03,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583178991] [2021-01-06 18:20:03,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:20:03,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:20:03,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618411655] [2021-01-06 18:20:03,548 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:20:03,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:20:03,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:20:03,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:20:03,549 INFO L87 Difference]: Start difference. First operand 10524 states and 19327 transitions. Second operand 5 states. [2021-01-06 18:20:05,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:20:05,279 INFO L93 Difference]: Finished difference Result 28191 states and 51834 transitions. [2021-01-06 18:20:05,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:20:05,279 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2021-01-06 18:20:05,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:20:05,308 INFO L225 Difference]: With dead ends: 28191 [2021-01-06 18:20:05,308 INFO L226 Difference]: Without dead ends: 19242 [2021-01-06 18:20:05,316 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 18:20:05,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19242 states. [2021-01-06 18:20:05,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19242 to 10524. [2021-01-06 18:20:05,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10524 states. [2021-01-06 18:20:05,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10524 states to 10524 states and 19115 transitions. [2021-01-06 18:20:05,996 INFO L78 Accepts]: Start accepts. Automaton has 10524 states and 19115 transitions. Word has length 96 [2021-01-06 18:20:05,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:20:05,996 INFO L481 AbstractCegarLoop]: Abstraction has 10524 states and 19115 transitions. [2021-01-06 18:20:05,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:20:05,996 INFO L276 IsEmpty]: Start isEmpty. Operand 10524 states and 19115 transitions. [2021-01-06 18:20:06,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-01-06 18:20:06,000 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:20:06,000 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 18:20:06,000 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 18:20:06,000 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:20:06,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:20:06,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1920394802, now seen corresponding path program 1 times [2021-01-06 18:20:06,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:20:06,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679893920] [2021-01-06 18:20:06,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:20:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:20:06,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:20:06,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679893920] [2021-01-06 18:20:06,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:20:06,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 18:20:06,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760100552] [2021-01-06 18:20:06,136 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 18:20:06,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:20:06,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 18:20:06,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 18:20:06,137 INFO L87 Difference]: Start difference. First operand 10524 states and 19115 transitions. Second operand 7 states. [2021-01-06 18:20:07,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:20:07,368 INFO L93 Difference]: Finished difference Result 16766 states and 30518 transitions. [2021-01-06 18:20:07,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 18:20:07,369 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2021-01-06 18:20:07,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:20:07,388 INFO L225 Difference]: With dead ends: 16766 [2021-01-06 18:20:07,389 INFO L226 Difference]: Without dead ends: 16753 [2021-01-06 18:20:07,393 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-01-06 18:20:07,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16753 states. [2021-01-06 18:20:08,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16753 to 10539. [2021-01-06 18:20:08,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10539 states. [2021-01-06 18:20:08,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10539 states to 10539 states and 19125 transitions. [2021-01-06 18:20:08,107 INFO L78 Accepts]: Start accepts. Automaton has 10539 states and 19125 transitions. Word has length 97 [2021-01-06 18:20:08,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:20:08,107 INFO L481 AbstractCegarLoop]: Abstraction has 10539 states and 19125 transitions. [2021-01-06 18:20:08,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 18:20:08,108 INFO L276 IsEmpty]: Start isEmpty. Operand 10539 states and 19125 transitions. [2021-01-06 18:20:08,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-01-06 18:20:08,112 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:20:08,112 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-06 18:20:08,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 18:20:08,112 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:20:08,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:20:08,113 INFO L82 PathProgramCache]: Analyzing trace with hash -65706862, now seen corresponding path program 1 times [2021-01-06 18:20:08,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:20:08,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669795263] [2021-01-06 18:20:08,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:20:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:20:08,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:20:08,202 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669795263] [2021-01-06 18:20:08,203 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:20:08,203 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:20:08,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708850404] [2021-01-06 18:20:08,203 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:20:08,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:20:08,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:20:08,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:20:08,204 INFO L87 Difference]: Start difference. First operand 10539 states and 19125 transitions. Second operand 5 states. [2021-01-06 18:20:11,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:20:11,964 INFO L93 Difference]: Finished difference Result 53946 states and 98751 transitions. [2021-01-06 18:20:11,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 18:20:11,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2021-01-06 18:20:11,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:20:12,023 INFO L225 Difference]: With dead ends: 53946 [2021-01-06 18:20:12,023 INFO L226 Difference]: Without dead ends: 45324 [2021-01-06 18:20:12,041 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-06 18:20:12,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45324 states. [2021-01-06 18:20:13,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45324 to 21042. [2021-01-06 18:20:13,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21042 states. [2021-01-06 18:20:13,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21042 states to 21042 states and 38206 transitions. [2021-01-06 18:20:13,702 INFO L78 Accepts]: Start accepts. Automaton has 21042 states and 38206 transitions. Word has length 113 [2021-01-06 18:20:13,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:20:13,703 INFO L481 AbstractCegarLoop]: Abstraction has 21042 states and 38206 transitions. [2021-01-06 18:20:13,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:20:13,703 INFO L276 IsEmpty]: Start isEmpty. Operand 21042 states and 38206 transitions. [2021-01-06 18:20:13,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-01-06 18:20:13,712 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:20:13,712 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-06 18:20:13,712 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 18:20:13,713 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:20:13,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:20:13,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1104343346, now seen corresponding path program 1 times [2021-01-06 18:20:13,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:20:13,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515016937] [2021-01-06 18:20:13,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:20:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:20:13,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:20:13,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515016937] [2021-01-06 18:20:13,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:20:13,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:20:13,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125742818] [2021-01-06 18:20:13,775 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 18:20:13,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:20:13,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 18:20:13,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:20:13,776 INFO L87 Difference]: Start difference. First operand 21042 states and 38206 transitions. Second operand 3 states. [2021-01-06 18:20:17,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:20:17,543 INFO L93 Difference]: Finished difference Result 49943 states and 90465 transitions. [2021-01-06 18:20:17,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 18:20:17,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2021-01-06 18:20:17,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:20:17,594 INFO L225 Difference]: With dead ends: 49943 [2021-01-06 18:20:17,594 INFO L226 Difference]: Without dead ends: 32006 [2021-01-06 18:20:17,609 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:20:17,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32006 states. [2021-01-06 18:20:19,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32006 to 20574. [2021-01-06 18:20:19,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20574 states. [2021-01-06 18:20:19,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20574 states to 20574 states and 37209 transitions. [2021-01-06 18:20:19,234 INFO L78 Accepts]: Start accepts. Automaton has 20574 states and 37209 transitions. Word has length 114 [2021-01-06 18:20:19,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:20:19,235 INFO L481 AbstractCegarLoop]: Abstraction has 20574 states and 37209 transitions. [2021-01-06 18:20:19,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 18:20:19,235 INFO L276 IsEmpty]: Start isEmpty. Operand 20574 states and 37209 transitions. [2021-01-06 18:20:19,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-01-06 18:20:19,244 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:20:19,244 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-06 18:20:19,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 18:20:19,244 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:20:19,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:20:19,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1444272932, now seen corresponding path program 1 times [2021-01-06 18:20:19,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:20:19,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132207176] [2021-01-06 18:20:19,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:20:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:20:19,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:20:19,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132207176] [2021-01-06 18:20:19,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:20:19,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:20:19,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226562230] [2021-01-06 18:20:19,335 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:20:19,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:20:19,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:20:19,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:20:19,336 INFO L87 Difference]: Start difference. First operand 20574 states and 37209 transitions. Second operand 5 states. [2021-01-06 18:20:21,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:20:21,024 INFO L93 Difference]: Finished difference Result 30244 states and 54789 transitions. [2021-01-06 18:20:21,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 18:20:21,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2021-01-06 18:20:21,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:20:21,052 INFO L225 Difference]: With dead ends: 30244 [2021-01-06 18:20:21,052 INFO L226 Difference]: Without dead ends: 19894 [2021-01-06 18:20:21,062 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-01-06 18:20:21,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19894 states. [2021-01-06 18:20:22,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19894 to 19894. [2021-01-06 18:20:22,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19894 states. [2021-01-06 18:20:22,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19894 states to 19894 states and 36070 transitions. [2021-01-06 18:20:22,619 INFO L78 Accepts]: Start accepts. Automaton has 19894 states and 36070 transitions. Word has length 114 [2021-01-06 18:20:22,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:20:22,620 INFO L481 AbstractCegarLoop]: Abstraction has 19894 states and 36070 transitions. [2021-01-06 18:20:22,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:20:22,620 INFO L276 IsEmpty]: Start isEmpty. Operand 19894 states and 36070 transitions. [2021-01-06 18:20:22,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-01-06 18:20:22,629 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:20:22,629 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-06 18:20:22,630 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 18:20:22,630 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:20:22,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:20:22,630 INFO L82 PathProgramCache]: Analyzing trace with hash -678744601, now seen corresponding path program 1 times [2021-01-06 18:20:22,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:20:22,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987182025] [2021-01-06 18:20:22,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:20:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:20:22,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:20:22,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987182025] [2021-01-06 18:20:22,735 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:20:22,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 18:20:22,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86888713] [2021-01-06 18:20:22,736 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 18:20:22,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:20:22,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 18:20:22,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:20:22,737 INFO L87 Difference]: Start difference. First operand 19894 states and 36070 transitions. Second operand 6 states. [2021-01-06 18:20:28,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:20:28,532 INFO L93 Difference]: Finished difference Result 59145 states and 107604 transitions. [2021-01-06 18:20:28,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 18:20:28,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2021-01-06 18:20:28,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:20:28,584 INFO L225 Difference]: With dead ends: 59145 [2021-01-06 18:20:28,585 INFO L226 Difference]: Without dead ends: 41960 [2021-01-06 18:20:28,598 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-01-06 18:20:28,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41960 states. [2021-01-06 18:20:30,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41960 to 27494. [2021-01-06 18:20:30,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27494 states. [2021-01-06 18:20:30,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27494 states to 27494 states and 49839 transitions. [2021-01-06 18:20:30,962 INFO L78 Accepts]: Start accepts. Automaton has 27494 states and 49839 transitions. Word has length 128 [2021-01-06 18:20:30,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:20:30,962 INFO L481 AbstractCegarLoop]: Abstraction has 27494 states and 49839 transitions. [2021-01-06 18:20:30,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 18:20:30,962 INFO L276 IsEmpty]: Start isEmpty. Operand 27494 states and 49839 transitions. [2021-01-06 18:20:30,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-01-06 18:20:30,971 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:20:30,972 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-06 18:20:30,972 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-06 18:20:30,972 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:20:30,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:20:30,972 INFO L82 PathProgramCache]: Analyzing trace with hash 209028645, now seen corresponding path program 1 times [2021-01-06 18:20:30,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:20:30,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129978516] [2021-01-06 18:20:30,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:20:30,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:20:31,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-06 18:20:31,042 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129978516] [2021-01-06 18:20:31,042 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:20:31,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 18:20:31,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297707884] [2021-01-06 18:20:31,043 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 18:20:31,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:20:31,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 18:20:31,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:20:31,044 INFO L87 Difference]: Start difference. First operand 27494 states and 49839 transitions. Second operand 3 states. [2021-01-06 18:20:32,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:20:32,889 INFO L93 Difference]: Finished difference Result 45368 states and 82443 transitions. [2021-01-06 18:20:32,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 18:20:32,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2021-01-06 18:20:32,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:20:32,917 INFO L225 Difference]: With dead ends: 45368 [2021-01-06 18:20:32,917 INFO L226 Difference]: Without dead ends: 24672 [2021-01-06 18:20:32,929 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:20:32,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24672 states. [2021-01-06 18:20:34,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24672 to 24659. [2021-01-06 18:20:34,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24659 states. [2021-01-06 18:20:34,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24659 states to 24659 states and 45155 transitions. [2021-01-06 18:20:34,629 INFO L78 Accepts]: Start accepts. Automaton has 24659 states and 45155 transitions. Word has length 128 [2021-01-06 18:20:34,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:20:34,630 INFO L481 AbstractCegarLoop]: Abstraction has 24659 states and 45155 transitions. [2021-01-06 18:20:34,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 18:20:34,630 INFO L276 IsEmpty]: Start isEmpty. Operand 24659 states and 45155 transitions. [2021-01-06 18:20:34,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-01-06 18:20:34,640 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:20:34,640 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-06 18:20:34,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-01-06 18:20:34,640 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:20:34,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:20:34,641 INFO L82 PathProgramCache]: Analyzing trace with hash 700939106, now seen corresponding path program 1 times [2021-01-06 18:20:34,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:20:34,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780221579] [2021-01-06 18:20:34,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:20:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:20:34,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-06 18:20:34,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780221579] [2021-01-06 18:20:34,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:20:34,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:20:34,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674805542] [2021-01-06 18:20:34,739 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:20:34,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:20:34,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:20:34,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:20:34,741 INFO L87 Difference]: Start difference. First operand 24659 states and 45155 transitions. Second operand 5 states. [2021-01-06 18:20:38,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:20:38,134 INFO L93 Difference]: Finished difference Result 67148 states and 122874 transitions. [2021-01-06 18:20:38,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:20:38,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2021-01-06 18:20:38,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:20:38,189 INFO L225 Difference]: With dead ends: 67148 [2021-01-06 18:20:38,189 INFO L226 Difference]: Without dead ends: 49243 [2021-01-06 18:20:38,202 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 18:20:38,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49243 states. [2021-01-06 18:20:41,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49243 to 49243. [2021-01-06 18:20:41,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49243 states. [2021-01-06 18:20:41,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49243 states to 49243 states and 90205 transitions. [2021-01-06 18:20:41,691 INFO L78 Accepts]: Start accepts. Automaton has 49243 states and 90205 transitions. Word has length 129 [2021-01-06 18:20:41,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:20:41,691 INFO L481 AbstractCegarLoop]: Abstraction has 49243 states and 90205 transitions. [2021-01-06 18:20:41,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:20:41,692 INFO L276 IsEmpty]: Start isEmpty. Operand 49243 states and 90205 transitions. [2021-01-06 18:20:41,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-01-06 18:20:41,707 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:20:41,707 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-06 18:20:41,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-01-06 18:20:41,707 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:20:41,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:20:41,708 INFO L82 PathProgramCache]: Analyzing trace with hash 970353384, now seen corresponding path program 1 times [2021-01-06 18:20:41,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:20:41,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615299844] [2021-01-06 18:20:41,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:20:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:20:41,804 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:20:41,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615299844] [2021-01-06 18:20:41,805 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:20:41,805 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 18:20:41,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152659856] [2021-01-06 18:20:41,805 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 18:20:41,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:20:41,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 18:20:41,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:20:41,806 INFO L87 Difference]: Start difference. First operand 49243 states and 90205 transitions. Second operand 6 states. [2021-01-06 18:20:50,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:20:50,262 INFO L93 Difference]: Finished difference Result 130665 states and 239177 transitions. [2021-01-06 18:20:50,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 18:20:50,263 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2021-01-06 18:20:50,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:20:50,375 INFO L225 Difference]: With dead ends: 130665 [2021-01-06 18:20:50,375 INFO L226 Difference]: Without dead ends: 86798 [2021-01-06 18:20:50,405 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-01-06 18:20:50,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86798 states. [2021-01-06 18:20:54,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86798 to 64391. [2021-01-06 18:20:54,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64391 states. [2021-01-06 18:20:55,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64391 states to 64391 states and 117889 transitions. [2021-01-06 18:20:55,074 INFO L78 Accepts]: Start accepts. Automaton has 64391 states and 117889 transitions. Word has length 129 [2021-01-06 18:20:55,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:20:55,074 INFO L481 AbstractCegarLoop]: Abstraction has 64391 states and 117889 transitions. [2021-01-06 18:20:55,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 18:20:55,075 INFO L276 IsEmpty]: Start isEmpty. Operand 64391 states and 117889 transitions. [2021-01-06 18:20:55,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-01-06 18:20:55,089 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:20:55,090 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-06 18:20:55,090 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-01-06 18:20:55,090 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:20:55,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:20:55,090 INFO L82 PathProgramCache]: Analyzing trace with hash 22971687, now seen corresponding path program 1 times [2021-01-06 18:20:55,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:20:55,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084085020] [2021-01-06 18:20:55,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:20:55,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:20:55,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-06 18:20:55,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084085020] [2021-01-06 18:20:55,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:20:55,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:20:55,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152567362] [2021-01-06 18:20:55,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:20:55,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:20:55,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:20:55,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:20:55,188 INFO L87 Difference]: Start difference. First operand 64391 states and 117889 transitions. Second operand 5 states. [2021-01-06 18:21:03,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:21:03,848 INFO L93 Difference]: Finished difference Result 179567 states and 328578 transitions. [2021-01-06 18:21:03,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:21:03,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2021-01-06 18:21:03,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:21:04,046 INFO L225 Difference]: With dead ends: 179567 [2021-01-06 18:21:04,046 INFO L226 Difference]: Without dead ends: 128652 [2021-01-06 18:21:04,090 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 18:21:04,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128652 states. [2021-01-06 18:21:13,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128652 to 128648. [2021-01-06 18:21:13,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128648 states. [2021-01-06 18:21:13,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128648 states to 128648 states and 235564 transitions. [2021-01-06 18:21:13,549 INFO L78 Accepts]: Start accepts. Automaton has 128648 states and 235564 transitions. Word has length 130 [2021-01-06 18:21:13,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:21:13,550 INFO L481 AbstractCegarLoop]: Abstraction has 128648 states and 235564 transitions. [2021-01-06 18:21:13,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:21:13,550 INFO L276 IsEmpty]: Start isEmpty. Operand 128648 states and 235564 transitions. [2021-01-06 18:21:13,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-01-06 18:21:13,591 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:21:13,591 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-06 18:21:13,591 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-01-06 18:21:13,591 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:21:13,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:21:13,592 INFO L82 PathProgramCache]: Analyzing trace with hash 249640898, now seen corresponding path program 1 times [2021-01-06 18:21:13,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:21:13,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193749079] [2021-01-06 18:21:13,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:21:13,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:21:13,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-06 18:21:13,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193749079] [2021-01-06 18:21:13,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:21:13,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:21:13,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595198863] [2021-01-06 18:21:13,954 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:21:13,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:21:13,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:21:13,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:21:13,954 INFO L87 Difference]: Start difference. First operand 128648 states and 235564 transitions. Second operand 5 states. [2021-01-06 18:21:32,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:21:32,131 INFO L93 Difference]: Finished difference Result 367378 states and 672268 transitions. [2021-01-06 18:21:32,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 18:21:32,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2021-01-06 18:21:32,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:21:32,644 INFO L225 Difference]: With dead ends: 367378 [2021-01-06 18:21:32,645 INFO L226 Difference]: Without dead ends: 265744 [2021-01-06 18:21:32,731 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-06 18:21:33,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265744 states. [2021-01-06 18:21:43,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265744 to 128648. [2021-01-06 18:21:43,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128648 states. [2021-01-06 18:21:43,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128648 states to 128648 states and 235544 transitions. [2021-01-06 18:21:43,396 INFO L78 Accepts]: Start accepts. Automaton has 128648 states and 235544 transitions. Word has length 130 [2021-01-06 18:21:43,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:21:43,396 INFO L481 AbstractCegarLoop]: Abstraction has 128648 states and 235544 transitions. [2021-01-06 18:21:43,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:21:43,397 INFO L276 IsEmpty]: Start isEmpty. Operand 128648 states and 235544 transitions. [2021-01-06 18:21:43,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-01-06 18:21:43,449 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:21:43,450 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-06 18:21:43,450 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-01-06 18:21:43,450 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:21:43,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:21:43,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1183720511, now seen corresponding path program 1 times [2021-01-06 18:21:43,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:21:43,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164513891] [2021-01-06 18:21:43,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:21:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:21:43,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 18:21:43,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164513891] [2021-01-06 18:21:43,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:21:43,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 18:21:43,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772884133] [2021-01-06 18:21:43,538 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 18:21:43,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:21:43,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 18:21:43,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:21:43,539 INFO L87 Difference]: Start difference. First operand 128648 states and 235544 transitions. Second operand 6 states. [2021-01-06 18:22:02,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:22:02,773 INFO L93 Difference]: Finished difference Result 361276 states and 661792 transitions. [2021-01-06 18:22:02,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 18:22:02,777 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2021-01-06 18:22:02,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:22:03,250 INFO L225 Difference]: With dead ends: 361276 [2021-01-06 18:22:03,250 INFO L226 Difference]: Without dead ends: 244122 [2021-01-06 18:22:03,344 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-01-06 18:22:03,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244122 states.