/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_product03.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 18:16:52,730 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 18:16:52,733 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 18:16:52,790 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 18:16:52,791 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 18:16:52,796 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 18:16:52,800 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 18:16:52,806 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 18:16:52,810 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 18:16:52,816 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 18:16:52,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 18:16:52,823 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 18:16:52,823 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 18:16:52,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 18:16:52,829 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 18:16:52,831 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 18:16:52,844 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 18:16:52,848 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 18:16:52,855 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 18:16:52,863 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 18:16:52,865 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 18:16:52,867 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 18:16:52,869 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 18:16:52,871 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 18:16:52,880 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 18:16:52,881 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 18:16:52,881 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 18:16:52,884 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 18:16:52,884 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 18:16:52,886 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 18:16:52,886 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 18:16:52,888 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 18:16:52,891 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 18:16:52,892 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 18:16:52,893 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 18:16:52,893 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 18:16:52,894 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 18:16:52,901 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 18:16:52,902 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 18:16:52,903 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 18:16:52,904 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 18:16:52,905 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:16:52,944 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 18:16:52,945 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 18:16:52,946 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 18:16:52,947 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 18:16:52,947 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 18:16:52,947 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 18:16:52,947 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 18:16:52,948 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 18:16:52,948 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 18:16:52,948 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 18:16:52,948 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 18:16:52,948 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 18:16:52,949 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 18:16:52,949 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 18:16:52,949 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 18:16:52,949 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 18:16:52,949 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 18:16:52,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 18:16:52,950 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 18:16:52,950 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 18:16:52,950 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 18:16:52,951 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 18:16:52,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 18:16:52,951 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 18:16:52,951 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 18:16:52,952 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:16:53,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 18:16:53,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 18:16:53,369 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 18:16:53,370 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 18:16:53,374 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 18:16:53,377 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec1_product03.cil.c [2021-01-06 18:16:53,460 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a3e06ec2d/f7cd6fffc8594c15bfab69245752a2b6/FLAGde11ea416 [2021-01-06 18:16:54,423 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 18:16:54,424 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec1_product03.cil.c [2021-01-06 18:16:54,478 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a3e06ec2d/f7cd6fffc8594c15bfab69245752a2b6/FLAGde11ea416 [2021-01-06 18:16:54,548 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a3e06ec2d/f7cd6fffc8594c15bfab69245752a2b6 [2021-01-06 18:16:54,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 18:16:54,553 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 18:16:54,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 18:16:54,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 18:16:54,563 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 18:16:54,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 06:16:54" (1/1) ... [2021-01-06 18:16:54,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9716742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:16:54, skipping insertion in model container [2021-01-06 18:16:54,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 06:16:54" (1/1) ... [2021-01-06 18:16:54,580 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 18:16:54,676 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,] 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~5,] 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[~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[~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~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] 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~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[~tmp___3~0,] 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[~tmp___2~0,] 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[~tmp___1~2,] 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[~tmp___0~2,] 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[~tmp~5,] 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[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] 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[~retValue_acc~14,] 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~15,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] 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~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] 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[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~17,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~17,] 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[~tmp___0~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~2,] 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~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~2,] 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~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~6,] 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~14,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp21~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp22~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp24~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~4,] 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~2,] left hand side expression in assignment: lhs: VariableLHS[~i~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[~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[~i~2,] 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~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[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] 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~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] 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~15,] left hand side expression in assignment: lhs: VariableLHS[~floor~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~3,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~5,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~5,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~7,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~10,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_4~0,GLOBAL] [2021-01-06 18:16:55,287 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_product03.cil.c[48864,48877] 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~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[~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~23,] 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~23,] 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~23,] 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~23,] 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~23,] 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~23,] 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~23,] 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~23,] 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~23,] 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~23,] 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~23,] 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~24,] 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[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~nd~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~maxLength~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] 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~12,] left hand side expression in assignment: lhs: VariableLHS[~action~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~8,] left hand side expression in assignment: lhs: VariableLHS[~origin~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~29,] [2021-01-06 18:16:55,427 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 18:16:55,445 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,] 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~5,] 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[~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[~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~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] 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~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[~tmp___3~0,] 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[~tmp___2~0,] 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[~tmp___1~2,] 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[~tmp___0~2,] 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[~tmp~5,] 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[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] 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[~retValue_acc~14,] 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~15,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] 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~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] 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[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~17,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~17,] 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[~tmp___0~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~2,] 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~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~2,] 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~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp8~6,] 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~14,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp21~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp22~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp24~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~4,] 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~2,] left hand side expression in assignment: lhs: VariableLHS[~i~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[~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[~i~2,] 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~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[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] 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~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] 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~15,] left hand side expression in assignment: lhs: VariableLHS[~floor~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~3,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~5,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~5,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~7,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~10,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_4~0,GLOBAL] [2021-01-06 18:16:55,552 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_product03.cil.c[48864,48877] 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~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[~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~23,] 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~23,] 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~23,] 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~23,] 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~23,] 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~23,] 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~23,] 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~23,] 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~23,] 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~23,] 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~23,] 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~24,] 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[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~25,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~26,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~nd~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~maxLength~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] 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~12,] left hand side expression in assignment: lhs: VariableLHS[~action~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~8,] left hand side expression in assignment: lhs: VariableLHS[~origin~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~29,] [2021-01-06 18:16:55,599 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 18:16:55,682 INFO L208 MainTranslator]: Completed translation [2021-01-06 18:16:55,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:16:55 WrapperNode [2021-01-06 18:16:55,683 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 18:16:55,684 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 18:16:55,685 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 18:16:55,685 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 18:16:55,694 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:16:55" (1/1) ... [2021-01-06 18:16:55,762 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:16:55" (1/1) ... [2021-01-06 18:16:55,977 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 18:16:55,980 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 18:16:55,981 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 18:16:55,981 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 18:16:55,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:16:55" (1/1) ... [2021-01-06 18:16:55,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:16:55" (1/1) ... [2021-01-06 18:16:56,032 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:16:55" (1/1) ... [2021-01-06 18:16:56,032 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:16:55" (1/1) ... [2021-01-06 18:16:56,116 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:16:55" (1/1) ... [2021-01-06 18:16:56,180 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:16:55" (1/1) ... [2021-01-06 18:16:56,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:16:55" (1/1) ... [2021-01-06 18:16:56,237 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 18:16:56,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 18:16:56,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 18:16:56,240 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 18:16:56,241 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:16:55" (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:16:56,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 18:16:56,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 18:16:56,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 18:16:56,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 18:17:02,221 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 18:17:02,221 INFO L299 CfgBuilder]: Removed 505 assume(true) statements. [2021-01-06 18:17:02,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 06:17:02 BoogieIcfgContainer [2021-01-06 18:17:02,230 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 18:17:02,234 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 18:17:02,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 18:17:02,238 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 18:17:02,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 06:16:54" (1/3) ... [2021-01-06 18:17:02,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@528fb749 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 06:17:02, skipping insertion in model container [2021-01-06 18:17:02,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 06:16:55" (2/3) ... [2021-01-06 18:17:02,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@528fb749 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 06:17:02, skipping insertion in model container [2021-01-06 18:17:02,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 06:17:02" (3/3) ... [2021-01-06 18:17:02,244 INFO L111 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product03.cil.c [2021-01-06 18:17:02,251 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 18:17:02,258 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2021-01-06 18:17:02,281 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-01-06 18:17:02,326 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 18:17:02,326 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 18:17:02,326 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 18:17:02,326 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 18:17:02,326 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 18:17:02,326 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 18:17:02,327 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 18:17:02,327 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 18:17:02,380 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states. [2021-01-06 18:17:02,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-01-06 18:17:02,402 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:02,406 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] [2021-01-06 18:17:02,407 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:17:02,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:02,414 INFO L82 PathProgramCache]: Analyzing trace with hash 13983143, now seen corresponding path program 1 times [2021-01-06 18:17:02,426 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:02,426 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441623062] [2021-01-06 18:17:02,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:02,916 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:17:02,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441623062] [2021-01-06 18:17:02,918 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:02,918 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:17:02,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409377619] [2021-01-06 18:17:02,924 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 18:17:02,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:02,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 18:17:02,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:17:02,943 INFO L87 Difference]: Start difference. First operand 2303 states. Second operand 3 states. [2021-01-06 18:17:03,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:03,262 INFO L93 Difference]: Finished difference Result 6829 states and 12929 transitions. [2021-01-06 18:17:03,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 18:17:03,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2021-01-06 18:17:03,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:03,341 INFO L225 Difference]: With dead ends: 6829 [2021-01-06 18:17:03,341 INFO L226 Difference]: Without dead ends: 4531 [2021-01-06 18:17:03,356 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:17:03,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4531 states. [2021-01-06 18:17:03,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4531 to 2299. [2021-01-06 18:17:03,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2299 states. [2021-01-06 18:17:03,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 2299 states and 4340 transitions. [2021-01-06 18:17:03,553 INFO L78 Accepts]: Start accepts. Automaton has 2299 states and 4340 transitions. Word has length 53 [2021-01-06 18:17:03,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:03,554 INFO L481 AbstractCegarLoop]: Abstraction has 2299 states and 4340 transitions. [2021-01-06 18:17:03,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 18:17:03,554 INFO L276 IsEmpty]: Start isEmpty. Operand 2299 states and 4340 transitions. [2021-01-06 18:17:03,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-01-06 18:17:03,558 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:03,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] [2021-01-06 18:17:03,559 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 18:17:03,559 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:17:03,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:03,560 INFO L82 PathProgramCache]: Analyzing trace with hash 347533292, now seen corresponding path program 1 times [2021-01-06 18:17:03,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:03,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081518178] [2021-01-06 18:17:03,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:03,710 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:17:03,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081518178] [2021-01-06 18:17:03,711 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:03,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 18:17:03,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982923811] [2021-01-06 18:17:03,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 18:17:03,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:03,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 18:17:03,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:17:03,718 INFO L87 Difference]: Start difference. First operand 2299 states and 4340 transitions. Second operand 6 states. [2021-01-06 18:17:04,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:04,370 INFO L93 Difference]: Finished difference Result 8971 states and 16957 transitions. [2021-01-06 18:17:04,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 18:17:04,371 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2021-01-06 18:17:04,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:04,414 INFO L225 Difference]: With dead ends: 8971 [2021-01-06 18:17:04,414 INFO L226 Difference]: Without dead ends: 6715 [2021-01-06 18:17:04,425 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-01-06 18:17:04,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6715 states. [2021-01-06 18:17:04,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6715 to 2295. [2021-01-06 18:17:04,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2295 states. [2021-01-06 18:17:04,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 2295 states and 4329 transitions. [2021-01-06 18:17:04,572 INFO L78 Accepts]: Start accepts. Automaton has 2295 states and 4329 transitions. Word has length 60 [2021-01-06 18:17:04,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:04,573 INFO L481 AbstractCegarLoop]: Abstraction has 2295 states and 4329 transitions. [2021-01-06 18:17:04,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 18:17:04,573 INFO L276 IsEmpty]: Start isEmpty. Operand 2295 states and 4329 transitions. [2021-01-06 18:17:04,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-01-06 18:17:04,576 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:04,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, 1] [2021-01-06 18:17:04,577 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 18:17:04,578 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:17:04,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:04,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1331038975, now seen corresponding path program 1 times [2021-01-06 18:17:04,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:04,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594257231] [2021-01-06 18:17:04,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:04,747 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:17:04,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594257231] [2021-01-06 18:17:04,748 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:04,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:17:04,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667971506] [2021-01-06 18:17:04,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:17:04,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:04,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:17:04,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:17:04,754 INFO L87 Difference]: Start difference. First operand 2295 states and 4329 transitions. Second operand 4 states. [2021-01-06 18:17:05,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:05,294 INFO L93 Difference]: Finished difference Result 6773 states and 12796 transitions. [2021-01-06 18:17:05,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:17:05,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2021-01-06 18:17:05,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:05,321 INFO L225 Difference]: With dead ends: 6773 [2021-01-06 18:17:05,321 INFO L226 Difference]: Without dead ends: 4521 [2021-01-06 18:17:05,327 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:17:05,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4521 states. [2021-01-06 18:17:05,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4521 to 2295. [2021-01-06 18:17:05,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2295 states. [2021-01-06 18:17:05,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 2295 states and 4320 transitions. [2021-01-06 18:17:05,445 INFO L78 Accepts]: Start accepts. Automaton has 2295 states and 4320 transitions. Word has length 62 [2021-01-06 18:17:05,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:05,453 INFO L481 AbstractCegarLoop]: Abstraction has 2295 states and 4320 transitions. [2021-01-06 18:17:05,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:17:05,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2295 states and 4320 transitions. [2021-01-06 18:17:05,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-01-06 18:17:05,458 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:05,459 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] [2021-01-06 18:17:05,459 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 18:17:05,459 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:17:05,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:05,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1309583314, now seen corresponding path program 1 times [2021-01-06 18:17:05,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:05,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020829444] [2021-01-06 18:17:05,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:05,580 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:17:05,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020829444] [2021-01-06 18:17:05,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:05,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:17:05,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095171596] [2021-01-06 18:17:05,582 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:17:05,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:05,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:17:05,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:17:05,583 INFO L87 Difference]: Start difference. First operand 2295 states and 4320 transitions. Second operand 4 states. [2021-01-06 18:17:06,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:06,061 INFO L93 Difference]: Finished difference Result 6773 states and 12778 transitions. [2021-01-06 18:17:06,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:17:06,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2021-01-06 18:17:06,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:06,088 INFO L225 Difference]: With dead ends: 6773 [2021-01-06 18:17:06,088 INFO L226 Difference]: Without dead ends: 4521 [2021-01-06 18:17:06,094 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:17:06,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4521 states. [2021-01-06 18:17:06,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4521 to 2295. [2021-01-06 18:17:06,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2295 states. [2021-01-06 18:17:06,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 2295 states and 4311 transitions. [2021-01-06 18:17:06,270 INFO L78 Accepts]: Start accepts. Automaton has 2295 states and 4311 transitions. Word has length 64 [2021-01-06 18:17:06,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:06,272 INFO L481 AbstractCegarLoop]: Abstraction has 2295 states and 4311 transitions. [2021-01-06 18:17:06,272 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:17:06,272 INFO L276 IsEmpty]: Start isEmpty. Operand 2295 states and 4311 transitions. [2021-01-06 18:17:06,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 18:17:06,276 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:06,276 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] [2021-01-06 18:17:06,276 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 18:17:06,277 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:17:06,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:06,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1753191167, now seen corresponding path program 1 times [2021-01-06 18:17:06,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:06,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561518686] [2021-01-06 18:17:06,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:06,392 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:17:06,392 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561518686] [2021-01-06 18:17:06,392 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:06,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:17:06,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065201247] [2021-01-06 18:17:06,394 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:17:06,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:06,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:17:06,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:17:06,397 INFO L87 Difference]: Start difference. First operand 2295 states and 4311 transitions. Second operand 4 states. [2021-01-06 18:17:07,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:07,043 INFO L93 Difference]: Finished difference Result 11165 states and 21062 transitions. [2021-01-06 18:17:07,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:17:07,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2021-01-06 18:17:07,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:07,081 INFO L225 Difference]: With dead ends: 11165 [2021-01-06 18:17:07,081 INFO L226 Difference]: Without dead ends: 8913 [2021-01-06 18:17:07,089 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:17:07,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8913 states. [2021-01-06 18:17:07,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8913 to 2295. [2021-01-06 18:17:07,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2295 states. [2021-01-06 18:17:07,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 2295 states and 4307 transitions. [2021-01-06 18:17:07,339 INFO L78 Accepts]: Start accepts. Automaton has 2295 states and 4307 transitions. Word has length 66 [2021-01-06 18:17:07,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:07,340 INFO L481 AbstractCegarLoop]: Abstraction has 2295 states and 4307 transitions. [2021-01-06 18:17:07,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:17:07,340 INFO L276 IsEmpty]: Start isEmpty. Operand 2295 states and 4307 transitions. [2021-01-06 18:17:07,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 18:17:07,342 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:07,343 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] [2021-01-06 18:17:07,343 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 18:17:07,344 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:17:07,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:07,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1094256255, now seen corresponding path program 1 times [2021-01-06 18:17:07,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:07,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559227556] [2021-01-06 18:17:07,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:07,450 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:17:07,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559227556] [2021-01-06 18:17:07,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:07,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:17:07,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667242286] [2021-01-06 18:17:07,451 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:17:07,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:07,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:17:07,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:17:07,452 INFO L87 Difference]: Start difference. First operand 2295 states and 4307 transitions. Second operand 4 states. [2021-01-06 18:17:07,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:07,838 INFO L93 Difference]: Finished difference Result 8948 states and 16871 transitions. [2021-01-06 18:17:07,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:17:07,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2021-01-06 18:17:07,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:07,861 INFO L225 Difference]: With dead ends: 8948 [2021-01-06 18:17:07,861 INFO L226 Difference]: Without dead ends: 6675 [2021-01-06 18:17:07,869 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:17:07,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6675 states. [2021-01-06 18:17:08,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6675 to 2277. [2021-01-06 18:17:08,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2277 states. [2021-01-06 18:17:08,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 2277 states and 4276 transitions. [2021-01-06 18:17:08,033 INFO L78 Accepts]: Start accepts. Automaton has 2277 states and 4276 transitions. Word has length 66 [2021-01-06 18:17:08,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:08,033 INFO L481 AbstractCegarLoop]: Abstraction has 2277 states and 4276 transitions. [2021-01-06 18:17:08,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:17:08,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 4276 transitions. [2021-01-06 18:17:08,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-01-06 18:17:08,037 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:08,037 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:17:08,037 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 18:17:08,037 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:17:08,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:08,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1027983750, now seen corresponding path program 1 times [2021-01-06 18:17:08,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:08,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680228467] [2021-01-06 18:17:08,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:08,101 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:17:08,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680228467] [2021-01-06 18:17:08,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:08,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:17:08,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767959505] [2021-01-06 18:17:08,105 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:17:08,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:08,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:17:08,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:17:08,107 INFO L87 Difference]: Start difference. First operand 2277 states and 4276 transitions. Second operand 4 states. [2021-01-06 18:17:08,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:08,517 INFO L93 Difference]: Finished difference Result 6737 states and 12691 transitions. [2021-01-06 18:17:08,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:17:08,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2021-01-06 18:17:08,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:08,532 INFO L225 Difference]: With dead ends: 6737 [2021-01-06 18:17:08,532 INFO L226 Difference]: Without dead ends: 4482 [2021-01-06 18:17:08,538 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:17:08,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4482 states. [2021-01-06 18:17:08,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4482 to 2277. [2021-01-06 18:17:08,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2277 states. [2021-01-06 18:17:08,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 2277 states and 4270 transitions. [2021-01-06 18:17:08,686 INFO L78 Accepts]: Start accepts. Automaton has 2277 states and 4270 transitions. Word has length 67 [2021-01-06 18:17:08,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:08,687 INFO L481 AbstractCegarLoop]: Abstraction has 2277 states and 4270 transitions. [2021-01-06 18:17:08,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:17:08,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 4270 transitions. [2021-01-06 18:17:08,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 18:17:08,689 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:08,690 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] [2021-01-06 18:17:08,690 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 18:17:08,690 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:17:08,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:08,691 INFO L82 PathProgramCache]: Analyzing trace with hash -792122438, now seen corresponding path program 1 times [2021-01-06 18:17:08,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:08,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626781150] [2021-01-06 18:17:08,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:08,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:08,764 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:17:08,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626781150] [2021-01-06 18:17:08,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:08,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:17:08,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998718677] [2021-01-06 18:17:08,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:17:08,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:08,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:17:08,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:17:08,766 INFO L87 Difference]: Start difference. First operand 2277 states and 4270 transitions. Second operand 4 states. [2021-01-06 18:17:09,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:09,152 INFO L93 Difference]: Finished difference Result 6737 states and 12679 transitions. [2021-01-06 18:17:09,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:17:09,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2021-01-06 18:17:09,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:09,175 INFO L225 Difference]: With dead ends: 6737 [2021-01-06 18:17:09,175 INFO L226 Difference]: Without dead ends: 4482 [2021-01-06 18:17:09,181 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:17:09,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4482 states. [2021-01-06 18:17:09,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4482 to 2277. [2021-01-06 18:17:09,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2277 states. [2021-01-06 18:17:09,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 2277 states and 4264 transitions. [2021-01-06 18:17:09,317 INFO L78 Accepts]: Start accepts. Automaton has 2277 states and 4264 transitions. Word has length 68 [2021-01-06 18:17:09,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:09,318 INFO L481 AbstractCegarLoop]: Abstraction has 2277 states and 4264 transitions. [2021-01-06 18:17:09,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:17:09,318 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 4264 transitions. [2021-01-06 18:17:09,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-06 18:17:09,321 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:09,321 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:17:09,321 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 18:17:09,321 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:17:09,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:09,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1517418539, now seen corresponding path program 1 times [2021-01-06 18:17:09,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:09,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42279109] [2021-01-06 18:17:09,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:09,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:09,406 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:17:09,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42279109] [2021-01-06 18:17:09,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:09,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 18:17:09,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092477204] [2021-01-06 18:17:09,408 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 18:17:09,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:09,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 18:17:09,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 18:17:09,409 INFO L87 Difference]: Start difference. First operand 2277 states and 4264 transitions. Second operand 7 states. [2021-01-06 18:17:10,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:10,234 INFO L93 Difference]: Finished difference Result 11136 states and 20976 transitions. [2021-01-06 18:17:10,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 18:17:10,234 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2021-01-06 18:17:10,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:10,267 INFO L225 Difference]: With dead ends: 11136 [2021-01-06 18:17:10,268 INFO L226 Difference]: Without dead ends: 8887 [2021-01-06 18:17:10,275 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:17:10,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8887 states. [2021-01-06 18:17:10,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8887 to 2279. [2021-01-06 18:17:10,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2279 states. [2021-01-06 18:17:10,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 4265 transitions. [2021-01-06 18:17:10,435 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 4265 transitions. Word has length 69 [2021-01-06 18:17:10,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:10,435 INFO L481 AbstractCegarLoop]: Abstraction has 2279 states and 4265 transitions. [2021-01-06 18:17:10,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 18:17:10,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 4265 transitions. [2021-01-06 18:17:10,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-01-06 18:17:10,438 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:10,438 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:17:10,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 18:17:10,438 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:17:10,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:10,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1564965744, now seen corresponding path program 1 times [2021-01-06 18:17:10,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:10,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431516639] [2021-01-06 18:17:10,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:10,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:10,535 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:17:10,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431516639] [2021-01-06 18:17:10,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:10,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 18:17:10,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036157686] [2021-01-06 18:17:10,537 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 18:17:10,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:10,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 18:17:10,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 18:17:10,538 INFO L87 Difference]: Start difference. First operand 2279 states and 4265 transitions. Second operand 7 states. [2021-01-06 18:17:11,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:11,324 INFO L93 Difference]: Finished difference Result 11128 states and 20955 transitions. [2021-01-06 18:17:11,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 18:17:11,326 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2021-01-06 18:17:11,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:11,357 INFO L225 Difference]: With dead ends: 11128 [2021-01-06 18:17:11,357 INFO L226 Difference]: Without dead ends: 8882 [2021-01-06 18:17:11,363 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:17:11,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8882 states. [2021-01-06 18:17:11,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8882 to 2284. [2021-01-06 18:17:11,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2284 states. [2021-01-06 18:17:11,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 4273 transitions. [2021-01-06 18:17:11,513 INFO L78 Accepts]: Start accepts. Automaton has 2284 states and 4273 transitions. Word has length 71 [2021-01-06 18:17:11,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:11,514 INFO L481 AbstractCegarLoop]: Abstraction has 2284 states and 4273 transitions. [2021-01-06 18:17:11,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 18:17:11,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 4273 transitions. [2021-01-06 18:17:11,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 18:17:11,516 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:11,517 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:17:11,517 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 18:17:11,517 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:17:11,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:11,518 INFO L82 PathProgramCache]: Analyzing trace with hash -2029229739, now seen corresponding path program 1 times [2021-01-06 18:17:11,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:11,518 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790459692] [2021-01-06 18:17:11,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:11,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:11,602 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:17:11,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790459692] [2021-01-06 18:17:11,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:11,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:17:11,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363173921] [2021-01-06 18:17:11,603 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 18:17:11,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:11,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 18:17:11,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:17:11,611 INFO L87 Difference]: Start difference. First operand 2284 states and 4273 transitions. Second operand 3 states. [2021-01-06 18:17:11,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:11,725 INFO L93 Difference]: Finished difference Result 4510 states and 8464 transitions. [2021-01-06 18:17:11,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 18:17:11,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2021-01-06 18:17:11,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:11,734 INFO L225 Difference]: With dead ends: 4510 [2021-01-06 18:17:11,735 INFO L226 Difference]: Without dead ends: 2263 [2021-01-06 18:17:11,739 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:17:11,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2263 states. [2021-01-06 18:17:11,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2263 to 2263. [2021-01-06 18:17:11,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2263 states. [2021-01-06 18:17:11,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 4237 transitions. [2021-01-06 18:17:11,842 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 4237 transitions. Word has length 73 [2021-01-06 18:17:11,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:11,843 INFO L481 AbstractCegarLoop]: Abstraction has 2263 states and 4237 transitions. [2021-01-06 18:17:11,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 18:17:11,843 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 4237 transitions. [2021-01-06 18:17:11,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 18:17:11,845 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:11,845 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:17:11,845 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 18:17:11,845 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:17:11,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:11,846 INFO L82 PathProgramCache]: Analyzing trace with hash -996842118, now seen corresponding path program 1 times [2021-01-06 18:17:11,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:11,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861098917] [2021-01-06 18:17:11,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:11,931 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:17:11,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861098917] [2021-01-06 18:17:11,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:11,932 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:17:11,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139688190] [2021-01-06 18:17:11,932 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:17:11,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:11,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:17:11,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:17:11,933 INFO L87 Difference]: Start difference. First operand 2263 states and 4237 transitions. Second operand 5 states. [2021-01-06 18:17:12,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:12,110 INFO L93 Difference]: Finished difference Result 4459 states and 8386 transitions. [2021-01-06 18:17:12,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:17:12,111 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2021-01-06 18:17:12,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:12,119 INFO L225 Difference]: With dead ends: 4459 [2021-01-06 18:17:12,119 INFO L226 Difference]: Without dead ends: 2257 [2021-01-06 18:17:12,123 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:17:12,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2021-01-06 18:17:12,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 2257. [2021-01-06 18:17:12,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2257 states. [2021-01-06 18:17:12,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 4228 transitions. [2021-01-06 18:17:12,270 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 4228 transitions. Word has length 75 [2021-01-06 18:17:12,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:12,270 INFO L481 AbstractCegarLoop]: Abstraction has 2257 states and 4228 transitions. [2021-01-06 18:17:12,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:17:12,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 4228 transitions. [2021-01-06 18:17:12,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 18:17:12,273 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:12,273 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:17:12,273 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 18:17:12,273 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:17:12,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:12,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1253834246, now seen corresponding path program 1 times [2021-01-06 18:17:12,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:12,274 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669984185] [2021-01-06 18:17:12,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:12,372 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:17:12,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669984185] [2021-01-06 18:17:12,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:12,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:17:12,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279502717] [2021-01-06 18:17:12,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:17:12,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:12,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:17:12,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:17:12,375 INFO L87 Difference]: Start difference. First operand 2257 states and 4228 transitions. Second operand 4 states. [2021-01-06 18:17:12,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:12,511 INFO L93 Difference]: Finished difference Result 4453 states and 8377 transitions. [2021-01-06 18:17:12,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 18:17:12,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2021-01-06 18:17:12,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:12,517 INFO L225 Difference]: With dead ends: 4453 [2021-01-06 18:17:12,517 INFO L226 Difference]: Without dead ends: 2243 [2021-01-06 18:17:12,525 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:17:12,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2243 states. [2021-01-06 18:17:12,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2243 to 2243. [2021-01-06 18:17:12,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2243 states. [2021-01-06 18:17:12,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 2243 states and 4207 transitions. [2021-01-06 18:17:12,633 INFO L78 Accepts]: Start accepts. Automaton has 2243 states and 4207 transitions. Word has length 75 [2021-01-06 18:17:12,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:12,635 INFO L481 AbstractCegarLoop]: Abstraction has 2243 states and 4207 transitions. [2021-01-06 18:17:12,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:17:12,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 4207 transitions. [2021-01-06 18:17:12,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 18:17:12,637 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:12,637 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] [2021-01-06 18:17:12,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 18:17:12,637 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:17:12,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:12,638 INFO L82 PathProgramCache]: Analyzing trace with hash 605407655, now seen corresponding path program 1 times [2021-01-06 18:17:12,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:12,638 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948404958] [2021-01-06 18:17:12,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:12,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:12,741 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:17:12,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948404958] [2021-01-06 18:17:12,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:12,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 18:17:12,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203561499] [2021-01-06 18:17:12,742 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 18:17:12,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:12,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 18:17:12,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:17:12,743 INFO L87 Difference]: Start difference. First operand 2243 states and 4207 transitions. Second operand 6 states. [2021-01-06 18:17:12,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:12,968 INFO L93 Difference]: Finished difference Result 4453 states and 8372 transitions. [2021-01-06 18:17:12,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 18:17:12,968 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2021-01-06 18:17:12,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:12,974 INFO L225 Difference]: With dead ends: 4453 [2021-01-06 18:17:12,975 INFO L226 Difference]: Without dead ends: 2263 [2021-01-06 18:17:12,979 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:17:12,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2263 states. [2021-01-06 18:17:13,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2263 to 2243. [2021-01-06 18:17:13,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2243 states. [2021-01-06 18:17:13,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 2243 states and 4206 transitions. [2021-01-06 18:17:13,097 INFO L78 Accepts]: Start accepts. Automaton has 2243 states and 4206 transitions. Word has length 76 [2021-01-06 18:17:13,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:13,097 INFO L481 AbstractCegarLoop]: Abstraction has 2243 states and 4206 transitions. [2021-01-06 18:17:13,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 18:17:13,098 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 4206 transitions. [2021-01-06 18:17:13,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-01-06 18:17:13,103 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:13,103 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] [2021-01-06 18:17:13,103 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 18:17:13,104 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:17:13,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:13,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1546323955, now seen corresponding path program 1 times [2021-01-06 18:17:13,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:13,104 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992946997] [2021-01-06 18:17:13,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:13,200 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:17:13,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992946997] [2021-01-06 18:17:13,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:13,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 18:17:13,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537860007] [2021-01-06 18:17:13,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 18:17:13,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:13,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 18:17:13,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:17:13,203 INFO L87 Difference]: Start difference. First operand 2243 states and 4206 transitions. Second operand 6 states. [2021-01-06 18:17:13,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:13,583 INFO L93 Difference]: Finished difference Result 4443 states and 8353 transitions. [2021-01-06 18:17:13,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 18:17:13,584 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2021-01-06 18:17:13,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:13,594 INFO L225 Difference]: With dead ends: 4443 [2021-01-06 18:17:13,594 INFO L226 Difference]: Without dead ends: 2258 [2021-01-06 18:17:13,599 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:17:13,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2258 states. [2021-01-06 18:17:13,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2258 to 2243. [2021-01-06 18:17:13,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2243 states. [2021-01-06 18:17:13,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 2243 states and 4205 transitions. [2021-01-06 18:17:13,780 INFO L78 Accepts]: Start accepts. Automaton has 2243 states and 4205 transitions. Word has length 77 [2021-01-06 18:17:13,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:13,780 INFO L481 AbstractCegarLoop]: Abstraction has 2243 states and 4205 transitions. [2021-01-06 18:17:13,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 18:17:13,780 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 4205 transitions. [2021-01-06 18:17:13,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-06 18:17:13,784 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:13,784 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] [2021-01-06 18:17:13,784 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 18:17:13,784 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:17:13,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:13,785 INFO L82 PathProgramCache]: Analyzing trace with hash -738611566, now seen corresponding path program 1 times [2021-01-06 18:17:13,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:13,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782864901] [2021-01-06 18:17:13,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:13,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:13,920 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:17:13,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782864901] [2021-01-06 18:17:13,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:13,921 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:17:13,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702864741] [2021-01-06 18:17:13,921 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:17:13,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:13,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:17:13,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:17:13,922 INFO L87 Difference]: Start difference. First operand 2243 states and 4205 transitions. Second operand 4 states. [2021-01-06 18:17:15,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:15,137 INFO L93 Difference]: Finished difference Result 6135 states and 11592 transitions. [2021-01-06 18:17:15,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 18:17:15,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2021-01-06 18:17:15,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:15,147 INFO L225 Difference]: With dead ends: 6135 [2021-01-06 18:17:15,147 INFO L226 Difference]: Without dead ends: 3956 [2021-01-06 18:17:15,152 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:17:15,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3956 states. [2021-01-06 18:17:15,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3956 to 2243. [2021-01-06 18:17:15,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2243 states. [2021-01-06 18:17:15,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 2243 states and 4199 transitions. [2021-01-06 18:17:15,291 INFO L78 Accepts]: Start accepts. Automaton has 2243 states and 4199 transitions. Word has length 78 [2021-01-06 18:17:15,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:15,291 INFO L481 AbstractCegarLoop]: Abstraction has 2243 states and 4199 transitions. [2021-01-06 18:17:15,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:17:15,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 4199 transitions. [2021-01-06 18:17:15,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-01-06 18:17:15,294 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:15,294 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:17:15,294 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 18:17:15,294 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:17:15,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:15,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1707707840, now seen corresponding path program 1 times [2021-01-06 18:17:15,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:15,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96135633] [2021-01-06 18:17:15,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:15,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:15,406 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:17:15,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96135633] [2021-01-06 18:17:15,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:15,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:17:15,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295034343] [2021-01-06 18:17:15,407 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:17:15,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:15,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:17:15,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:17:15,408 INFO L87 Difference]: Start difference. First operand 2243 states and 4199 transitions. Second operand 4 states. [2021-01-06 18:17:16,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:16,575 INFO L93 Difference]: Finished difference Result 6135 states and 11581 transitions. [2021-01-06 18:17:16,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 18:17:16,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2021-01-06 18:17:16,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:16,586 INFO L225 Difference]: With dead ends: 6135 [2021-01-06 18:17:16,586 INFO L226 Difference]: Without dead ends: 3956 [2021-01-06 18:17:16,590 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:17:16,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3956 states. [2021-01-06 18:17:16,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3956 to 2243. [2021-01-06 18:17:16,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2243 states. [2021-01-06 18:17:16,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 2243 states and 4193 transitions. [2021-01-06 18:17:16,729 INFO L78 Accepts]: Start accepts. Automaton has 2243 states and 4193 transitions. Word has length 80 [2021-01-06 18:17:16,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:16,729 INFO L481 AbstractCegarLoop]: Abstraction has 2243 states and 4193 transitions. [2021-01-06 18:17:16,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:17:16,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 4193 transitions. [2021-01-06 18:17:16,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-01-06 18:17:16,732 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:16,732 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] [2021-01-06 18:17:16,732 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 18:17:16,732 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:17:16,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:16,733 INFO L82 PathProgramCache]: Analyzing trace with hash -65650296, now seen corresponding path program 1 times [2021-01-06 18:17:16,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:16,733 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808218814] [2021-01-06 18:17:16,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:16,822 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:17:16,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808218814] [2021-01-06 18:17:16,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:16,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:17:16,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804547711] [2021-01-06 18:17:16,833 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:17:16,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:16,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:17:16,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:17:16,834 INFO L87 Difference]: Start difference. First operand 2243 states and 4193 transitions. Second operand 4 states. [2021-01-06 18:17:18,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:18,231 INFO L93 Difference]: Finished difference Result 6135 states and 11570 transitions. [2021-01-06 18:17:18,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 18:17:18,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2021-01-06 18:17:18,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:18,243 INFO L225 Difference]: With dead ends: 6135 [2021-01-06 18:17:18,243 INFO L226 Difference]: Without dead ends: 3956 [2021-01-06 18:17:18,246 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:17:18,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3956 states. [2021-01-06 18:17:18,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3956 to 2243. [2021-01-06 18:17:18,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2243 states. [2021-01-06 18:17:18,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 2243 states and 4187 transitions. [2021-01-06 18:17:18,407 INFO L78 Accepts]: Start accepts. Automaton has 2243 states and 4187 transitions. Word has length 82 [2021-01-06 18:17:18,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:18,408 INFO L481 AbstractCegarLoop]: Abstraction has 2243 states and 4187 transitions. [2021-01-06 18:17:18,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:17:18,408 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 4187 transitions. [2021-01-06 18:17:18,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-01-06 18:17:18,410 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:18,410 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] [2021-01-06 18:17:18,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 18:17:18,411 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:17:18,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:18,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1420572704, now seen corresponding path program 1 times [2021-01-06 18:17:18,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:18,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125748089] [2021-01-06 18:17:18,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:18,501 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:17:18,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125748089] [2021-01-06 18:17:18,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:18,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:17:18,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817522421] [2021-01-06 18:17:18,503 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:17:18,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:18,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:17:18,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:17:18,504 INFO L87 Difference]: Start difference. First operand 2243 states and 4187 transitions. Second operand 4 states. [2021-01-06 18:17:19,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:19,620 INFO L93 Difference]: Finished difference Result 6135 states and 11559 transitions. [2021-01-06 18:17:19,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 18:17:19,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2021-01-06 18:17:19,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:19,636 INFO L225 Difference]: With dead ends: 6135 [2021-01-06 18:17:19,636 INFO L226 Difference]: Without dead ends: 3956 [2021-01-06 18:17:19,644 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:17:19,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3956 states. [2021-01-06 18:17:19,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3956 to 2243. [2021-01-06 18:17:19,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2243 states. [2021-01-06 18:17:19,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 2243 states and 4181 transitions. [2021-01-06 18:17:19,790 INFO L78 Accepts]: Start accepts. Automaton has 2243 states and 4181 transitions. Word has length 84 [2021-01-06 18:17:19,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:19,790 INFO L481 AbstractCegarLoop]: Abstraction has 2243 states and 4181 transitions. [2021-01-06 18:17:19,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:17:19,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 4181 transitions. [2021-01-06 18:17:19,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-01-06 18:17:19,792 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:19,793 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] [2021-01-06 18:17:19,793 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 18:17:19,793 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:17:19,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:19,793 INFO L82 PathProgramCache]: Analyzing trace with hash -178845954, now seen corresponding path program 1 times [2021-01-06 18:17:19,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:19,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618019603] [2021-01-06 18:17:19,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:19,902 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:17:19,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618019603] [2021-01-06 18:17:19,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:19,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:17:19,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882766226] [2021-01-06 18:17:19,904 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 18:17:19,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:19,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 18:17:19,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:17:19,905 INFO L87 Difference]: Start difference. First operand 2243 states and 4181 transitions. Second operand 6 states. [2021-01-06 18:17:23,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:23,284 INFO L93 Difference]: Finished difference Result 23845 states and 44836 transitions. [2021-01-06 18:17:23,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 18:17:23,284 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2021-01-06 18:17:23,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:23,320 INFO L225 Difference]: With dead ends: 23845 [2021-01-06 18:17:23,321 INFO L226 Difference]: Without dead ends: 21684 [2021-01-06 18:17:23,328 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-01-06 18:17:23,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21684 states. [2021-01-06 18:17:23,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21684 to 4410. [2021-01-06 18:17:23,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4410 states. [2021-01-06 18:17:23,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4410 states to 4410 states and 8250 transitions. [2021-01-06 18:17:23,733 INFO L78 Accepts]: Start accepts. Automaton has 4410 states and 8250 transitions. Word has length 86 [2021-01-06 18:17:23,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:23,733 INFO L481 AbstractCegarLoop]: Abstraction has 4410 states and 8250 transitions. [2021-01-06 18:17:23,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 18:17:23,734 INFO L276 IsEmpty]: Start isEmpty. Operand 4410 states and 8250 transitions. [2021-01-06 18:17:23,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 18:17:23,738 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:23,738 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] [2021-01-06 18:17:23,738 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 18:17:23,738 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:17:23,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:23,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1555279906, now seen corresponding path program 1 times [2021-01-06 18:17:23,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:23,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053674164] [2021-01-06 18:17:23,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:23,812 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:17:23,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053674164] [2021-01-06 18:17:23,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:23,813 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:17:23,814 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774231294] [2021-01-06 18:17:23,815 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:17:23,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:23,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:17:23,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:17:23,816 INFO L87 Difference]: Start difference. First operand 4410 states and 8250 transitions. Second operand 5 states. [2021-01-06 18:17:26,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:26,070 INFO L93 Difference]: Finished difference Result 17543 states and 32877 transitions. [2021-01-06 18:17:26,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 18:17:26,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2021-01-06 18:17:26,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:26,091 INFO L225 Difference]: With dead ends: 17543 [2021-01-06 18:17:26,091 INFO L226 Difference]: Without dead ends: 13281 [2021-01-06 18:17:26,101 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:17:26,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13281 states. [2021-01-06 18:17:26,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13281 to 4422. [2021-01-06 18:17:26,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4422 states. [2021-01-06 18:17:26,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4422 states to 4422 states and 8262 transitions. [2021-01-06 18:17:26,486 INFO L78 Accepts]: Start accepts. Automaton has 4422 states and 8262 transitions. Word has length 88 [2021-01-06 18:17:26,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:26,487 INFO L481 AbstractCegarLoop]: Abstraction has 4422 states and 8262 transitions. [2021-01-06 18:17:26,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:17:26,487 INFO L276 IsEmpty]: Start isEmpty. Operand 4422 states and 8262 transitions. [2021-01-06 18:17:26,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 18:17:26,491 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:26,491 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] [2021-01-06 18:17:26,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 18:17:26,491 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:17:26,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:26,492 INFO L82 PathProgramCache]: Analyzing trace with hash -692204519, now seen corresponding path program 1 times [2021-01-06 18:17:26,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:26,492 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312942942] [2021-01-06 18:17:26,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:26,559 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:17:26,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312942942] [2021-01-06 18:17:26,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:26,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:17:26,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510527075] [2021-01-06 18:17:26,560 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:17:26,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:26,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:17:26,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:17:26,561 INFO L87 Difference]: Start difference. First operand 4422 states and 8262 transitions. Second operand 5 states. [2021-01-06 18:17:26,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:26,926 INFO L93 Difference]: Finished difference Result 8776 states and 16433 transitions. [2021-01-06 18:17:26,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 18:17:26,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2021-01-06 18:17:26,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:26,933 INFO L225 Difference]: With dead ends: 8776 [2021-01-06 18:17:26,933 INFO L226 Difference]: Without dead ends: 4433 [2021-01-06 18:17:26,940 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 18:17:26,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4433 states. [2021-01-06 18:17:27,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4433 to 4418. [2021-01-06 18:17:27,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4418 states. [2021-01-06 18:17:27,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4418 states to 4418 states and 8252 transitions. [2021-01-06 18:17:27,298 INFO L78 Accepts]: Start accepts. Automaton has 4418 states and 8252 transitions. Word has length 88 [2021-01-06 18:17:27,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:27,298 INFO L481 AbstractCegarLoop]: Abstraction has 4418 states and 8252 transitions. [2021-01-06 18:17:27,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:17:27,298 INFO L276 IsEmpty]: Start isEmpty. Operand 4418 states and 8252 transitions. [2021-01-06 18:17:27,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-01-06 18:17:27,302 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:27,302 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] [2021-01-06 18:17:27,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 18:17:27,303 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:17:27,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:27,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1282644095, now seen corresponding path program 1 times [2021-01-06 18:17:27,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:27,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9046359] [2021-01-06 18:17:27,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:27,402 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:17:27,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9046359] [2021-01-06 18:17:27,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:27,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:17:27,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226146590] [2021-01-06 18:17:27,408 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:17:27,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:27,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:17:27,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:17:27,409 INFO L87 Difference]: Start difference. First operand 4418 states and 8252 transitions. Second operand 4 states. [2021-01-06 18:17:29,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:29,508 INFO L93 Difference]: Finished difference Result 15180 states and 28475 transitions. [2021-01-06 18:17:29,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:17:29,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2021-01-06 18:17:29,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:29,524 INFO L225 Difference]: With dead ends: 15180 [2021-01-06 18:17:29,524 INFO L226 Difference]: Without dead ends: 10867 [2021-01-06 18:17:29,532 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:17:29,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10867 states. [2021-01-06 18:17:30,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10867 to 6012. [2021-01-06 18:17:30,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6012 states. [2021-01-06 18:17:30,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6012 states to 6012 states and 11102 transitions. [2021-01-06 18:17:30,085 INFO L78 Accepts]: Start accepts. Automaton has 6012 states and 11102 transitions. Word has length 89 [2021-01-06 18:17:30,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:30,086 INFO L481 AbstractCegarLoop]: Abstraction has 6012 states and 11102 transitions. [2021-01-06 18:17:30,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:17:30,086 INFO L276 IsEmpty]: Start isEmpty. Operand 6012 states and 11102 transitions. [2021-01-06 18:17:30,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-01-06 18:17:30,089 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:30,089 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] [2021-01-06 18:17:30,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 18:17:30,090 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:17:30,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:30,090 INFO L82 PathProgramCache]: Analyzing trace with hash -387356049, now seen corresponding path program 1 times [2021-01-06 18:17:30,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:30,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699140718] [2021-01-06 18:17:30,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:30,155 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:17:30,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699140718] [2021-01-06 18:17:30,156 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:30,156 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:17:30,156 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274859698] [2021-01-06 18:17:30,157 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:17:30,157 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:30,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:17:30,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:17:30,157 INFO L87 Difference]: Start difference. First operand 6012 states and 11102 transitions. Second operand 5 states. [2021-01-06 18:17:30,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:30,434 INFO L93 Difference]: Finished difference Result 8982 states and 16597 transitions. [2021-01-06 18:17:30,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 18:17:30,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2021-01-06 18:17:30,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:30,441 INFO L225 Difference]: With dead ends: 8982 [2021-01-06 18:17:30,441 INFO L226 Difference]: Without dead ends: 3000 [2021-01-06 18:17:30,449 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:17:30,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2021-01-06 18:17:30,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 3000. [2021-01-06 18:17:30,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3000 states. [2021-01-06 18:17:30,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3000 states to 3000 states and 5530 transitions. [2021-01-06 18:17:30,669 INFO L78 Accepts]: Start accepts. Automaton has 3000 states and 5530 transitions. Word has length 89 [2021-01-06 18:17:30,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:30,669 INFO L481 AbstractCegarLoop]: Abstraction has 3000 states and 5530 transitions. [2021-01-06 18:17:30,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:17:30,669 INFO L276 IsEmpty]: Start isEmpty. Operand 3000 states and 5530 transitions. [2021-01-06 18:17:30,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-01-06 18:17:30,671 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:30,671 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] [2021-01-06 18:17:30,671 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 18:17:30,671 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:17:30,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:30,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1602864519, now seen corresponding path program 1 times [2021-01-06 18:17:30,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:30,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578219797] [2021-01-06 18:17:30,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:30,747 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:17:30,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578219797] [2021-01-06 18:17:30,747 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:30,748 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:17:30,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747793116] [2021-01-06 18:17:30,748 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:17:30,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:30,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:17:30,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:17:30,749 INFO L87 Difference]: Start difference. First operand 3000 states and 5530 transitions. Second operand 5 states. [2021-01-06 18:17:31,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:31,945 INFO L93 Difference]: Finished difference Result 21492 states and 39956 transitions. [2021-01-06 18:17:31,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 18:17:31,945 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2021-01-06 18:17:31,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:31,968 INFO L225 Difference]: With dead ends: 21492 [2021-01-06 18:17:31,968 INFO L226 Difference]: Without dead ends: 18564 [2021-01-06 18:17:31,975 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:17:31,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18564 states. [2021-01-06 18:17:32,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18564 to 5497. [2021-01-06 18:17:32,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5497 states. [2021-01-06 18:17:32,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5497 states to 5497 states and 10198 transitions. [2021-01-06 18:17:32,424 INFO L78 Accepts]: Start accepts. Automaton has 5497 states and 10198 transitions. Word has length 91 [2021-01-06 18:17:32,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:32,424 INFO L481 AbstractCegarLoop]: Abstraction has 5497 states and 10198 transitions. [2021-01-06 18:17:32,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:17:32,425 INFO L276 IsEmpty]: Start isEmpty. Operand 5497 states and 10198 transitions. [2021-01-06 18:17:32,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-01-06 18:17:32,427 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:32,427 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] [2021-01-06 18:17:32,427 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 18:17:32,427 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:17:32,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:32,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1877624133, now seen corresponding path program 1 times [2021-01-06 18:17:32,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:32,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616724765] [2021-01-06 18:17:32,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:32,561 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:17:32,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616724765] [2021-01-06 18:17:32,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:32,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:17:32,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055144632] [2021-01-06 18:17:32,562 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 18:17:32,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:32,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 18:17:32,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:17:32,563 INFO L87 Difference]: Start difference. First operand 5497 states and 10198 transitions. Second operand 6 states. [2021-01-06 18:17:33,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:33,579 INFO L93 Difference]: Finished difference Result 10000 states and 18458 transitions. [2021-01-06 18:17:33,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 18:17:33,580 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2021-01-06 18:17:33,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:33,590 INFO L225 Difference]: With dead ends: 10000 [2021-01-06 18:17:33,590 INFO L226 Difference]: Without dead ends: 7594 [2021-01-06 18:17:33,593 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-01-06 18:17:33,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7594 states. [2021-01-06 18:17:33,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7594 to 5487. [2021-01-06 18:17:33,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5487 states. [2021-01-06 18:17:33,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5487 states to 5487 states and 10178 transitions. [2021-01-06 18:17:33,883 INFO L78 Accepts]: Start accepts. Automaton has 5487 states and 10178 transitions. Word has length 91 [2021-01-06 18:17:33,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:33,883 INFO L481 AbstractCegarLoop]: Abstraction has 5487 states and 10178 transitions. [2021-01-06 18:17:33,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 18:17:33,883 INFO L276 IsEmpty]: Start isEmpty. Operand 5487 states and 10178 transitions. [2021-01-06 18:17:33,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-01-06 18:17:33,885 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:33,885 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:17:33,885 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 18:17:33,886 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:17:33,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:33,886 INFO L82 PathProgramCache]: Analyzing trace with hash -2027187445, now seen corresponding path program 1 times [2021-01-06 18:17:33,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:33,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325413474] [2021-01-06 18:17:33,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:33,966 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:17:33,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325413474] [2021-01-06 18:17:33,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:33,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:17:33,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845115968] [2021-01-06 18:17:33,967 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:17:33,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:33,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:17:33,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:17:33,968 INFO L87 Difference]: Start difference. First operand 5487 states and 10178 transitions. Second operand 5 states. [2021-01-06 18:17:34,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:34,873 INFO L93 Difference]: Finished difference Result 16655 states and 30926 transitions. [2021-01-06 18:17:34,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 18:17:34,873 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2021-01-06 18:17:34,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:34,893 INFO L225 Difference]: With dead ends: 16655 [2021-01-06 18:17:34,898 INFO L226 Difference]: Without dead ends: 14255 [2021-01-06 18:17:34,907 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:17:34,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14255 states. [2021-01-06 18:17:35,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14255 to 7626. [2021-01-06 18:17:35,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7626 states. [2021-01-06 18:17:35,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7626 states to 7626 states and 14127 transitions. [2021-01-06 18:17:35,421 INFO L78 Accepts]: Start accepts. Automaton has 7626 states and 14127 transitions. Word has length 93 [2021-01-06 18:17:35,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:35,421 INFO L481 AbstractCegarLoop]: Abstraction has 7626 states and 14127 transitions. [2021-01-06 18:17:35,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:17:35,422 INFO L276 IsEmpty]: Start isEmpty. Operand 7626 states and 14127 transitions. [2021-01-06 18:17:35,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-01-06 18:17:35,424 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:35,424 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] [2021-01-06 18:17:35,425 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 18:17:35,425 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:17:35,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:35,425 INFO L82 PathProgramCache]: Analyzing trace with hash 918387229, now seen corresponding path program 1 times [2021-01-06 18:17:35,426 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:35,426 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535869593] [2021-01-06 18:17:35,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:35,507 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:17:35,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535869593] [2021-01-06 18:17:35,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:35,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:17:35,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76788631] [2021-01-06 18:17:35,509 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:17:35,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:35,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:17:35,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:17:35,510 INFO L87 Difference]: Start difference. First operand 7626 states and 14127 transitions. Second operand 5 states. [2021-01-06 18:17:36,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:36,387 INFO L93 Difference]: Finished difference Result 15842 states and 29218 transitions. [2021-01-06 18:17:36,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 18:17:36,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2021-01-06 18:17:36,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:36,401 INFO L225 Difference]: With dead ends: 15842 [2021-01-06 18:17:36,402 INFO L226 Difference]: Without dead ends: 11520 [2021-01-06 18:17:36,407 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:17:36,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11520 states. [2021-01-06 18:17:36,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11520 to 7643. [2021-01-06 18:17:36,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7643 states. [2021-01-06 18:17:36,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7643 states to 7643 states and 14140 transitions. [2021-01-06 18:17:36,875 INFO L78 Accepts]: Start accepts. Automaton has 7643 states and 14140 transitions. Word has length 95 [2021-01-06 18:17:36,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:36,875 INFO L481 AbstractCegarLoop]: Abstraction has 7643 states and 14140 transitions. [2021-01-06 18:17:36,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:17:36,875 INFO L276 IsEmpty]: Start isEmpty. Operand 7643 states and 14140 transitions. [2021-01-06 18:17:36,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-01-06 18:17:36,878 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:36,878 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] [2021-01-06 18:17:36,878 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 18:17:36,878 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:17:36,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:36,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1941230665, now seen corresponding path program 1 times [2021-01-06 18:17:36,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:36,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788303720] [2021-01-06 18:17:36,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:36,964 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:17:36,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788303720] [2021-01-06 18:17:36,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:36,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:17:36,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284472433] [2021-01-06 18:17:36,965 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:17:36,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:36,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:17:36,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:17:36,966 INFO L87 Difference]: Start difference. First operand 7643 states and 14140 transitions. Second operand 5 states. [2021-01-06 18:17:38,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:38,099 INFO L93 Difference]: Finished difference Result 17342 states and 32209 transitions. [2021-01-06 18:17:38,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:17:38,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2021-01-06 18:17:38,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:38,114 INFO L225 Difference]: With dead ends: 17342 [2021-01-06 18:17:38,114 INFO L226 Difference]: Without dead ends: 11065 [2021-01-06 18:17:38,118 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:17:38,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11065 states. [2021-01-06 18:17:38,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11065 to 7643. [2021-01-06 18:17:38,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7643 states. [2021-01-06 18:17:38,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7643 states to 7643 states and 14040 transitions. [2021-01-06 18:17:38,519 INFO L78 Accepts]: Start accepts. Automaton has 7643 states and 14040 transitions. Word has length 102 [2021-01-06 18:17:38,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:38,520 INFO L481 AbstractCegarLoop]: Abstraction has 7643 states and 14040 transitions. [2021-01-06 18:17:38,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:17:38,520 INFO L276 IsEmpty]: Start isEmpty. Operand 7643 states and 14040 transitions. [2021-01-06 18:17:38,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-01-06 18:17:38,522 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:38,523 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] [2021-01-06 18:17:38,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 18:17:38,523 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:17:38,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:38,523 INFO L82 PathProgramCache]: Analyzing trace with hash 55305702, now seen corresponding path program 1 times [2021-01-06 18:17:38,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:38,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499613865] [2021-01-06 18:17:38,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:38,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:38,630 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:17:38,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499613865] [2021-01-06 18:17:38,633 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:38,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 18:17:38,634 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936626966] [2021-01-06 18:17:38,634 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 18:17:38,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:38,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 18:17:38,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:17:38,635 INFO L87 Difference]: Start difference. First operand 7643 states and 14040 transitions. Second operand 6 states. [2021-01-06 18:17:39,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:39,337 INFO L93 Difference]: Finished difference Result 12331 states and 22533 transitions. [2021-01-06 18:17:39,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 18:17:39,337 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2021-01-06 18:17:39,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:39,349 INFO L225 Difference]: With dead ends: 12331 [2021-01-06 18:17:39,349 INFO L226 Difference]: Without dead ends: 7658 [2021-01-06 18:17:39,354 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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:17:39,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7658 states. [2021-01-06 18:17:39,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7658 to 7643. [2021-01-06 18:17:39,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7643 states. [2021-01-06 18:17:39,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7643 states to 7643 states and 13938 transitions. [2021-01-06 18:17:39,855 INFO L78 Accepts]: Start accepts. Automaton has 7643 states and 13938 transitions. Word has length 102 [2021-01-06 18:17:39,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:39,855 INFO L481 AbstractCegarLoop]: Abstraction has 7643 states and 13938 transitions. [2021-01-06 18:17:39,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 18:17:39,855 INFO L276 IsEmpty]: Start isEmpty. Operand 7643 states and 13938 transitions. [2021-01-06 18:17:39,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-01-06 18:17:39,857 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:39,857 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] [2021-01-06 18:17:39,858 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 18:17:39,858 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:17:39,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:39,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1607798750, now seen corresponding path program 1 times [2021-01-06 18:17:39,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:39,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226295042] [2021-01-06 18:17:39,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:39,938 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:17:39,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226295042] [2021-01-06 18:17:39,938 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:39,938 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:17:39,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919011249] [2021-01-06 18:17:39,939 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 18:17:39,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:39,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 18:17:39,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:17:39,940 INFO L87 Difference]: Start difference. First operand 7643 states and 13938 transitions. Second operand 3 states. [2021-01-06 18:17:40,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:40,568 INFO L93 Difference]: Finished difference Result 13796 states and 25145 transitions. [2021-01-06 18:17:40,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 18:17:40,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2021-01-06 18:17:40,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:40,581 INFO L225 Difference]: With dead ends: 13796 [2021-01-06 18:17:40,581 INFO L226 Difference]: Without dead ends: 7621 [2021-01-06 18:17:40,588 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:17:40,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7621 states. [2021-01-06 18:17:41,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7621 to 7621. [2021-01-06 18:17:41,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7621 states. [2021-01-06 18:17:41,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7621 states to 7621 states and 13896 transitions. [2021-01-06 18:17:41,115 INFO L78 Accepts]: Start accepts. Automaton has 7621 states and 13896 transitions. Word has length 103 [2021-01-06 18:17:41,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:41,115 INFO L481 AbstractCegarLoop]: Abstraction has 7621 states and 13896 transitions. [2021-01-06 18:17:41,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 18:17:41,115 INFO L276 IsEmpty]: Start isEmpty. Operand 7621 states and 13896 transitions. [2021-01-06 18:17:41,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 18:17:41,117 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:41,117 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] [2021-01-06 18:17:41,118 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 18:17:41,118 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:17:41,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:41,118 INFO L82 PathProgramCache]: Analyzing trace with hash -2077440587, now seen corresponding path program 1 times [2021-01-06 18:17:41,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:41,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454156854] [2021-01-06 18:17:41,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:41,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:41,204 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:17:41,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454156854] [2021-01-06 18:17:41,205 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:41,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:17:41,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971710536] [2021-01-06 18:17:41,206 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:17:41,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:41,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:17:41,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:17:41,207 INFO L87 Difference]: Start difference. First operand 7621 states and 13896 transitions. Second operand 5 states. [2021-01-06 18:17:43,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:43,121 INFO L93 Difference]: Finished difference Result 31250 states and 55815 transitions. [2021-01-06 18:17:43,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 18:17:43,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2021-01-06 18:17:43,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:43,156 INFO L225 Difference]: With dead ends: 31250 [2021-01-06 18:17:43,156 INFO L226 Difference]: Without dead ends: 26979 [2021-01-06 18:17:43,164 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:17:43,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26979 states. [2021-01-06 18:17:43,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26979 to 9528. [2021-01-06 18:17:43,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9528 states. [2021-01-06 18:17:43,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9528 states to 9528 states and 16902 transitions. [2021-01-06 18:17:43,938 INFO L78 Accepts]: Start accepts. Automaton has 9528 states and 16902 transitions. Word has length 105 [2021-01-06 18:17:43,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:43,938 INFO L481 AbstractCegarLoop]: Abstraction has 9528 states and 16902 transitions. [2021-01-06 18:17:43,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:17:43,938 INFO L276 IsEmpty]: Start isEmpty. Operand 9528 states and 16902 transitions. [2021-01-06 18:17:43,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 18:17:43,941 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:43,941 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] [2021-01-06 18:17:43,941 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 18:17:43,941 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:17:43,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:43,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1902219059, now seen corresponding path program 1 times [2021-01-06 18:17:43,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:43,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053808749] [2021-01-06 18:17:43,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:44,046 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:17:44,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053808749] [2021-01-06 18:17:44,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:44,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:17:44,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640089697] [2021-01-06 18:17:44,047 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:17:44,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:44,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:17:44,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:17:44,048 INFO L87 Difference]: Start difference. First operand 9528 states and 16902 transitions. Second operand 5 states. [2021-01-06 18:17:45,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:45,212 INFO L93 Difference]: Finished difference Result 15714 states and 27973 transitions. [2021-01-06 18:17:45,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:17:45,213 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2021-01-06 18:17:45,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:45,232 INFO L225 Difference]: With dead ends: 15714 [2021-01-06 18:17:45,232 INFO L226 Difference]: Without dead ends: 15701 [2021-01-06 18:17:45,235 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:17:45,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15701 states. [2021-01-06 18:17:45,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15701 to 9546. [2021-01-06 18:17:45,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9546 states. [2021-01-06 18:17:46,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9546 states to 9546 states and 16920 transitions. [2021-01-06 18:17:46,007 INFO L78 Accepts]: Start accepts. Automaton has 9546 states and 16920 transitions. Word has length 105 [2021-01-06 18:17:46,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:46,007 INFO L481 AbstractCegarLoop]: Abstraction has 9546 states and 16920 transitions. [2021-01-06 18:17:46,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:17:46,007 INFO L276 IsEmpty]: Start isEmpty. Operand 9546 states and 16920 transitions. [2021-01-06 18:17:46,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-01-06 18:17:46,010 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:46,010 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] [2021-01-06 18:17:46,010 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 18:17:46,010 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:17:46,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:46,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1579326840, now seen corresponding path program 1 times [2021-01-06 18:17:46,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:46,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754999267] [2021-01-06 18:17:46,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:46,098 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:17:46,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754999267] [2021-01-06 18:17:46,099 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:46,099 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 18:17:46,099 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117133357] [2021-01-06 18:17:46,100 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 18:17:46,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:46,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 18:17:46,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:17:46,101 INFO L87 Difference]: Start difference. First operand 9546 states and 16920 transitions. Second operand 6 states. [2021-01-06 18:17:46,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:46,878 INFO L93 Difference]: Finished difference Result 9565 states and 16938 transitions. [2021-01-06 18:17:46,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 18:17:46,878 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 107 [2021-01-06 18:17:46,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:46,889 INFO L225 Difference]: With dead ends: 9565 [2021-01-06 18:17:46,889 INFO L226 Difference]: Without dead ends: 9552 [2021-01-06 18:17:46,891 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:17:46,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9552 states. [2021-01-06 18:17:47,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9552 to 9546. [2021-01-06 18:17:47,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9546 states. [2021-01-06 18:17:47,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9546 states to 9546 states and 16910 transitions. [2021-01-06 18:17:47,514 INFO L78 Accepts]: Start accepts. Automaton has 9546 states and 16910 transitions. Word has length 107 [2021-01-06 18:17:47,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:47,514 INFO L481 AbstractCegarLoop]: Abstraction has 9546 states and 16910 transitions. [2021-01-06 18:17:47,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 18:17:47,515 INFO L276 IsEmpty]: Start isEmpty. Operand 9546 states and 16910 transitions. [2021-01-06 18:17:47,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-01-06 18:17:47,518 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:47,518 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:17:47,518 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 18:17:47,518 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:17:47,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:47,519 INFO L82 PathProgramCache]: Analyzing trace with hash -225264353, now seen corresponding path program 1 times [2021-01-06 18:17:47,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:47,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950323020] [2021-01-06 18:17:47,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:47,608 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:17:47,608 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950323020] [2021-01-06 18:17:47,608 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:47,608 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:17:47,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682871540] [2021-01-06 18:17:47,609 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:17:47,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:47,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:17:47,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:17:47,610 INFO L87 Difference]: Start difference. First operand 9546 states and 16910 transitions. Second operand 5 states. [2021-01-06 18:17:49,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:49,339 INFO L93 Difference]: Finished difference Result 22678 states and 39950 transitions. [2021-01-06 18:17:49,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 18:17:49,340 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2021-01-06 18:17:49,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:49,357 INFO L225 Difference]: With dead ends: 22678 [2021-01-06 18:17:49,357 INFO L226 Difference]: Without dead ends: 14881 [2021-01-06 18:17:49,365 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:17:49,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14881 states. [2021-01-06 18:17:50,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14881 to 9546. [2021-01-06 18:17:50,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9546 states. [2021-01-06 18:17:50,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9546 states to 9546 states and 16900 transitions. [2021-01-06 18:17:50,038 INFO L78 Accepts]: Start accepts. Automaton has 9546 states and 16900 transitions. Word has length 114 [2021-01-06 18:17:50,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:50,039 INFO L481 AbstractCegarLoop]: Abstraction has 9546 states and 16900 transitions. [2021-01-06 18:17:50,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:17:50,039 INFO L276 IsEmpty]: Start isEmpty. Operand 9546 states and 16900 transitions. [2021-01-06 18:17:50,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-01-06 18:17:50,042 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:50,042 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, 1, 1, 1, 1, 1] [2021-01-06 18:17:50,042 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-06 18:17:50,042 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:17:50,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:50,042 INFO L82 PathProgramCache]: Analyzing trace with hash 732459615, now seen corresponding path program 1 times [2021-01-06 18:17:50,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:50,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870585869] [2021-01-06 18:17:50,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:50,178 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:17:50,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870585869] [2021-01-06 18:17:50,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:50,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 18:17:50,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303414148] [2021-01-06 18:17:50,179 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 18:17:50,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:50,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 18:17:50,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 18:17:50,179 INFO L87 Difference]: Start difference. First operand 9546 states and 16900 transitions. Second operand 7 states. [2021-01-06 18:17:51,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:51,391 INFO L93 Difference]: Finished difference Result 15239 states and 27118 transitions. [2021-01-06 18:17:51,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 18:17:51,392 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2021-01-06 18:17:51,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:51,410 INFO L225 Difference]: With dead ends: 15239 [2021-01-06 18:17:51,410 INFO L226 Difference]: Without dead ends: 15226 [2021-01-06 18:17:51,415 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-01-06 18:17:51,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15226 states. [2021-01-06 18:17:52,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15226 to 9561. [2021-01-06 18:17:52,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9561 states. [2021-01-06 18:17:52,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9561 states to 9561 states and 16910 transitions. [2021-01-06 18:17:52,213 INFO L78 Accepts]: Start accepts. Automaton has 9561 states and 16910 transitions. Word has length 119 [2021-01-06 18:17:52,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:52,214 INFO L481 AbstractCegarLoop]: Abstraction has 9561 states and 16910 transitions. [2021-01-06 18:17:52,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 18:17:52,214 INFO L276 IsEmpty]: Start isEmpty. Operand 9561 states and 16910 transitions. [2021-01-06 18:17:52,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-01-06 18:17:52,218 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:52,218 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, 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:17:52,218 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-01-06 18:17:52,218 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:17:52,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:52,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1415770589, now seen corresponding path program 1 times [2021-01-06 18:17:52,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:52,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997606545] [2021-01-06 18:17:52,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:52,315 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:17:52,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997606545] [2021-01-06 18:17:52,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:52,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:17:52,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822140537] [2021-01-06 18:17:52,316 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:17:52,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:52,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:17:52,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:17:52,317 INFO L87 Difference]: Start difference. First operand 9561 states and 16910 transitions. Second operand 5 states. [2021-01-06 18:17:56,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:17:56,020 INFO L93 Difference]: Finished difference Result 47660 states and 85883 transitions. [2021-01-06 18:17:56,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 18:17:56,020 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2021-01-06 18:17:56,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:17:56,079 INFO L225 Difference]: With dead ends: 47660 [2021-01-06 18:17:56,079 INFO L226 Difference]: Without dead ends: 39848 [2021-01-06 18:17:56,094 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:17:56,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39848 states. [2021-01-06 18:17:57,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39848 to 18469. [2021-01-06 18:17:57,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18469 states. [2021-01-06 18:17:57,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18469 states to 18469 states and 32795 transitions. [2021-01-06 18:17:57,645 INFO L78 Accepts]: Start accepts. Automaton has 18469 states and 32795 transitions. Word has length 135 [2021-01-06 18:17:57,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:17:57,645 INFO L481 AbstractCegarLoop]: Abstraction has 18469 states and 32795 transitions. [2021-01-06 18:17:57,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:17:57,645 INFO L276 IsEmpty]: Start isEmpty. Operand 18469 states and 32795 transitions. [2021-01-06 18:17:57,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-01-06 18:17:57,651 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:17:57,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:57,651 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-01-06 18:17:57,651 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:17:57,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:17:57,652 INFO L82 PathProgramCache]: Analyzing trace with hash 7146384, now seen corresponding path program 1 times [2021-01-06 18:17:57,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:17:57,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811817717] [2021-01-06 18:17:57,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:17:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:17:57,720 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:17:57,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811817717] [2021-01-06 18:17:57,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:17:57,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:17:57,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725094211] [2021-01-06 18:17:57,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 18:17:57,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:17:57,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 18:17:57,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:17:57,722 INFO L87 Difference]: Start difference. First operand 18469 states and 32795 transitions. Second operand 3 states. [2021-01-06 18:18:00,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:18:00,437 INFO L93 Difference]: Finished difference Result 42958 states and 76182 transitions. [2021-01-06 18:18:00,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 18:18:00,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2021-01-06 18:18:00,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:18:00,470 INFO L225 Difference]: With dead ends: 42958 [2021-01-06 18:18:00,470 INFO L226 Difference]: Without dead ends: 26971 [2021-01-06 18:18:00,479 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:18:00,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26971 states. [2021-01-06 18:18:01,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26971 to 18037. [2021-01-06 18:18:01,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18037 states. [2021-01-06 18:18:01,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18037 states to 18037 states and 31882 transitions. [2021-01-06 18:18:01,847 INFO L78 Accepts]: Start accepts. Automaton has 18037 states and 31882 transitions. Word has length 136 [2021-01-06 18:18:01,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:18:01,847 INFO L481 AbstractCegarLoop]: Abstraction has 18037 states and 31882 transitions. [2021-01-06 18:18:01,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 18:18:01,847 INFO L276 IsEmpty]: Start isEmpty. Operand 18037 states and 31882 transitions. [2021-01-06 18:18:01,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-01-06 18:18:01,854 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:18:01,854 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:01,854 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-01-06 18:18:01,854 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:18:01,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:18:01,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1975806490, now seen corresponding path program 1 times [2021-01-06 18:18:01,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:18:01,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241728548] [2021-01-06 18:18:01,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:18:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:18:02,070 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:18:02,070 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241728548] [2021-01-06 18:18:02,070 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:18:02,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:18:02,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698695511] [2021-01-06 18:18:02,071 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:18:02,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:18:02,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:18:02,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:18:02,072 INFO L87 Difference]: Start difference. First operand 18037 states and 31882 transitions. Second operand 5 states. [2021-01-06 18:18:04,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:18:04,841 INFO L93 Difference]: Finished difference Result 37663 states and 66508 transitions. [2021-01-06 18:18:04,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:18:04,841 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2021-01-06 18:18:04,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:18:04,867 INFO L225 Difference]: With dead ends: 37663 [2021-01-06 18:18:04,868 INFO L226 Difference]: Without dead ends: 20466 [2021-01-06 18:18:04,882 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:18:04,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20466 states. [2021-01-06 18:18:06,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20466 to 18037. [2021-01-06 18:18:06,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18037 states. [2021-01-06 18:18:06,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18037 states to 18037 states and 31482 transitions. [2021-01-06 18:18:06,344 INFO L78 Accepts]: Start accepts. Automaton has 18037 states and 31482 transitions. Word has length 148 [2021-01-06 18:18:06,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:18:06,344 INFO L481 AbstractCegarLoop]: Abstraction has 18037 states and 31482 transitions. [2021-01-06 18:18:06,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:18:06,344 INFO L276 IsEmpty]: Start isEmpty. Operand 18037 states and 31482 transitions. [2021-01-06 18:18:06,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-01-06 18:18:06,350 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:18:06,350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:06,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-01-06 18:18:06,351 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:18:06,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:18:06,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1934975093, now seen corresponding path program 1 times [2021-01-06 18:18:06,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:18:06,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359401289] [2021-01-06 18:18:06,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:18:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:18:06,426 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:18:06,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359401289] [2021-01-06 18:18:06,426 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:18:06,426 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:18:06,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793063004] [2021-01-06 18:18:06,427 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:18:06,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:18:06,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:18:06,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:18:06,428 INFO L87 Difference]: Start difference. First operand 18037 states and 31482 transitions. Second operand 4 states. [2021-01-06 18:18:09,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:18:09,002 INFO L93 Difference]: Finished difference Result 38066 states and 66483 transitions. [2021-01-06 18:18:09,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 18:18:09,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2021-01-06 18:18:09,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:18:09,028 INFO L225 Difference]: With dead ends: 38066 [2021-01-06 18:18:09,028 INFO L226 Difference]: Without dead ends: 20624 [2021-01-06 18:18:09,041 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:18:09,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20624 states. [2021-01-06 18:18:10,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20624 to 18037. [2021-01-06 18:18:10,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18037 states. [2021-01-06 18:18:10,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18037 states to 18037 states and 31097 transitions. [2021-01-06 18:18:10,543 INFO L78 Accepts]: Start accepts. Automaton has 18037 states and 31097 transitions. Word has length 153 [2021-01-06 18:18:10,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:18:10,543 INFO L481 AbstractCegarLoop]: Abstraction has 18037 states and 31097 transitions. [2021-01-06 18:18:10,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:18:10,543 INFO L276 IsEmpty]: Start isEmpty. Operand 18037 states and 31097 transitions. [2021-01-06 18:18:10,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-01-06 18:18:10,550 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:18:10,550 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:10,550 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-01-06 18:18:10,550 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:18:10,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:18:10,550 INFO L82 PathProgramCache]: Analyzing trace with hash 270146209, now seen corresponding path program 1 times [2021-01-06 18:18:10,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:18:10,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343076596] [2021-01-06 18:18:10,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:18:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:18:10,624 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:18:10,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343076596] [2021-01-06 18:18:10,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:18:10,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 18:18:10,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484404223] [2021-01-06 18:18:10,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 18:18:10,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:18:10,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 18:18:10,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:18:10,626 INFO L87 Difference]: Start difference. First operand 18037 states and 31097 transitions. Second operand 3 states. [2021-01-06 18:18:13,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:18:13,942 INFO L93 Difference]: Finished difference Result 47424 states and 81623 transitions. [2021-01-06 18:18:13,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 18:18:13,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2021-01-06 18:18:13,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:18:13,986 INFO L225 Difference]: With dead ends: 47424 [2021-01-06 18:18:13,986 INFO L226 Difference]: Without dead ends: 30983 [2021-01-06 18:18:14,001 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:18:14,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30983 states. [2021-01-06 18:18:15,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30983 to 17877. [2021-01-06 18:18:15,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17877 states. [2021-01-06 18:18:15,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17877 states to 17877 states and 30617 transitions. [2021-01-06 18:18:15,581 INFO L78 Accepts]: Start accepts. Automaton has 17877 states and 30617 transitions. Word has length 157 [2021-01-06 18:18:15,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:18:15,581 INFO L481 AbstractCegarLoop]: Abstraction has 17877 states and 30617 transitions. [2021-01-06 18:18:15,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 18:18:15,581 INFO L276 IsEmpty]: Start isEmpty. Operand 17877 states and 30617 transitions. [2021-01-06 18:18:15,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-01-06 18:18:15,588 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:18:15,588 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:15,588 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-01-06 18:18:15,588 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:18:15,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:18:15,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1686162716, now seen corresponding path program 1 times [2021-01-06 18:18:15,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:18:15,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281177434] [2021-01-06 18:18:15,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:18:15,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:18:15,666 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:18:15,667 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281177434] [2021-01-06 18:18:15,667 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:18:15,667 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:18:15,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730045578] [2021-01-06 18:18:15,667 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:18:15,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:18:15,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:18:15,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:18:15,668 INFO L87 Difference]: Start difference. First operand 17877 states and 30617 transitions. Second operand 4 states. [2021-01-06 18:18:20,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:18:20,253 INFO L93 Difference]: Finished difference Result 47208 states and 81358 transitions. [2021-01-06 18:18:20,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:18:20,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2021-01-06 18:18:20,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:18:20,292 INFO L225 Difference]: With dead ends: 47208 [2021-01-06 18:18:20,293 INFO L226 Difference]: Without dead ends: 29620 [2021-01-06 18:18:20,304 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:18:20,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29620 states. [2021-01-06 18:18:21,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29620 to 17877. [2021-01-06 18:18:21,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17877 states. [2021-01-06 18:18:21,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17877 states to 17877 states and 30134 transitions. [2021-01-06 18:18:21,779 INFO L78 Accepts]: Start accepts. Automaton has 17877 states and 30134 transitions. Word has length 158 [2021-01-06 18:18:21,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:18:21,780 INFO L481 AbstractCegarLoop]: Abstraction has 17877 states and 30134 transitions. [2021-01-06 18:18:21,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:18:21,780 INFO L276 IsEmpty]: Start isEmpty. Operand 17877 states and 30134 transitions. [2021-01-06 18:18:21,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-01-06 18:18:21,787 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:18:21,787 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:21,787 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-01-06 18:18:21,787 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:18:21,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:18:21,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1673854823, now seen corresponding path program 1 times [2021-01-06 18:18:21,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:18:21,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539967713] [2021-01-06 18:18:21,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:18:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:18:21,862 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:18:21,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539967713] [2021-01-06 18:18:21,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:18:21,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:18:21,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219970884] [2021-01-06 18:18:21,863 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:18:21,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:18:21,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:18:21,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:18:21,864 INFO L87 Difference]: Start difference. First operand 17877 states and 30134 transitions. Second operand 4 states. [2021-01-06 18:18:26,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:18:26,127 INFO L93 Difference]: Finished difference Result 45322 states and 76661 transitions. [2021-01-06 18:18:26,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:18:26,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2021-01-06 18:18:26,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:18:26,158 INFO L225 Difference]: With dead ends: 45322 [2021-01-06 18:18:26,158 INFO L226 Difference]: Without dead ends: 27710 [2021-01-06 18:18:26,168 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:18:26,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27710 states. [2021-01-06 18:18:27,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27710 to 17877. [2021-01-06 18:18:27,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17877 states. [2021-01-06 18:18:27,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17877 states to 17877 states and 29571 transitions. [2021-01-06 18:18:27,655 INFO L78 Accepts]: Start accepts. Automaton has 17877 states and 29571 transitions. Word has length 160 [2021-01-06 18:18:27,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:18:27,655 INFO L481 AbstractCegarLoop]: Abstraction has 17877 states and 29571 transitions. [2021-01-06 18:18:27,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:18:27,656 INFO L276 IsEmpty]: Start isEmpty. Operand 17877 states and 29571 transitions. [2021-01-06 18:18:27,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-01-06 18:18:27,664 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:18:27,665 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:27,665 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-01-06 18:18:27,665 INFO L429 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:18:27,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:18:27,665 INFO L82 PathProgramCache]: Analyzing trace with hash 678126428, now seen corresponding path program 1 times [2021-01-06 18:18:27,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:18:27,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700979569] [2021-01-06 18:18:27,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:18:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:18:27,737 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:18:27,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700979569] [2021-01-06 18:18:27,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:18:27,738 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:18:27,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445446794] [2021-01-06 18:18:27,738 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 18:18:27,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:18:27,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 18:18:27,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:18:27,739 INFO L87 Difference]: Start difference. First operand 17877 states and 29571 transitions. Second operand 4 states. [2021-01-06 18:18:30,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:18:30,421 INFO L93 Difference]: Finished difference Result 37746 states and 62628 transitions. [2021-01-06 18:18:30,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 18:18:30,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2021-01-06 18:18:30,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:18:30,446 INFO L225 Difference]: With dead ends: 37746 [2021-01-06 18:18:30,446 INFO L226 Difference]: Without dead ends: 20464 [2021-01-06 18:18:30,459 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 18:18:30,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20464 states. [2021-01-06 18:18:32,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20464 to 17877. [2021-01-06 18:18:32,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17877 states. [2021-01-06 18:18:32,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17877 states to 17877 states and 29266 transitions. [2021-01-06 18:18:32,118 INFO L78 Accepts]: Start accepts. Automaton has 17877 states and 29266 transitions. Word has length 162 [2021-01-06 18:18:32,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:18:32,119 INFO L481 AbstractCegarLoop]: Abstraction has 17877 states and 29266 transitions. [2021-01-06 18:18:32,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 18:18:32,119 INFO L276 IsEmpty]: Start isEmpty. Operand 17877 states and 29266 transitions. [2021-01-06 18:18:32,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-01-06 18:18:32,127 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:18:32,128 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:32,128 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-01-06 18:18:32,128 INFO L429 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:18:32,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:18:32,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1461322561, now seen corresponding path program 1 times [2021-01-06 18:18:32,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:18:32,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076868326] [2021-01-06 18:18:32,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:18:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:18:32,232 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:18:32,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076868326] [2021-01-06 18:18:32,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:18:32,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:18:32,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57372959] [2021-01-06 18:18:32,233 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:18:32,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:18:32,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:18:32,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:18:32,234 INFO L87 Difference]: Start difference. First operand 17877 states and 29266 transitions. Second operand 5 states. [2021-01-06 18:18:36,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:18:36,914 INFO L93 Difference]: Finished difference Result 49927 states and 81990 transitions. [2021-01-06 18:18:36,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 18:18:36,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 162 [2021-01-06 18:18:36,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:18:36,956 INFO L225 Difference]: With dead ends: 49927 [2021-01-06 18:18:36,956 INFO L226 Difference]: Without dead ends: 32616 [2021-01-06 18:18:36,967 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 18:18:36,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32616 states. [2021-01-06 18:18:38,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32616 to 16673. [2021-01-06 18:18:38,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16673 states. [2021-01-06 18:18:38,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16673 states to 16673 states and 27573 transitions. [2021-01-06 18:18:38,605 INFO L78 Accepts]: Start accepts. Automaton has 16673 states and 27573 transitions. Word has length 162 [2021-01-06 18:18:38,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:18:38,605 INFO L481 AbstractCegarLoop]: Abstraction has 16673 states and 27573 transitions. [2021-01-06 18:18:38,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:18:38,605 INFO L276 IsEmpty]: Start isEmpty. Operand 16673 states and 27573 transitions. [2021-01-06 18:18:38,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-01-06 18:18:38,610 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:18:38,610 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:38,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-01-06 18:18:38,611 INFO L429 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:18:38,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:18:38,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1750741271, now seen corresponding path program 1 times [2021-01-06 18:18:38,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:18:38,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616087984] [2021-01-06 18:18:38,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:18:38,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:18:38,712 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:18:38,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616087984] [2021-01-06 18:18:38,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:18:38,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 18:18:38,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228177252] [2021-01-06 18:18:38,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:18:38,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:18:38,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:18:38,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:18:38,714 INFO L87 Difference]: Start difference. First operand 16673 states and 27573 transitions. Second operand 5 states. [2021-01-06 18:18:44,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:18:44,241 INFO L93 Difference]: Finished difference Result 51162 states and 83892 transitions. [2021-01-06 18:18:44,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 18:18:44,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 163 [2021-01-06 18:18:44,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:18:44,304 INFO L225 Difference]: With dead ends: 51162 [2021-01-06 18:18:44,307 INFO L226 Difference]: Without dead ends: 36589 [2021-01-06 18:18:44,409 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:18:44,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36589 states. [2021-01-06 18:18:46,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36589 to 16641. [2021-01-06 18:18:46,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16641 states. [2021-01-06 18:18:46,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16641 states to 16641 states and 27501 transitions. [2021-01-06 18:18:46,380 INFO L78 Accepts]: Start accepts. Automaton has 16641 states and 27501 transitions. Word has length 163 [2021-01-06 18:18:46,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:18:46,381 INFO L481 AbstractCegarLoop]: Abstraction has 16641 states and 27501 transitions. [2021-01-06 18:18:46,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:18:46,381 INFO L276 IsEmpty]: Start isEmpty. Operand 16641 states and 27501 transitions. [2021-01-06 18:18:46,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2021-01-06 18:18:46,387 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:18:46,387 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:46,387 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-01-06 18:18:46,387 INFO L429 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:18:46,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:18:46,388 INFO L82 PathProgramCache]: Analyzing trace with hash 433510570, now seen corresponding path program 1 times [2021-01-06 18:18:46,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:18:46,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960283890] [2021-01-06 18:18:46,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:18:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:18:46,503 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:18:46,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960283890] [2021-01-06 18:18:46,504 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:18:46,504 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 18:18:46,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999581890] [2021-01-06 18:18:46,504 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 18:18:46,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:18:46,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 18:18:46,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:18:46,505 INFO L87 Difference]: Start difference. First operand 16641 states and 27501 transitions. Second operand 6 states. [2021-01-06 18:18:51,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:18:51,798 INFO L93 Difference]: Finished difference Result 48514 states and 80471 transitions. [2021-01-06 18:18:51,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 18:18:51,799 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 168 [2021-01-06 18:18:51,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:18:51,842 INFO L225 Difference]: With dead ends: 48514 [2021-01-06 18:18:51,842 INFO L226 Difference]: Without dead ends: 33687 [2021-01-06 18:18:51,853 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-01-06 18:18:51,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33687 states. [2021-01-06 18:18:54,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33687 to 23105. [2021-01-06 18:18:54,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23105 states. [2021-01-06 18:18:54,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23105 states to 23105 states and 38166 transitions. [2021-01-06 18:18:54,484 INFO L78 Accepts]: Start accepts. Automaton has 23105 states and 38166 transitions. Word has length 168 [2021-01-06 18:18:54,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:18:54,484 INFO L481 AbstractCegarLoop]: Abstraction has 23105 states and 38166 transitions. [2021-01-06 18:18:54,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 18:18:54,484 INFO L276 IsEmpty]: Start isEmpty. Operand 23105 states and 38166 transitions. [2021-01-06 18:18:54,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2021-01-06 18:18:54,493 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:18:54,493 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:54,493 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-01-06 18:18:54,493 INFO L429 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:18:54,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:18:54,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1568700648, now seen corresponding path program 1 times [2021-01-06 18:18:54,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:18:54,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988194640] [2021-01-06 18:18:54,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:18:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:18:54,575 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:18:54,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988194640] [2021-01-06 18:18:54,576 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:18:54,576 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 18:18:54,576 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150332002] [2021-01-06 18:18:54,576 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 18:18:54,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:18:54,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 18:18:54,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 18:18:54,577 INFO L87 Difference]: Start difference. First operand 23105 states and 38166 transitions. Second operand 3 states. [2021-01-06 18:18:56,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:18:56,635 INFO L93 Difference]: Finished difference Result 38451 states and 63700 transitions. [2021-01-06 18:18:56,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 18:18:56,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2021-01-06 18:18:56,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:18:56,658 INFO L225 Difference]: With dead ends: 38451 [2021-01-06 18:18:56,658 INFO L226 Difference]: Without dead ends: 20243 [2021-01-06 18:18:56,668 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:18:56,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20243 states. [2021-01-06 18:18:58,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20243 to 20230. [2021-01-06 18:18:58,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20230 states. [2021-01-06 18:18:58,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20230 states to 20230 states and 33970 transitions. [2021-01-06 18:18:58,710 INFO L78 Accepts]: Start accepts. Automaton has 20230 states and 33970 transitions. Word has length 168 [2021-01-06 18:18:58,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:18:58,710 INFO L481 AbstractCegarLoop]: Abstraction has 20230 states and 33970 transitions. [2021-01-06 18:18:58,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 18:18:58,710 INFO L276 IsEmpty]: Start isEmpty. Operand 20230 states and 33970 transitions. [2021-01-06 18:18:58,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-01-06 18:18:58,718 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:18:58,718 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:58,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-01-06 18:18:58,718 INFO L429 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 18:18:58,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:18:58,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1207726500, now seen corresponding path program 1 times [2021-01-06 18:18:58,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:18:58,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784636451] [2021-01-06 18:18:58,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:18:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:18:58,933 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:18:58,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784636451] [2021-01-06 18:18:58,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:18:58,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:18:58,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203006023] [2021-01-06 18:18:58,934 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:18:58,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:18:58,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:18:58,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:18:58,934 INFO L87 Difference]: Start difference. First operand 20230 states and 33970 transitions. Second operand 5 states. [2021-01-06 18:19:02,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:02,386 INFO L93 Difference]: Finished difference Result 55762 states and 93434 transitions. [2021-01-06 18:19:02,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:19:02,386 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2021-01-06 18:19:02,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:02,521 INFO L225 Difference]: With dead ends: 55762 [2021-01-06 18:19:02,521 INFO L226 Difference]: Without dead ends: 40385 [2021-01-06 18:19:02,534 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:19:02,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40385 states. [2021-01-06 18:19:06,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40385 to 40385. [2021-01-06 18:19:06,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40385 states. [2021-01-06 18:19:06,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40385 states to 40385 states and 67835 transitions. [2021-01-06 18:19:06,203 INFO L78 Accepts]: Start accepts. Automaton has 40385 states and 67835 transitions. Word has length 169 [2021-01-06 18:19:06,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:06,203 INFO L481 AbstractCegarLoop]: Abstraction has 40385 states and 67835 transitions. [2021-01-06 18:19:06,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:19:06,203 INFO L276 IsEmpty]: Start isEmpty. Operand 40385 states and 67835 transitions. [2021-01-06 18:19:06,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-01-06 18:19:06,225 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:06,226 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,226 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-01-06 18:19:06,226 INFO L429 AbstractCegarLoop]: === Iteration 50 === [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:06,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:06,382 INFO L82 PathProgramCache]: Analyzing trace with hash 847639701, now seen corresponding path program 1 times [2021-01-06 18:19:06,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:06,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823338163] [2021-01-06 18:19:06,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:06,516 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:19:06,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823338163] [2021-01-06 18:19:06,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:06,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 18:19:06,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278016133] [2021-01-06 18:19:06,517 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 18:19:06,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:06,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 18:19:06,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:19:06,518 INFO L87 Difference]: Start difference. First operand 40385 states and 67835 transitions. Second operand 6 states. [2021-01-06 18:19:14,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:14,671 INFO L93 Difference]: Finished difference Result 106897 states and 179247 transitions. [2021-01-06 18:19:14,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 18:19:14,671 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 169 [2021-01-06 18:19:14,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:14,765 INFO L225 Difference]: With dead ends: 106897 [2021-01-06 18:19:14,765 INFO L226 Difference]: Without dead ends: 70358 [2021-01-06 18:19:14,788 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:19:14,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70358 states. [2021-01-06 18:19:19,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70358 to 53261. [2021-01-06 18:19:19,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53261 states. [2021-01-06 18:19:19,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53261 states to 53261 states and 89499 transitions. [2021-01-06 18:19:19,690 INFO L78 Accepts]: Start accepts. Automaton has 53261 states and 89499 transitions. Word has length 169 [2021-01-06 18:19:19,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:19,690 INFO L481 AbstractCegarLoop]: Abstraction has 53261 states and 89499 transitions. [2021-01-06 18:19:19,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 18:19:19,690 INFO L276 IsEmpty]: Start isEmpty. Operand 53261 states and 89499 transitions. [2021-01-06 18:19:19,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-01-06 18:19:19,716 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:19,717 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-01-06 18:19:19,717 INFO L429 AbstractCegarLoop]: === Iteration 51 === [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:19,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:19,717 INFO L82 PathProgramCache]: Analyzing trace with hash 83258584, now seen corresponding path program 1 times [2021-01-06 18:19:19,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:19,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815590623] [2021-01-06 18:19:19,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:19,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:19,810 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:19:19,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815590623] [2021-01-06 18:19:19,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:19,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:19:19,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787236828] [2021-01-06 18:19:19,812 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:19:19,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:19,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:19:19,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:19:19,813 INFO L87 Difference]: Start difference. First operand 53261 states and 89499 transitions. Second operand 5 states. [2021-01-06 18:19:32,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:32,185 INFO L93 Difference]: Finished difference Result 196037 states and 328907 transitions. [2021-01-06 18:19:32,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 18:19:32,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 170 [2021-01-06 18:19:32,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:32,631 INFO L225 Difference]: With dead ends: 196037 [2021-01-06 18:19:32,631 INFO L226 Difference]: Without dead ends: 152502 [2021-01-06 18:19:32,678 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:32,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152502 states. [2021-01-06 18:19:38,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152502 to 53261. [2021-01-06 18:19:38,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53261 states. [2021-01-06 18:19:38,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53261 states to 53261 states and 89479 transitions. [2021-01-06 18:19:38,220 INFO L78 Accepts]: Start accepts. Automaton has 53261 states and 89479 transitions. Word has length 170 [2021-01-06 18:19:38,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:38,220 INFO L481 AbstractCegarLoop]: Abstraction has 53261 states and 89479 transitions. [2021-01-06 18:19:38,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:19:38,221 INFO L276 IsEmpty]: Start isEmpty. Operand 53261 states and 89479 transitions. [2021-01-06 18:19:38,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-01-06 18:19:38,241 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:38,241 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-01-06 18:19:38,242 INFO L429 AbstractCegarLoop]: === Iteration 52 === [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,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:38,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1781331203, now seen corresponding path program 1 times [2021-01-06 18:19:38,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:38,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455308760] [2021-01-06 18:19:38,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:38,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:38,355 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:19:38,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455308760] [2021-01-06 18:19:38,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:38,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 18:19:38,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211491722] [2021-01-06 18:19:38,357 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 18:19:38,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:38,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 18:19:38,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 18:19:38,357 INFO L87 Difference]: Start difference. First operand 53261 states and 89479 transitions. Second operand 5 states. [2021-01-06 18:19:47,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:19:47,788 INFO L93 Difference]: Finished difference Result 149979 states and 251574 transitions. [2021-01-06 18:19:47,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 18:19:47,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 170 [2021-01-06 18:19:47,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:19:47,962 INFO L225 Difference]: With dead ends: 149979 [2021-01-06 18:19:47,962 INFO L226 Difference]: Without dead ends: 106392 [2021-01-06 18:19:48,008 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:19:48,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106392 states. [2021-01-06 18:19:57,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106392 to 106388. [2021-01-06 18:19:57,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106388 states. [2021-01-06 18:19:57,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106388 states to 106388 states and 178764 transitions. [2021-01-06 18:19:57,826 INFO L78 Accepts]: Start accepts. Automaton has 106388 states and 178764 transitions. Word has length 170 [2021-01-06 18:19:57,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:19:57,826 INFO L481 AbstractCegarLoop]: Abstraction has 106388 states and 178764 transitions. [2021-01-06 18:19:57,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 18:19:57,826 INFO L276 IsEmpty]: Start isEmpty. Operand 106388 states and 178764 transitions. [2021-01-06 18:19:58,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-01-06 18:19:58,115 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:19:58,115 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,116 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-01-06 18:19:58,116 INFO L429 AbstractCegarLoop]: === Iteration 53 === [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:58,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:19:58,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1085735748, now seen corresponding path program 1 times [2021-01-06 18:19:58,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:19:58,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553474922] [2021-01-06 18:19:58,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:19:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:19:58,219 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:19:58,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553474922] [2021-01-06 18:19:58,219 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:19:58,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 18:19:58,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885027896] [2021-01-06 18:19:58,220 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 18:19:58,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:19:58,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 18:19:58,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:19:58,221 INFO L87 Difference]: Start difference. First operand 106388 states and 178764 transitions. Second operand 6 states. [2021-01-06 18:20:15,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 18:20:15,471 INFO L93 Difference]: Finished difference Result 265100 states and 444436 transitions. [2021-01-06 18:20:15,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 18:20:15,471 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 170 [2021-01-06 18:20:15,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 18:20:15,798 INFO L225 Difference]: With dead ends: 265100 [2021-01-06 18:20:15,798 INFO L226 Difference]: Without dead ends: 166338 [2021-01-06 18:20:15,873 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-01-06 18:20:16,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166338 states. [2021-01-06 18:20:28,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166338 to 136583. [2021-01-06 18:20:28,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136583 states. [2021-01-06 18:20:29,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136583 states to 136583 states and 228463 transitions. [2021-01-06 18:20:29,347 INFO L78 Accepts]: Start accepts. Automaton has 136583 states and 228463 transitions. Word has length 170 [2021-01-06 18:20:29,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 18:20:29,349 INFO L481 AbstractCegarLoop]: Abstraction has 136583 states and 228463 transitions. [2021-01-06 18:20:29,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 18:20:29,349 INFO L276 IsEmpty]: Start isEmpty. Operand 136583 states and 228463 transitions. [2021-01-06 18:20:29,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-01-06 18:20:29,394 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 18:20:29,395 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,395 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-01-06 18:20:29,395 INFO L429 AbstractCegarLoop]: === Iteration 54 === [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:29,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 18:20:29,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1442742321, now seen corresponding path program 1 times [2021-01-06 18:20:29,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 18:20:29,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476534071] [2021-01-06 18:20:29,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 18:20:29,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 18:20:29,494 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:29,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476534071] [2021-01-06 18:20:29,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 18:20:29,495 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 18:20:29,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054265734] [2021-01-06 18:20:29,497 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 18:20:29,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 18:20:29,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 18:20:29,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 18:20:29,498 INFO L87 Difference]: Start difference. First operand 136583 states and 228463 transitions. Second operand 6 states.