/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_product27.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 08:24:58,263 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 08:24:58,266 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 08:24:58,300 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 08:24:58,300 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 08:24:58,302 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 08:24:58,304 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 08:24:58,321 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 08:24:58,325 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 08:24:58,331 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 08:24:58,335 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 08:24:58,337 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 08:24:58,338 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 08:24:58,341 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 08:24:58,343 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 08:24:58,344 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 08:24:58,345 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 08:24:58,346 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 08:24:58,353 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 08:24:58,362 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 08:24:58,364 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 08:24:58,366 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 08:24:58,368 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 08:24:58,370 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 08:24:58,374 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 08:24:58,374 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 08:24:58,375 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 08:24:58,382 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 08:24:58,382 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 08:24:58,384 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 08:24:58,384 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 08:24:58,385 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 08:24:58,386 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 08:24:58,387 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 08:24:58,388 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 08:24:58,389 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 08:24:58,389 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 08:24:58,393 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 08:24:58,393 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 08:24:58,394 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 08:24:58,395 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 08:24:58,396 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 08:24:58,442 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 08:24:58,442 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 08:24:58,444 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 08:24:58,444 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 08:24:58,444 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 08:24:58,445 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 08:24:58,445 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 08:24:58,445 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 08:24:58,445 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 08:24:58,445 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 08:24:58,446 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 08:24:58,446 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 08:24:58,446 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 08:24:58,446 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 08:24:58,446 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 08:24:58,447 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 08:24:58,447 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 08:24:58,447 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 08:24:58,447 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 08:24:58,447 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 08:24:58,448 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 08:24:58,448 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 08:24:58,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 08:24:58,448 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 08:24:58,448 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 08:24:58,448 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 [2020-12-23 08:24:58,830 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 08:24:58,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 08:24:58,859 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 08:24:58,861 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 08:24:58,862 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 08:24:58,863 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec1_product27.cil.c [2020-12-23 08:24:58,937 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/974891007/d0b6eb91d77943e3bf5f0869123b67a5/FLAGe6a5ebc7b [2020-12-23 08:24:59,808 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 08:24:59,808 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec1_product27.cil.c [2020-12-23 08:24:59,835 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/974891007/d0b6eb91d77943e3bf5f0869123b67a5/FLAGe6a5ebc7b [2020-12-23 08:24:59,951 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/974891007/d0b6eb91d77943e3bf5f0869123b67a5 [2020-12-23 08:24:59,954 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 08:24:59,957 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 08:24:59,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 08:24:59,962 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 08:24:59,966 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 08:24:59,967 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 08:24:59" (1/1) ... [2020-12-23 08:24:59,970 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@676db734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:24:59, skipping insertion in model container [2020-12-23 08:24:59,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 08:24:59" (1/1) ... [2020-12-23 08:24:59,980 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 08:25:00,076 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~nd~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~maxLength~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~action~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~origin~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~calls_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~calls_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__utac__ad__arg1~0,] left hand side expression in assignment: lhs: VariableLHS[~calls_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~9,] left hand side expression in assignment: lhs: VariableLHS[~excep~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] 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~10,] 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~11,] 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~10,] 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~10,] left hand side expression in assignment: lhs: VariableLHS[~mem_24~0,] 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[~__cil_tmp4~1,] 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~11,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~2,] 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~12,] [2020-12-23 08:25:00,659 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_product27.cil.c[35091,35104] 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~12,] left hand side expression in assignment: lhs: VariableLHS[~floor~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~currentFloorID~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentFloorID~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~persons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~weight~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~weight~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~17,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] 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~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~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[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] 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~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~tmp~24,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] 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[~tmp___0~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp~25,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~2,] left hand side expression in assignment: lhs: VariableLHS[~doorState~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~26,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~3,] left hand side expression in assignment: lhs: VariableLHS[~doorState~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~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~27,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp21~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~12,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp22~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~8,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp24~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp25~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp26~0,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~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[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~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[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~29,] [2020-12-23 08:25:00,918 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 08:25:00,939 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~nd~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~maxLength~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] 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~1,] left hand side expression in assignment: lhs: VariableLHS[~action~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~origin~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~6,] left hand side expression in assignment: lhs: VariableLHS[~calls_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~7,] left hand side expression in assignment: lhs: VariableLHS[~calls_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__utac__ad__arg1~0,] left hand side expression in assignment: lhs: VariableLHS[~calls_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~calls_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~8,] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_0_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_2_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_3_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_4_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~personOnFloor_5_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~9,] left hand side expression in assignment: lhs: VariableLHS[~excep~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] 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~10,] 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~11,] 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~10,] 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~10,] left hand side expression in assignment: lhs: VariableLHS[~mem_24~0,] 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[~__cil_tmp4~1,] 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~11,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp4~2,] 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~12,] [2020-12-23 08:25:01,075 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_product27.cil.c[35091,35104] 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~12,] left hand side expression in assignment: lhs: VariableLHS[~floor~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~landingButtons_spc1_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~currentFloorID~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentFloorID~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~13,] left hand side expression in assignment: lhs: VariableLHS[~persons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~weight~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~persons_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~weight~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~floorButtons_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~14,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~15,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~16,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~17,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~19,] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~20,] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~1,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~2,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~5,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] 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~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~22,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~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[~currentHeading~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] 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~8,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~24,] left hand side expression in assignment: lhs: VariableLHS[~tmp~24,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] 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[~tmp___0~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp~25,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~2,] left hand side expression in assignment: lhs: VariableLHS[~doorState~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~26,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~3,] left hand side expression in assignment: lhs: VariableLHS[~doorState~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~2,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp6~4,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp7~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~27,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp21~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~12,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp22~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~8,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp23~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~6,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp24~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~5,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp25~0,] left hand side expression in assignment: lhs: VariableLHS[~__cil_tmp26~0,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~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[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~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[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~i___0~0,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~27,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~28,] left hand side expression in assignment: lhs: VariableLHS[~retValue_acc~29,] [2020-12-23 08:25:01,143 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 08:25:01,224 INFO L208 MainTranslator]: Completed translation [2020-12-23 08:25:01,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:25:01 WrapperNode [2020-12-23 08:25:01,225 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 08:25:01,226 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 08:25:01,227 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 08:25:01,228 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 08:25:01,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:25:01" (1/1) ... [2020-12-23 08:25:01,271 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:25:01" (1/1) ... [2020-12-23 08:25:01,493 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 08:25:01,494 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 08:25:01,495 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 08:25:01,495 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 08:25:01,505 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:25:01" (1/1) ... [2020-12-23 08:25:01,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:25:01" (1/1) ... [2020-12-23 08:25:01,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:25:01" (1/1) ... [2020-12-23 08:25:01,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:25:01" (1/1) ... [2020-12-23 08:25:01,608 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:25:01" (1/1) ... [2020-12-23 08:25:01,664 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:25:01" (1/1) ... [2020-12-23 08:25:01,682 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:25:01" (1/1) ... [2020-12-23 08:25:01,710 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 08:25:01,711 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 08:25:01,711 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 08:25:01,711 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 08:25:01,712 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:25:01" (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 [2020-12-23 08:25:01,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 08:25:01,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 08:25:01,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 08:25:01,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 08:25:08,096 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 08:25:08,097 INFO L299 CfgBuilder]: Removed 649 assume(true) statements. [2020-12-23 08:25:08,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 08:25:08 BoogieIcfgContainer [2020-12-23 08:25:08,102 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 08:25:08,104 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 08:25:08,104 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 08:25:08,108 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 08:25:08,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 08:24:59" (1/3) ... [2020-12-23 08:25:08,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c514ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 08:25:08, skipping insertion in model container [2020-12-23 08:25:08,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:25:01" (2/3) ... [2020-12-23 08:25:08,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c514ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 08:25:08, skipping insertion in model container [2020-12-23 08:25:08,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 08:25:08" (3/3) ... [2020-12-23 08:25:08,111 INFO L111 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product27.cil.c [2020-12-23 08:25:08,119 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 08:25:08,125 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2020-12-23 08:25:08,145 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-12-23 08:25:08,185 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 08:25:08,185 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 08:25:08,185 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 08:25:08,186 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 08:25:08,186 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 08:25:08,186 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 08:25:08,186 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 08:25:08,186 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 08:25:08,243 INFO L276 IsEmpty]: Start isEmpty. Operand 2603 states. [2020-12-23 08:25:08,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-12-23 08:25:08,266 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:25:08,267 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] [2020-12-23 08:25:08,268 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]=== [2020-12-23 08:25:08,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:25:08,274 INFO L82 PathProgramCache]: Analyzing trace with hash 548572505, now seen corresponding path program 1 times [2020-12-23 08:25:08,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:25:08,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719914069] [2020-12-23 08:25:08,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:25:08,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:25:08,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:25:08,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719914069] [2020-12-23 08:25:08,773 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:25:08,773 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:25:08,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284751720] [2020-12-23 08:25:08,779 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 08:25:08,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:25:08,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 08:25:08,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 08:25:08,797 INFO L87 Difference]: Start difference. First operand 2603 states. Second operand 3 states. [2020-12-23 08:25:09,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:25:09,091 INFO L93 Difference]: Finished difference Result 7729 states and 14513 transitions. [2020-12-23 08:25:09,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 08:25:09,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-12-23 08:25:09,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:25:09,158 INFO L225 Difference]: With dead ends: 7729 [2020-12-23 08:25:09,159 INFO L226 Difference]: Without dead ends: 5131 [2020-12-23 08:25:09,174 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 [2020-12-23 08:25:09,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5131 states. [2020-12-23 08:25:09,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5131 to 2599. [2020-12-23 08:25:09,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2599 states. [2020-12-23 08:25:09,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2599 states to 2599 states and 4868 transitions. [2020-12-23 08:25:09,382 INFO L78 Accepts]: Start accepts. Automaton has 2599 states and 4868 transitions. Word has length 53 [2020-12-23 08:25:09,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:25:09,382 INFO L481 AbstractCegarLoop]: Abstraction has 2599 states and 4868 transitions. [2020-12-23 08:25:09,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 08:25:09,382 INFO L276 IsEmpty]: Start isEmpty. Operand 2599 states and 4868 transitions. [2020-12-23 08:25:09,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-12-23 08:25:09,389 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:25:09,389 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] [2020-12-23 08:25:09,390 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 08:25:09,391 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]=== [2020-12-23 08:25:09,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:25:09,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1724451506, now seen corresponding path program 1 times [2020-12-23 08:25:09,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:25:09,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011622132] [2020-12-23 08:25:09,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:25:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:25:09,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:25:09,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011622132] [2020-12-23 08:25:09,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:25:09,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 08:25:09,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748287720] [2020-12-23 08:25:09,648 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 08:25:09,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:25:09,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 08:25:09,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 08:25:09,649 INFO L87 Difference]: Start difference. First operand 2599 states and 4868 transitions. Second operand 6 states. [2020-12-23 08:25:10,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:25:10,307 INFO L93 Difference]: Finished difference Result 10171 states and 19069 transitions. [2020-12-23 08:25:10,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 08:25:10,307 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2020-12-23 08:25:10,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:25:10,358 INFO L225 Difference]: With dead ends: 10171 [2020-12-23 08:25:10,359 INFO L226 Difference]: Without dead ends: 7615 [2020-12-23 08:25:10,372 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-12-23 08:25:10,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7615 states. [2020-12-23 08:25:10,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7615 to 2595. [2020-12-23 08:25:10,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2595 states. [2020-12-23 08:25:10,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2595 states and 4857 transitions. [2020-12-23 08:25:10,526 INFO L78 Accepts]: Start accepts. Automaton has 2595 states and 4857 transitions. Word has length 60 [2020-12-23 08:25:10,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:25:10,527 INFO L481 AbstractCegarLoop]: Abstraction has 2595 states and 4857 transitions. [2020-12-23 08:25:10,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 08:25:10,527 INFO L276 IsEmpty]: Start isEmpty. Operand 2595 states and 4857 transitions. [2020-12-23 08:25:10,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-12-23 08:25:10,531 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:25:10,531 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] [2020-12-23 08:25:10,531 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 08:25:10,532 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]=== [2020-12-23 08:25:10,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:25:10,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1587010107, now seen corresponding path program 1 times [2020-12-23 08:25:10,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:25:10,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242335752] [2020-12-23 08:25:10,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:25:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:25:10,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:25:10,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242335752] [2020-12-23 08:25:10,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:25:10,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:25:10,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102671112] [2020-12-23 08:25:10,689 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:25:10,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:25:10,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:25:10,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:25:10,690 INFO L87 Difference]: Start difference. First operand 2595 states and 4857 transitions. Second operand 4 states. [2020-12-23 08:25:11,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:25:11,170 INFO L93 Difference]: Finished difference Result 7673 states and 14380 transitions. [2020-12-23 08:25:11,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:25:11,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2020-12-23 08:25:11,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:25:11,202 INFO L225 Difference]: With dead ends: 7673 [2020-12-23 08:25:11,202 INFO L226 Difference]: Without dead ends: 5121 [2020-12-23 08:25:11,210 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 [2020-12-23 08:25:11,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5121 states. [2020-12-23 08:25:11,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5121 to 2595. [2020-12-23 08:25:11,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2595 states. [2020-12-23 08:25:11,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2595 states and 4848 transitions. [2020-12-23 08:25:11,504 INFO L78 Accepts]: Start accepts. Automaton has 2595 states and 4848 transitions. Word has length 62 [2020-12-23 08:25:11,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:25:11,512 INFO L481 AbstractCegarLoop]: Abstraction has 2595 states and 4848 transitions. [2020-12-23 08:25:11,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:25:11,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2595 states and 4848 transitions. [2020-12-23 08:25:11,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-12-23 08:25:11,519 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:25:11,519 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] [2020-12-23 08:25:11,519 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 08:25:11,519 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]=== [2020-12-23 08:25:11,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:25:11,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1608465768, now seen corresponding path program 1 times [2020-12-23 08:25:11,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:25:11,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768475098] [2020-12-23 08:25:11,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:25:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:25:11,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:25:11,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768475098] [2020-12-23 08:25:11,638 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:25:11,639 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:25:11,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340411423] [2020-12-23 08:25:11,640 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:25:11,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:25:11,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:25:11,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:25:11,642 INFO L87 Difference]: Start difference. First operand 2595 states and 4848 transitions. Second operand 4 states. [2020-12-23 08:25:12,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:25:12,106 INFO L93 Difference]: Finished difference Result 7673 states and 14362 transitions. [2020-12-23 08:25:12,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:25:12,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2020-12-23 08:25:12,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:25:12,158 INFO L225 Difference]: With dead ends: 7673 [2020-12-23 08:25:12,158 INFO L226 Difference]: Without dead ends: 5121 [2020-12-23 08:25:12,167 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 [2020-12-23 08:25:12,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5121 states. [2020-12-23 08:25:12,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5121 to 2595. [2020-12-23 08:25:12,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2595 states. [2020-12-23 08:25:12,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2595 states and 4839 transitions. [2020-12-23 08:25:12,297 INFO L78 Accepts]: Start accepts. Automaton has 2595 states and 4839 transitions. Word has length 64 [2020-12-23 08:25:12,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:25:12,300 INFO L481 AbstractCegarLoop]: Abstraction has 2595 states and 4839 transitions. [2020-12-23 08:25:12,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:25:12,300 INFO L276 IsEmpty]: Start isEmpty. Operand 2595 states and 4839 transitions. [2020-12-23 08:25:12,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-23 08:25:12,304 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:25:12,304 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] [2020-12-23 08:25:12,304 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 08:25:12,305 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]=== [2020-12-23 08:25:12,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:25:12,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1164857915, now seen corresponding path program 1 times [2020-12-23 08:25:12,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:25:12,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325828678] [2020-12-23 08:25:12,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:25:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:25:12,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:25:12,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325828678] [2020-12-23 08:25:12,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:25:12,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:25:12,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139579410] [2020-12-23 08:25:12,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:25:12,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:25:12,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:25:12,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:25:12,408 INFO L87 Difference]: Start difference. First operand 2595 states and 4839 transitions. Second operand 4 states. [2020-12-23 08:25:13,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:25:13,169 INFO L93 Difference]: Finished difference Result 12665 states and 23702 transitions. [2020-12-23 08:25:13,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:25:13,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2020-12-23 08:25:13,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:25:13,199 INFO L225 Difference]: With dead ends: 12665 [2020-12-23 08:25:13,199 INFO L226 Difference]: Without dead ends: 10113 [2020-12-23 08:25:13,207 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 [2020-12-23 08:25:13,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10113 states. [2020-12-23 08:25:13,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10113 to 2595. [2020-12-23 08:25:13,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2595 states. [2020-12-23 08:25:13,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2595 states and 4835 transitions. [2020-12-23 08:25:13,393 INFO L78 Accepts]: Start accepts. Automaton has 2595 states and 4835 transitions. Word has length 66 [2020-12-23 08:25:13,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:25:13,394 INFO L481 AbstractCegarLoop]: Abstraction has 2595 states and 4835 transitions. [2020-12-23 08:25:13,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:25:13,394 INFO L276 IsEmpty]: Start isEmpty. Operand 2595 states and 4835 transitions. [2020-12-23 08:25:13,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-23 08:25:13,397 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:25:13,397 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] [2020-12-23 08:25:13,397 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 08:25:13,399 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]=== [2020-12-23 08:25:13,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:25:13,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1823792827, now seen corresponding path program 1 times [2020-12-23 08:25:13,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:25:13,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448618407] [2020-12-23 08:25:13,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:25:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:25:13,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:25:13,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448618407] [2020-12-23 08:25:13,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:25:13,506 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:25:13,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839292901] [2020-12-23 08:25:13,507 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:25:13,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:25:13,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:25:13,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:25:13,508 INFO L87 Difference]: Start difference. First operand 2595 states and 4835 transitions. Second operand 4 states. [2020-12-23 08:25:13,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:25:13,983 INFO L93 Difference]: Finished difference Result 10148 states and 18983 transitions. [2020-12-23 08:25:13,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:25:13,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2020-12-23 08:25:13,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:25:14,005 INFO L225 Difference]: With dead ends: 10148 [2020-12-23 08:25:14,006 INFO L226 Difference]: Without dead ends: 7575 [2020-12-23 08:25:14,014 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 [2020-12-23 08:25:14,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7575 states. [2020-12-23 08:25:14,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7575 to 2577. [2020-12-23 08:25:14,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2577 states. [2020-12-23 08:25:14,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2577 states to 2577 states and 4804 transitions. [2020-12-23 08:25:14,204 INFO L78 Accepts]: Start accepts. Automaton has 2577 states and 4804 transitions. Word has length 66 [2020-12-23 08:25:14,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:25:14,204 INFO L481 AbstractCegarLoop]: Abstraction has 2577 states and 4804 transitions. [2020-12-23 08:25:14,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:25:14,205 INFO L276 IsEmpty]: Start isEmpty. Operand 2577 states and 4804 transitions. [2020-12-23 08:25:14,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-12-23 08:25:14,208 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:25:14,208 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] [2020-12-23 08:25:14,208 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 08:25:14,208 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]=== [2020-12-23 08:25:14,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:25:14,215 INFO L82 PathProgramCache]: Analyzing trace with hash 348934464, now seen corresponding path program 1 times [2020-12-23 08:25:14,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:25:14,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142121404] [2020-12-23 08:25:14,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:25:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:25:14,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:25:14,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142121404] [2020-12-23 08:25:14,309 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:25:14,309 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:25:14,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27312099] [2020-12-23 08:25:14,309 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:25:14,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:25:14,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:25:14,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:25:14,311 INFO L87 Difference]: Start difference. First operand 2577 states and 4804 transitions. Second operand 4 states. [2020-12-23 08:25:14,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:25:14,754 INFO L93 Difference]: Finished difference Result 7637 states and 14275 transitions. [2020-12-23 08:25:14,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:25:14,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2020-12-23 08:25:14,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:25:14,771 INFO L225 Difference]: With dead ends: 7637 [2020-12-23 08:25:14,772 INFO L226 Difference]: Without dead ends: 5082 [2020-12-23 08:25:14,778 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 [2020-12-23 08:25:14,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5082 states. [2020-12-23 08:25:14,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5082 to 2577. [2020-12-23 08:25:14,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2577 states. [2020-12-23 08:25:14,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2577 states to 2577 states and 4798 transitions. [2020-12-23 08:25:14,942 INFO L78 Accepts]: Start accepts. Automaton has 2577 states and 4798 transitions. Word has length 67 [2020-12-23 08:25:14,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:25:14,943 INFO L481 AbstractCegarLoop]: Abstraction has 2577 states and 4798 transitions. [2020-12-23 08:25:14,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:25:14,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2577 states and 4798 transitions. [2020-12-23 08:25:14,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-12-23 08:25:14,946 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:25:14,946 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] [2020-12-23 08:25:14,947 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 08:25:14,947 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]=== [2020-12-23 08:25:14,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:25:14,947 INFO L82 PathProgramCache]: Analyzing trace with hash 584795776, now seen corresponding path program 1 times [2020-12-23 08:25:14,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:25:14,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51917528] [2020-12-23 08:25:14,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:25:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:25:15,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:25:15,056 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51917528] [2020-12-23 08:25:15,056 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:25:15,056 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:25:15,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19915634] [2020-12-23 08:25:15,057 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:25:15,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:25:15,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:25:15,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:25:15,058 INFO L87 Difference]: Start difference. First operand 2577 states and 4798 transitions. Second operand 4 states. [2020-12-23 08:25:15,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:25:15,495 INFO L93 Difference]: Finished difference Result 7637 states and 14263 transitions. [2020-12-23 08:25:15,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:25:15,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2020-12-23 08:25:15,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:25:15,511 INFO L225 Difference]: With dead ends: 7637 [2020-12-23 08:25:15,512 INFO L226 Difference]: Without dead ends: 5082 [2020-12-23 08:25:15,517 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 [2020-12-23 08:25:15,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5082 states. [2020-12-23 08:25:15,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5082 to 2577. [2020-12-23 08:25:15,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2577 states. [2020-12-23 08:25:15,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2577 states to 2577 states and 4792 transitions. [2020-12-23 08:25:15,646 INFO L78 Accepts]: Start accepts. Automaton has 2577 states and 4792 transitions. Word has length 68 [2020-12-23 08:25:15,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:25:15,648 INFO L481 AbstractCegarLoop]: Abstraction has 2577 states and 4792 transitions. [2020-12-23 08:25:15,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:25:15,648 INFO L276 IsEmpty]: Start isEmpty. Operand 2577 states and 4792 transitions. [2020-12-23 08:25:15,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-12-23 08:25:15,657 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:25:15,657 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] [2020-12-23 08:25:15,657 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 08:25:15,657 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]=== [2020-12-23 08:25:15,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:25:15,658 INFO L82 PathProgramCache]: Analyzing trace with hash -140500325, now seen corresponding path program 1 times [2020-12-23 08:25:15,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:25:15,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487761542] [2020-12-23 08:25:15,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:25:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:25:15,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:25:15,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487761542] [2020-12-23 08:25:15,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:25:15,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 08:25:15,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386337819] [2020-12-23 08:25:15,754 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 08:25:15,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:25:15,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 08:25:15,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 08:25:15,756 INFO L87 Difference]: Start difference. First operand 2577 states and 4792 transitions. Second operand 7 states. [2020-12-23 08:25:16,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:25:16,631 INFO L93 Difference]: Finished difference Result 12636 states and 23616 transitions. [2020-12-23 08:25:16,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 08:25:16,632 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2020-12-23 08:25:16,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:25:16,668 INFO L225 Difference]: With dead ends: 12636 [2020-12-23 08:25:16,668 INFO L226 Difference]: Without dead ends: 10087 [2020-12-23 08:25:16,678 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 [2020-12-23 08:25:16,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10087 states. [2020-12-23 08:25:16,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10087 to 2579. [2020-12-23 08:25:16,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2579 states. [2020-12-23 08:25:16,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2579 states to 2579 states and 4793 transitions. [2020-12-23 08:25:16,863 INFO L78 Accepts]: Start accepts. Automaton has 2579 states and 4793 transitions. Word has length 69 [2020-12-23 08:25:16,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:25:16,863 INFO L481 AbstractCegarLoop]: Abstraction has 2579 states and 4793 transitions. [2020-12-23 08:25:16,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 08:25:16,864 INFO L276 IsEmpty]: Start isEmpty. Operand 2579 states and 4793 transitions. [2020-12-23 08:25:16,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-12-23 08:25:16,866 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:25:16,867 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] [2020-12-23 08:25:16,867 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 08:25:16,867 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]=== [2020-12-23 08:25:16,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:25:16,868 INFO L82 PathProgramCache]: Analyzing trace with hash -188047530, now seen corresponding path program 1 times [2020-12-23 08:25:16,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:25:16,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458108265] [2020-12-23 08:25:16,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:25:16,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:25:16,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:25:16,961 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458108265] [2020-12-23 08:25:16,961 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:25:16,961 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 08:25:16,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630603458] [2020-12-23 08:25:16,962 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 08:25:16,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:25:16,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 08:25:16,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 08:25:16,963 INFO L87 Difference]: Start difference. First operand 2579 states and 4793 transitions. Second operand 7 states. [2020-12-23 08:25:17,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:25:17,926 INFO L93 Difference]: Finished difference Result 12628 states and 23595 transitions. [2020-12-23 08:25:17,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 08:25:17,927 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2020-12-23 08:25:17,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:25:17,956 INFO L225 Difference]: With dead ends: 12628 [2020-12-23 08:25:17,956 INFO L226 Difference]: Without dead ends: 10082 [2020-12-23 08:25:17,963 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 [2020-12-23 08:25:17,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10082 states. [2020-12-23 08:25:18,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10082 to 2584. [2020-12-23 08:25:18,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2584 states. [2020-12-23 08:25:18,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2584 states to 2584 states and 4801 transitions. [2020-12-23 08:25:18,153 INFO L78 Accepts]: Start accepts. Automaton has 2584 states and 4801 transitions. Word has length 71 [2020-12-23 08:25:18,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:25:18,154 INFO L481 AbstractCegarLoop]: Abstraction has 2584 states and 4801 transitions. [2020-12-23 08:25:18,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 08:25:18,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2584 states and 4801 transitions. [2020-12-23 08:25:18,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-12-23 08:25:18,157 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:25:18,158 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] [2020-12-23 08:25:18,158 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 08:25:18,158 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]=== [2020-12-23 08:25:18,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:25:18,159 INFO L82 PathProgramCache]: Analyzing trace with hash -652311525, now seen corresponding path program 1 times [2020-12-23 08:25:18,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:25:18,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598018824] [2020-12-23 08:25:18,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:25:18,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:25:18,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:25:18,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598018824] [2020-12-23 08:25:18,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:25:18,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:25:18,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462911594] [2020-12-23 08:25:18,236 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 08:25:18,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:25:18,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 08:25:18,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 08:25:18,239 INFO L87 Difference]: Start difference. First operand 2584 states and 4801 transitions. Second operand 3 states. [2020-12-23 08:25:18,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:25:18,400 INFO L93 Difference]: Finished difference Result 5110 states and 9520 transitions. [2020-12-23 08:25:18,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 08:25:18,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2020-12-23 08:25:18,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:25:18,409 INFO L225 Difference]: With dead ends: 5110 [2020-12-23 08:25:18,409 INFO L226 Difference]: Without dead ends: 2563 [2020-12-23 08:25:18,414 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 [2020-12-23 08:25:18,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2563 states. [2020-12-23 08:25:18,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2563 to 2563. [2020-12-23 08:25:18,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2563 states. [2020-12-23 08:25:18,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2563 states to 2563 states and 4765 transitions. [2020-12-23 08:25:18,549 INFO L78 Accepts]: Start accepts. Automaton has 2563 states and 4765 transitions. Word has length 73 [2020-12-23 08:25:18,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:25:18,549 INFO L481 AbstractCegarLoop]: Abstraction has 2563 states and 4765 transitions. [2020-12-23 08:25:18,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 08:25:18,549 INFO L276 IsEmpty]: Start isEmpty. Operand 2563 states and 4765 transitions. [2020-12-23 08:25:18,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-23 08:25:18,552 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:25:18,552 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] [2020-12-23 08:25:18,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 08:25:18,553 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]=== [2020-12-23 08:25:18,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:25:18,558 INFO L82 PathProgramCache]: Analyzing trace with hash 380076096, now seen corresponding path program 1 times [2020-12-23 08:25:18,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:25:18,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953305242] [2020-12-23 08:25:18,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:25:18,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:25:18,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:25:18,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953305242] [2020-12-23 08:25:18,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:25:18,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:25:18,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728452469] [2020-12-23 08:25:18,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:25:18,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:25:18,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:25:18,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:25:18,643 INFO L87 Difference]: Start difference. First operand 2563 states and 4765 transitions. Second operand 5 states. [2020-12-23 08:25:18,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:25:18,875 INFO L93 Difference]: Finished difference Result 5059 states and 9442 transitions. [2020-12-23 08:25:18,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:25:18,876 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2020-12-23 08:25:18,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:25:18,890 INFO L225 Difference]: With dead ends: 5059 [2020-12-23 08:25:18,890 INFO L226 Difference]: Without dead ends: 2557 [2020-12-23 08:25:18,894 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 [2020-12-23 08:25:18,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2557 states. [2020-12-23 08:25:19,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2557 to 2557. [2020-12-23 08:25:19,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2557 states. [2020-12-23 08:25:19,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 4756 transitions. [2020-12-23 08:25:19,087 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 4756 transitions. Word has length 75 [2020-12-23 08:25:19,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:25:19,087 INFO L481 AbstractCegarLoop]: Abstraction has 2557 states and 4756 transitions. [2020-12-23 08:25:19,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:25:19,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 4756 transitions. [2020-12-23 08:25:19,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-23 08:25:19,092 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:25:19,093 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] [2020-12-23 08:25:19,093 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 08:25:19,093 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]=== [2020-12-23 08:25:19,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:25:19,094 INFO L82 PathProgramCache]: Analyzing trace with hash 123083968, now seen corresponding path program 1 times [2020-12-23 08:25:19,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:25:19,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668804619] [2020-12-23 08:25:19,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:25:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:25:19,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:25:19,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668804619] [2020-12-23 08:25:19,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:25:19,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:25:19,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824043272] [2020-12-23 08:25:19,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:25:19,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:25:19,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:25:19,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:25:19,197 INFO L87 Difference]: Start difference. First operand 2557 states and 4756 transitions. Second operand 4 states. [2020-12-23 08:25:19,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:25:19,418 INFO L93 Difference]: Finished difference Result 5053 states and 9433 transitions. [2020-12-23 08:25:19,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 08:25:19,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2020-12-23 08:25:19,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:25:19,425 INFO L225 Difference]: With dead ends: 5053 [2020-12-23 08:25:19,426 INFO L226 Difference]: Without dead ends: 2543 [2020-12-23 08:25:19,436 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 [2020-12-23 08:25:19,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2543 states. [2020-12-23 08:25:19,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2543 to 2543. [2020-12-23 08:25:19,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2543 states. [2020-12-23 08:25:19,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2543 states to 2543 states and 4735 transitions. [2020-12-23 08:25:19,583 INFO L78 Accepts]: Start accepts. Automaton has 2543 states and 4735 transitions. Word has length 75 [2020-12-23 08:25:19,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:25:19,584 INFO L481 AbstractCegarLoop]: Abstraction has 2543 states and 4735 transitions. [2020-12-23 08:25:19,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:25:19,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2543 states and 4735 transitions. [2020-12-23 08:25:19,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-23 08:25:19,588 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:25:19,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] [2020-12-23 08:25:19,588 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 08:25:19,588 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]=== [2020-12-23 08:25:19,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:25:19,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1982325869, now seen corresponding path program 1 times [2020-12-23 08:25:19,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:25:19,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564505149] [2020-12-23 08:25:19,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:25:19,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:25:19,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:25:19,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564505149] [2020-12-23 08:25:19,710 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:25:19,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 08:25:19,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410059654] [2020-12-23 08:25:19,711 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 08:25:19,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:25:19,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 08:25:19,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 08:25:19,712 INFO L87 Difference]: Start difference. First operand 2543 states and 4735 transitions. Second operand 6 states. [2020-12-23 08:25:20,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:25:20,010 INFO L93 Difference]: Finished difference Result 5053 states and 9428 transitions. [2020-12-23 08:25:20,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 08:25:20,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2020-12-23 08:25:20,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:25:20,018 INFO L225 Difference]: With dead ends: 5053 [2020-12-23 08:25:20,018 INFO L226 Difference]: Without dead ends: 2563 [2020-12-23 08:25:20,024 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 [2020-12-23 08:25:20,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2563 states. [2020-12-23 08:25:20,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2563 to 2543. [2020-12-23 08:25:20,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2543 states. [2020-12-23 08:25:20,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2543 states to 2543 states and 4734 transitions. [2020-12-23 08:25:20,171 INFO L78 Accepts]: Start accepts. Automaton has 2543 states and 4734 transitions. Word has length 76 [2020-12-23 08:25:20,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:25:20,171 INFO L481 AbstractCegarLoop]: Abstraction has 2543 states and 4734 transitions. [2020-12-23 08:25:20,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 08:25:20,171 INFO L276 IsEmpty]: Start isEmpty. Operand 2543 states and 4734 transitions. [2020-12-23 08:25:20,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-23 08:25:20,174 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:25:20,174 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] [2020-12-23 08:25:20,175 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 08:25:20,175 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]=== [2020-12-23 08:25:20,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:25:20,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1371725127, now seen corresponding path program 1 times [2020-12-23 08:25:20,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:25:20,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913581125] [2020-12-23 08:25:20,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:25:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:25:20,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:25:20,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913581125] [2020-12-23 08:25:20,279 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:25:20,279 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 08:25:20,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627563383] [2020-12-23 08:25:20,279 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 08:25:20,280 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:25:20,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 08:25:20,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 08:25:20,282 INFO L87 Difference]: Start difference. First operand 2543 states and 4734 transitions. Second operand 6 states. [2020-12-23 08:25:20,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:25:20,547 INFO L93 Difference]: Finished difference Result 5043 states and 9409 transitions. [2020-12-23 08:25:20,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 08:25:20,547 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2020-12-23 08:25:20,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:25:20,555 INFO L225 Difference]: With dead ends: 5043 [2020-12-23 08:25:20,555 INFO L226 Difference]: Without dead ends: 2558 [2020-12-23 08:25:20,566 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 [2020-12-23 08:25:20,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2558 states. [2020-12-23 08:25:20,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2558 to 2543. [2020-12-23 08:25:20,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2543 states. [2020-12-23 08:25:20,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2543 states to 2543 states and 4733 transitions. [2020-12-23 08:25:20,720 INFO L78 Accepts]: Start accepts. Automaton has 2543 states and 4733 transitions. Word has length 77 [2020-12-23 08:25:20,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:25:20,720 INFO L481 AbstractCegarLoop]: Abstraction has 2543 states and 4733 transitions. [2020-12-23 08:25:20,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 08:25:20,720 INFO L276 IsEmpty]: Start isEmpty. Operand 2543 states and 4733 transitions. [2020-12-23 08:25:20,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-23 08:25:20,723 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:25:20,723 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] [2020-12-23 08:25:20,723 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 08:25:20,724 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]=== [2020-12-23 08:25:20,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:25:20,724 INFO L82 PathProgramCache]: Analyzing trace with hash 638306648, now seen corresponding path program 1 times [2020-12-23 08:25:20,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:25:20,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153522210] [2020-12-23 08:25:20,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:25:20,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:25:20,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:25:20,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153522210] [2020-12-23 08:25:20,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:25:20,859 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:25:20,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297647618] [2020-12-23 08:25:20,860 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:25:20,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:25:20,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:25:20,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:25:20,861 INFO L87 Difference]: Start difference. First operand 2543 states and 4733 transitions. Second operand 4 states. [2020-12-23 08:25:22,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:25:22,367 INFO L93 Difference]: Finished difference Result 7035 states and 13176 transitions. [2020-12-23 08:25:22,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 08:25:22,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2020-12-23 08:25:22,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:25:22,383 INFO L225 Difference]: With dead ends: 7035 [2020-12-23 08:25:22,383 INFO L226 Difference]: Without dead ends: 4556 [2020-12-23 08:25:22,389 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 [2020-12-23 08:25:22,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4556 states. [2020-12-23 08:25:22,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4556 to 2543. [2020-12-23 08:25:22,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2543 states. [2020-12-23 08:25:22,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2543 states to 2543 states and 4727 transitions. [2020-12-23 08:25:22,559 INFO L78 Accepts]: Start accepts. Automaton has 2543 states and 4727 transitions. Word has length 78 [2020-12-23 08:25:22,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:25:22,559 INFO L481 AbstractCegarLoop]: Abstraction has 2543 states and 4727 transitions. [2020-12-23 08:25:22,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:25:22,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2543 states and 4727 transitions. [2020-12-23 08:25:22,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-12-23 08:25:22,563 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:25:22,563 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] [2020-12-23 08:25:22,563 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 08:25:22,563 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]=== [2020-12-23 08:25:22,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:25:22,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1704791170, now seen corresponding path program 1 times [2020-12-23 08:25:22,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:25:22,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279917876] [2020-12-23 08:25:22,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:25:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:25:22,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:25:22,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279917876] [2020-12-23 08:25:22,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:25:22,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:25:22,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851501295] [2020-12-23 08:25:22,672 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:25:22,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:25:22,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:25:22,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:25:22,673 INFO L87 Difference]: Start difference. First operand 2543 states and 4727 transitions. Second operand 4 states. [2020-12-23 08:25:23,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:25:23,845 INFO L93 Difference]: Finished difference Result 7035 states and 13165 transitions. [2020-12-23 08:25:23,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 08:25:23,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2020-12-23 08:25:23,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:25:23,861 INFO L225 Difference]: With dead ends: 7035 [2020-12-23 08:25:23,861 INFO L226 Difference]: Without dead ends: 4556 [2020-12-23 08:25:23,867 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 [2020-12-23 08:25:23,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4556 states. [2020-12-23 08:25:24,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4556 to 2543. [2020-12-23 08:25:24,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2543 states. [2020-12-23 08:25:24,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2543 states to 2543 states and 4721 transitions. [2020-12-23 08:25:24,045 INFO L78 Accepts]: Start accepts. Automaton has 2543 states and 4721 transitions. Word has length 80 [2020-12-23 08:25:24,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:25:24,046 INFO L481 AbstractCegarLoop]: Abstraction has 2543 states and 4721 transitions. [2020-12-23 08:25:24,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:25:24,046 INFO L276 IsEmpty]: Start isEmpty. Operand 2543 states and 4721 transitions. [2020-12-23 08:25:24,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-12-23 08:25:24,049 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:25:24,049 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] [2020-12-23 08:25:24,050 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 08:25:24,050 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]=== [2020-12-23 08:25:24,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:25:24,050 INFO L82 PathProgramCache]: Analyzing trace with hash 292891470, now seen corresponding path program 1 times [2020-12-23 08:25:24,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:25:24,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926318455] [2020-12-23 08:25:24,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:25:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:25:24,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:25:24,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926318455] [2020-12-23 08:25:24,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:25:24,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:25:24,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988533715] [2020-12-23 08:25:24,171 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:25:24,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:25:24,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:25:24,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:25:24,172 INFO L87 Difference]: Start difference. First operand 2543 states and 4721 transitions. Second operand 4 states. [2020-12-23 08:25:25,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:25:25,618 INFO L93 Difference]: Finished difference Result 7035 states and 13154 transitions. [2020-12-23 08:25:25,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 08:25:25,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2020-12-23 08:25:25,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:25:25,632 INFO L225 Difference]: With dead ends: 7035 [2020-12-23 08:25:25,633 INFO L226 Difference]: Without dead ends: 4556 [2020-12-23 08:25:25,638 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 [2020-12-23 08:25:25,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4556 states. [2020-12-23 08:25:25,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4556 to 2543. [2020-12-23 08:25:25,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2543 states. [2020-12-23 08:25:25,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2543 states to 2543 states and 4715 transitions. [2020-12-23 08:25:25,829 INFO L78 Accepts]: Start accepts. Automaton has 2543 states and 4715 transitions. Word has length 82 [2020-12-23 08:25:25,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:25:25,830 INFO L481 AbstractCegarLoop]: Abstraction has 2543 states and 4715 transitions. [2020-12-23 08:25:25,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:25:25,830 INFO L276 IsEmpty]: Start isEmpty. Operand 2543 states and 4715 transitions. [2020-12-23 08:25:25,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-23 08:25:25,833 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:25:25,833 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] [2020-12-23 08:25:25,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 08:25:25,834 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]=== [2020-12-23 08:25:25,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:25:25,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1372412446, now seen corresponding path program 1 times [2020-12-23 08:25:25,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:25:25,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396660844] [2020-12-23 08:25:25,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:25:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:25:25,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:25:25,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396660844] [2020-12-23 08:25:25,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:25:25,934 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:25:25,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123884567] [2020-12-23 08:25:25,935 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:25:25,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:25:25,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:25:25,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:25:25,936 INFO L87 Difference]: Start difference. First operand 2543 states and 4715 transitions. Second operand 4 states. [2020-12-23 08:25:27,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:25:27,293 INFO L93 Difference]: Finished difference Result 7035 states and 13143 transitions. [2020-12-23 08:25:27,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 08:25:27,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2020-12-23 08:25:27,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:25:27,302 INFO L225 Difference]: With dead ends: 7035 [2020-12-23 08:25:27,303 INFO L226 Difference]: Without dead ends: 4556 [2020-12-23 08:25:27,307 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 [2020-12-23 08:25:27,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4556 states. [2020-12-23 08:25:27,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4556 to 2543. [2020-12-23 08:25:27,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2543 states. [2020-12-23 08:25:27,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2543 states to 2543 states and 4709 transitions. [2020-12-23 08:25:27,480 INFO L78 Accepts]: Start accepts. Automaton has 2543 states and 4709 transitions. Word has length 84 [2020-12-23 08:25:27,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:25:27,480 INFO L481 AbstractCegarLoop]: Abstraction has 2543 states and 4709 transitions. [2020-12-23 08:25:27,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:25:27,480 INFO L276 IsEmpty]: Start isEmpty. Operand 2543 states and 4709 transitions. [2020-12-23 08:25:27,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-12-23 08:25:27,483 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:25:27,484 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] [2020-12-23 08:25:27,484 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 08:25:27,484 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]=== [2020-12-23 08:25:27,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:25:27,484 INFO L82 PathProgramCache]: Analyzing trace with hash 772472772, now seen corresponding path program 1 times [2020-12-23 08:25:27,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:25:27,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132185145] [2020-12-23 08:25:27,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:25:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:25:27,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:25:27,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132185145] [2020-12-23 08:25:27,570 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:25:27,570 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:25:27,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827225366] [2020-12-23 08:25:27,571 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 08:25:27,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:25:27,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 08:25:27,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 08:25:27,572 INFO L87 Difference]: Start difference. First operand 2543 states and 4709 transitions. Second operand 6 states. [2020-12-23 08:25:31,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:25:31,258 INFO L93 Difference]: Finished difference Result 26929 states and 50260 transitions. [2020-12-23 08:25:31,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-23 08:25:31,258 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2020-12-23 08:25:31,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:25:31,295 INFO L225 Difference]: With dead ends: 26929 [2020-12-23 08:25:31,295 INFO L226 Difference]: Without dead ends: 24468 [2020-12-23 08:25:31,308 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2020-12-23 08:25:31,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24468 states. [2020-12-23 08:25:31,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24468 to 5010. [2020-12-23 08:25:31,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5010 states. [2020-12-23 08:25:31,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5010 states to 5010 states and 9306 transitions. [2020-12-23 08:25:31,985 INFO L78 Accepts]: Start accepts. Automaton has 5010 states and 9306 transitions. Word has length 86 [2020-12-23 08:25:31,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:25:31,986 INFO L481 AbstractCegarLoop]: Abstraction has 5010 states and 9306 transitions. [2020-12-23 08:25:31,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 08:25:31,986 INFO L276 IsEmpty]: Start isEmpty. Operand 5010 states and 9306 transitions. [2020-12-23 08:25:31,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-23 08:25:31,990 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:25:31,990 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] [2020-12-23 08:25:31,991 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 08:25:31,991 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]=== [2020-12-23 08:25:31,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:25:31,991 INFO L82 PathProgramCache]: Analyzing trace with hash -603961180, now seen corresponding path program 1 times [2020-12-23 08:25:31,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:25:31,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019158922] [2020-12-23 08:25:31,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:25:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:25:32,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:25:32,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019158922] [2020-12-23 08:25:32,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:25:32,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:25:32,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921974524] [2020-12-23 08:25:32,080 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:25:32,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:25:32,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:25:32,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:25:32,081 INFO L87 Difference]: Start difference. First operand 5010 states and 9306 transitions. Second operand 5 states. [2020-12-23 08:25:34,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:25:34,531 INFO L93 Difference]: Finished difference Result 19943 states and 37101 transitions. [2020-12-23 08:25:34,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 08:25:34,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2020-12-23 08:25:34,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:25:34,554 INFO L225 Difference]: With dead ends: 19943 [2020-12-23 08:25:34,554 INFO L226 Difference]: Without dead ends: 15081 [2020-12-23 08:25:34,563 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 [2020-12-23 08:25:34,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15081 states. [2020-12-23 08:25:35,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15081 to 5022. [2020-12-23 08:25:35,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5022 states. [2020-12-23 08:25:35,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5022 states to 5022 states and 9318 transitions. [2020-12-23 08:25:35,026 INFO L78 Accepts]: Start accepts. Automaton has 5022 states and 9318 transitions. Word has length 88 [2020-12-23 08:25:35,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:25:35,026 INFO L481 AbstractCegarLoop]: Abstraction has 5022 states and 9318 transitions. [2020-12-23 08:25:35,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:25:35,027 INFO L276 IsEmpty]: Start isEmpty. Operand 5022 states and 9318 transitions. [2020-12-23 08:25:35,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-23 08:25:35,031 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:25:35,032 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] [2020-12-23 08:25:35,032 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 08:25:35,032 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]=== [2020-12-23 08:25:35,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:25:35,035 INFO L82 PathProgramCache]: Analyzing trace with hash 259114207, now seen corresponding path program 1 times [2020-12-23 08:25:35,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:25:35,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558272110] [2020-12-23 08:25:35,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:25:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:25:35,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:25:35,119 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558272110] [2020-12-23 08:25:35,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:25:35,120 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:25:35,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132953695] [2020-12-23 08:25:35,125 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:25:35,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:25:35,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:25:35,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:25:35,126 INFO L87 Difference]: Start difference. First operand 5022 states and 9318 transitions. Second operand 5 states. [2020-12-23 08:25:35,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:25:35,753 INFO L93 Difference]: Finished difference Result 9976 states and 18545 transitions. [2020-12-23 08:25:35,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 08:25:35,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2020-12-23 08:25:35,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:25:35,765 INFO L225 Difference]: With dead ends: 9976 [2020-12-23 08:25:35,765 INFO L226 Difference]: Without dead ends: 5033 [2020-12-23 08:25:35,773 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 [2020-12-23 08:25:35,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5033 states. [2020-12-23 08:25:36,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5033 to 5018. [2020-12-23 08:25:36,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5018 states. [2020-12-23 08:25:36,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5018 states to 5018 states and 9308 transitions. [2020-12-23 08:25:36,217 INFO L78 Accepts]: Start accepts. Automaton has 5018 states and 9308 transitions. Word has length 88 [2020-12-23 08:25:36,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:25:36,217 INFO L481 AbstractCegarLoop]: Abstraction has 5018 states and 9308 transitions. [2020-12-23 08:25:36,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:25:36,217 INFO L276 IsEmpty]: Start isEmpty. Operand 5018 states and 9308 transitions. [2020-12-23 08:25:36,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-12-23 08:25:36,222 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:25:36,222 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] [2020-12-23 08:25:36,222 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 08:25:36,222 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]=== [2020-12-23 08:25:36,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:25:36,223 INFO L82 PathProgramCache]: Analyzing trace with hash -2061004475, now seen corresponding path program 1 times [2020-12-23 08:25:36,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:25:36,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686611856] [2020-12-23 08:25:36,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:25:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:25:36,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:25:36,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686611856] [2020-12-23 08:25:36,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:25:36,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:25:36,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673016938] [2020-12-23 08:25:36,338 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:25:36,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:25:36,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:25:36,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:25:36,339 INFO L87 Difference]: Start difference. First operand 5018 states and 9308 transitions. Second operand 4 states. [2020-12-23 08:25:38,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:25:38,773 INFO L93 Difference]: Finished difference Result 17376 states and 32339 transitions. [2020-12-23 08:25:38,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:25:38,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2020-12-23 08:25:38,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:25:38,791 INFO L225 Difference]: With dead ends: 17376 [2020-12-23 08:25:38,792 INFO L226 Difference]: Without dead ends: 12463 [2020-12-23 08:25:38,800 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 [2020-12-23 08:25:38,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12463 states. [2020-12-23 08:25:39,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12463 to 6912. [2020-12-23 08:25:39,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6912 states. [2020-12-23 08:25:39,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6912 states to 6912 states and 12686 transitions. [2020-12-23 08:25:39,229 INFO L78 Accepts]: Start accepts. Automaton has 6912 states and 12686 transitions. Word has length 89 [2020-12-23 08:25:39,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:25:39,229 INFO L481 AbstractCegarLoop]: Abstraction has 6912 states and 12686 transitions. [2020-12-23 08:25:39,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:25:39,229 INFO L276 IsEmpty]: Start isEmpty. Operand 6912 states and 12686 transitions. [2020-12-23 08:25:39,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-12-23 08:25:39,233 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:25:39,233 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] [2020-12-23 08:25:39,233 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 08:25:39,233 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]=== [2020-12-23 08:25:39,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:25:39,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1575079927, now seen corresponding path program 1 times [2020-12-23 08:25:39,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:25:39,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136942342] [2020-12-23 08:25:39,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:25:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:25:39,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:25:39,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136942342] [2020-12-23 08:25:39,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:25:39,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:25:39,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516163342] [2020-12-23 08:25:39,312 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:25:39,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:25:39,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:25:39,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:25:39,316 INFO L87 Difference]: Start difference. First operand 6912 states and 12686 transitions. Second operand 5 states. [2020-12-23 08:25:39,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:25:39,639 INFO L93 Difference]: Finished difference Result 10332 states and 18973 transitions. [2020-12-23 08:25:39,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 08:25:39,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2020-12-23 08:25:39,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:25:39,645 INFO L225 Difference]: With dead ends: 10332 [2020-12-23 08:25:39,645 INFO L226 Difference]: Without dead ends: 3450 [2020-12-23 08:25:39,650 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 [2020-12-23 08:25:39,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3450 states. [2020-12-23 08:25:39,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3450 to 3450. [2020-12-23 08:25:39,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3450 states. [2020-12-23 08:25:39,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3450 states to 3450 states and 6322 transitions. [2020-12-23 08:25:39,905 INFO L78 Accepts]: Start accepts. Automaton has 3450 states and 6322 transitions. Word has length 89 [2020-12-23 08:25:39,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:25:39,905 INFO L481 AbstractCegarLoop]: Abstraction has 3450 states and 6322 transitions. [2020-12-23 08:25:39,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:25:39,905 INFO L276 IsEmpty]: Start isEmpty. Operand 3450 states and 6322 transitions. [2020-12-23 08:25:39,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-12-23 08:25:39,907 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:25:39,907 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] [2020-12-23 08:25:39,908 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 08:25:39,908 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]=== [2020-12-23 08:25:39,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:25:39,908 INFO L82 PathProgramCache]: Analyzing trace with hash -729666801, now seen corresponding path program 1 times [2020-12-23 08:25:39,908 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:25:39,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413641475] [2020-12-23 08:25:39,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:25:39,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:25:39,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:25:39,985 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413641475] [2020-12-23 08:25:39,985 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:25:39,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:25:39,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599224173] [2020-12-23 08:25:39,986 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:25:39,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:25:39,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:25:39,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:25:39,987 INFO L87 Difference]: Start difference. First operand 3450 states and 6322 transitions. Second operand 5 states. [2020-12-23 08:25:41,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:25:41,415 INFO L93 Difference]: Finished difference Result 24636 states and 45488 transitions. [2020-12-23 08:25:41,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 08:25:41,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2020-12-23 08:25:41,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:25:41,441 INFO L225 Difference]: With dead ends: 24636 [2020-12-23 08:25:41,442 INFO L226 Difference]: Without dead ends: 21258 [2020-12-23 08:25:41,447 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 [2020-12-23 08:25:41,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21258 states. [2020-12-23 08:25:41,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21258 to 6295. [2020-12-23 08:25:41,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6295 states. [2020-12-23 08:25:41,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6295 states to 6295 states and 11602 transitions. [2020-12-23 08:25:41,940 INFO L78 Accepts]: Start accepts. Automaton has 6295 states and 11602 transitions. Word has length 91 [2020-12-23 08:25:41,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:25:41,940 INFO L481 AbstractCegarLoop]: Abstraction has 6295 states and 11602 transitions. [2020-12-23 08:25:41,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:25:41,940 INFO L276 IsEmpty]: Start isEmpty. Operand 6295 states and 11602 transitions. [2020-12-23 08:25:41,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-12-23 08:25:41,942 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:25:41,942 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] [2020-12-23 08:25:41,942 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 08:25:41,943 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]=== [2020-12-23 08:25:41,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:25:41,943 INFO L82 PathProgramCache]: Analyzing trace with hash -454907187, now seen corresponding path program 1 times [2020-12-23 08:25:41,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:25:41,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783128473] [2020-12-23 08:25:41,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:25:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:25:42,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:25:42,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783128473] [2020-12-23 08:25:42,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:25:42,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:25:42,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176565453] [2020-12-23 08:25:42,035 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 08:25:42,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:25:42,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 08:25:42,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 08:25:42,036 INFO L87 Difference]: Start difference. First operand 6295 states and 11602 transitions. Second operand 6 states. [2020-12-23 08:25:43,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:25:43,275 INFO L93 Difference]: Finished difference Result 11398 states and 20918 transitions. [2020-12-23 08:25:43,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 08:25:43,276 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2020-12-23 08:25:43,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:25:43,286 INFO L225 Difference]: With dead ends: 11398 [2020-12-23 08:25:43,287 INFO L226 Difference]: Without dead ends: 8692 [2020-12-23 08:25:43,291 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 [2020-12-23 08:25:43,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8692 states. [2020-12-23 08:25:43,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8692 to 6285. [2020-12-23 08:25:43,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6285 states. [2020-12-23 08:25:43,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6285 states to 6285 states and 11582 transitions. [2020-12-23 08:25:43,691 INFO L78 Accepts]: Start accepts. Automaton has 6285 states and 11582 transitions. Word has length 91 [2020-12-23 08:25:43,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:25:43,691 INFO L481 AbstractCegarLoop]: Abstraction has 6285 states and 11582 transitions. [2020-12-23 08:25:43,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 08:25:43,691 INFO L276 IsEmpty]: Start isEmpty. Operand 6285 states and 11582 transitions. [2020-12-23 08:25:43,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-12-23 08:25:43,693 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:25:43,693 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] [2020-12-23 08:25:43,694 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-23 08:25:43,694 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]=== [2020-12-23 08:25:43,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:25:43,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1636743277, now seen corresponding path program 1 times [2020-12-23 08:25:43,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:25:43,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173591447] [2020-12-23 08:25:43,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:25:43,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:25:43,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:25:43,771 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173591447] [2020-12-23 08:25:43,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:25:43,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:25:43,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586133832] [2020-12-23 08:25:43,772 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:25:43,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:25:43,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:25:43,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:25:43,773 INFO L87 Difference]: Start difference. First operand 6285 states and 11582 transitions. Second operand 5 states. [2020-12-23 08:25:44,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:25:44,929 INFO L93 Difference]: Finished difference Result 19253 states and 35498 transitions. [2020-12-23 08:25:44,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 08:25:44,930 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2020-12-23 08:25:44,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:25:44,952 INFO L225 Difference]: With dead ends: 19253 [2020-12-23 08:25:44,953 INFO L226 Difference]: Without dead ends: 16553 [2020-12-23 08:25:44,963 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 [2020-12-23 08:25:44,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16553 states. [2020-12-23 08:25:45,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16553 to 8724. [2020-12-23 08:25:45,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8724 states. [2020-12-23 08:25:45,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8724 states to 8724 states and 16059 transitions. [2020-12-23 08:25:45,545 INFO L78 Accepts]: Start accepts. Automaton has 8724 states and 16059 transitions. Word has length 93 [2020-12-23 08:25:45,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:25:45,545 INFO L481 AbstractCegarLoop]: Abstraction has 8724 states and 16059 transitions. [2020-12-23 08:25:45,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:25:45,545 INFO L276 IsEmpty]: Start isEmpty. Operand 8724 states and 16059 transitions. [2020-12-23 08:25:45,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-12-23 08:25:45,547 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:25:45,547 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] [2020-12-23 08:25:45,548 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-23 08:25:45,548 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]=== [2020-12-23 08:25:45,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:25:45,548 INFO L82 PathProgramCache]: Analyzing trace with hash -830657945, now seen corresponding path program 1 times [2020-12-23 08:25:45,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:25:45,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187336280] [2020-12-23 08:25:45,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:25:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:25:45,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:25:45,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187336280] [2020-12-23 08:25:45,626 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:25:45,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:25:45,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077900385] [2020-12-23 08:25:45,627 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:25:45,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:25:45,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:25:45,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:25:45,627 INFO L87 Difference]: Start difference. First operand 8724 states and 16059 transitions. Second operand 5 states. [2020-12-23 08:25:46,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:25:46,788 INFO L93 Difference]: Finished difference Result 18140 states and 33262 transitions. [2020-12-23 08:25:46,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 08:25:46,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2020-12-23 08:25:46,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:25:46,807 INFO L225 Difference]: With dead ends: 18140 [2020-12-23 08:25:46,807 INFO L226 Difference]: Without dead ends: 13218 [2020-12-23 08:25:46,814 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 [2020-12-23 08:25:46,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13218 states. [2020-12-23 08:25:47,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13218 to 8741. [2020-12-23 08:25:47,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8741 states. [2020-12-23 08:25:47,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8741 states to 8741 states and 16072 transitions. [2020-12-23 08:25:47,433 INFO L78 Accepts]: Start accepts. Automaton has 8741 states and 16072 transitions. Word has length 95 [2020-12-23 08:25:47,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:25:47,434 INFO L481 AbstractCegarLoop]: Abstraction has 8741 states and 16072 transitions. [2020-12-23 08:25:47,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:25:47,434 INFO L276 IsEmpty]: Start isEmpty. Operand 8741 states and 16072 transitions. [2020-12-23 08:25:47,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-12-23 08:25:47,436 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:25:47,436 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] [2020-12-23 08:25:47,436 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-23 08:25:47,437 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]=== [2020-12-23 08:25:47,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:25:47,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1062181365, now seen corresponding path program 1 times [2020-12-23 08:25:47,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:25:47,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053165215] [2020-12-23 08:25:47,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:25:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:25:47,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:25:47,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053165215] [2020-12-23 08:25:47,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:25:47,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:25:47,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859704565] [2020-12-23 08:25:47,518 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:25:47,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:25:47,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:25:47,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:25:47,519 INFO L87 Difference]: Start difference. First operand 8741 states and 16072 transitions. Second operand 5 states. [2020-12-23 08:25:48,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:25:48,927 INFO L93 Difference]: Finished difference Result 19940 states and 36781 transitions. [2020-12-23 08:25:48,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:25:48,930 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2020-12-23 08:25:48,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:25:48,949 INFO L225 Difference]: With dead ends: 19940 [2020-12-23 08:25:48,949 INFO L226 Difference]: Without dead ends: 12763 [2020-12-23 08:25:48,955 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 [2020-12-23 08:25:48,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12763 states. [2020-12-23 08:25:49,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12763 to 8741. [2020-12-23 08:25:49,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8741 states. [2020-12-23 08:25:49,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8741 states to 8741 states and 15972 transitions. [2020-12-23 08:25:49,560 INFO L78 Accepts]: Start accepts. Automaton has 8741 states and 15972 transitions. Word has length 102 [2020-12-23 08:25:49,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:25:49,561 INFO L481 AbstractCegarLoop]: Abstraction has 8741 states and 15972 transitions. [2020-12-23 08:25:49,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:25:49,561 INFO L276 IsEmpty]: Start isEmpty. Operand 8741 states and 15972 transitions. [2020-12-23 08:25:49,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-12-23 08:25:49,563 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:25:49,563 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] [2020-12-23 08:25:49,564 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-23 08:25:49,564 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]=== [2020-12-23 08:25:49,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:25:49,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1346860968, now seen corresponding path program 1 times [2020-12-23 08:25:49,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:25:49,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273251337] [2020-12-23 08:25:49,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:25:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:25:49,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:25:49,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273251337] [2020-12-23 08:25:49,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:25:49,644 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 08:25:49,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020868512] [2020-12-23 08:25:49,645 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 08:25:49,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:25:49,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 08:25:49,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 08:25:49,646 INFO L87 Difference]: Start difference. First operand 8741 states and 15972 transitions. Second operand 6 states. [2020-12-23 08:25:50,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:25:50,304 INFO L93 Difference]: Finished difference Result 14029 states and 25521 transitions. [2020-12-23 08:25:50,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 08:25:50,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2020-12-23 08:25:50,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:25:50,318 INFO L225 Difference]: With dead ends: 14029 [2020-12-23 08:25:50,318 INFO L226 Difference]: Without dead ends: 8756 [2020-12-23 08:25:50,326 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 [2020-12-23 08:25:50,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8756 states. [2020-12-23 08:25:50,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8756 to 8741. [2020-12-23 08:25:50,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8741 states. [2020-12-23 08:25:50,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8741 states to 8741 states and 15870 transitions. [2020-12-23 08:25:50,889 INFO L78 Accepts]: Start accepts. Automaton has 8741 states and 15870 transitions. Word has length 102 [2020-12-23 08:25:50,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:25:50,889 INFO L481 AbstractCegarLoop]: Abstraction has 8741 states and 15870 transitions. [2020-12-23 08:25:50,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 08:25:50,890 INFO L276 IsEmpty]: Start isEmpty. Operand 8741 states and 15870 transitions. [2020-12-23 08:25:50,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-12-23 08:25:50,892 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:25:50,892 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] [2020-12-23 08:25:50,892 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-23 08:25:50,893 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]=== [2020-12-23 08:25:50,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:25:50,893 INFO L82 PathProgramCache]: Analyzing trace with hash -493659028, now seen corresponding path program 1 times [2020-12-23 08:25:50,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:25:50,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036952519] [2020-12-23 08:25:50,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:25:50,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:25:50,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:25:50,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036952519] [2020-12-23 08:25:50,968 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:25:50,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:25:50,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303512512] [2020-12-23 08:25:50,968 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:25:50,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:25:50,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:25:50,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:25:50,969 INFO L87 Difference]: Start difference. First operand 8741 states and 15870 transitions. Second operand 5 states. [2020-12-23 08:25:51,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:25:51,641 INFO L93 Difference]: Finished difference Result 13666 states and 24769 transitions. [2020-12-23 08:25:51,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:25:51,642 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2020-12-23 08:25:51,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:25:51,655 INFO L225 Difference]: With dead ends: 13666 [2020-12-23 08:25:51,655 INFO L226 Difference]: Without dead ends: 8764 [2020-12-23 08:25:51,662 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 [2020-12-23 08:25:51,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8764 states. [2020-12-23 08:25:52,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8764 to 8741. [2020-12-23 08:25:52,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8741 states. [2020-12-23 08:25:52,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8741 states to 8741 states and 15855 transitions. [2020-12-23 08:25:52,227 INFO L78 Accepts]: Start accepts. Automaton has 8741 states and 15855 transitions. Word has length 103 [2020-12-23 08:25:52,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:25:52,227 INFO L481 AbstractCegarLoop]: Abstraction has 8741 states and 15855 transitions. [2020-12-23 08:25:52,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:25:52,228 INFO L276 IsEmpty]: Start isEmpty. Operand 8741 states and 15855 transitions. [2020-12-23 08:25:52,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-12-23 08:25:52,230 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:25:52,230 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] [2020-12-23 08:25:52,230 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-23 08:25:52,230 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]=== [2020-12-23 08:25:52,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:25:52,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1080465042, now seen corresponding path program 1 times [2020-12-23 08:25:52,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:25:52,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830500942] [2020-12-23 08:25:52,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:25:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:25:52,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:25:52,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830500942] [2020-12-23 08:25:52,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:25:52,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:25:52,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289239959] [2020-12-23 08:25:52,308 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 08:25:52,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:25:52,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 08:25:52,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 08:25:52,309 INFO L87 Difference]: Start difference. First operand 8741 states and 15855 transitions. Second operand 3 states. [2020-12-23 08:25:52,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:25:52,907 INFO L93 Difference]: Finished difference Result 15794 states and 28634 transitions. [2020-12-23 08:25:52,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 08:25:52,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2020-12-23 08:25:52,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:25:52,920 INFO L225 Difference]: With dead ends: 15794 [2020-12-23 08:25:52,920 INFO L226 Difference]: Without dead ends: 8719 [2020-12-23 08:25:52,927 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 [2020-12-23 08:25:52,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8719 states. [2020-12-23 08:25:53,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8719 to 8719. [2020-12-23 08:25:53,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8719 states. [2020-12-23 08:25:53,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8719 states to 8719 states and 15813 transitions. [2020-12-23 08:25:53,505 INFO L78 Accepts]: Start accepts. Automaton has 8719 states and 15813 transitions. Word has length 103 [2020-12-23 08:25:53,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:25:53,505 INFO L481 AbstractCegarLoop]: Abstraction has 8719 states and 15813 transitions. [2020-12-23 08:25:53,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 08:25:53,505 INFO L276 IsEmpty]: Start isEmpty. Operand 8719 states and 15813 transitions. [2020-12-23 08:25:53,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-23 08:25:53,507 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:25:53,508 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] [2020-12-23 08:25:53,508 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-23 08:25:53,508 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]=== [2020-12-23 08:25:53,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:25:53,509 INFO L82 PathProgramCache]: Analyzing trace with hash -2135151223, now seen corresponding path program 1 times [2020-12-23 08:25:53,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:25:53,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448773633] [2020-12-23 08:25:53,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:25:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:25:53,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:25:53,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448773633] [2020-12-23 08:25:53,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:25:53,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:25:53,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570325023] [2020-12-23 08:25:53,595 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:25:53,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:25:53,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:25:53,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:25:53,596 INFO L87 Difference]: Start difference. First operand 8719 states and 15813 transitions. Second operand 5 states. [2020-12-23 08:25:56,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:25:56,031 INFO L93 Difference]: Finished difference Result 35048 states and 62397 transitions. [2020-12-23 08:25:56,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 08:25:56,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2020-12-23 08:25:56,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:25:56,074 INFO L225 Difference]: With dead ends: 35048 [2020-12-23 08:25:56,074 INFO L226 Difference]: Without dead ends: 30177 [2020-12-23 08:25:56,085 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 [2020-12-23 08:25:56,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30177 states. [2020-12-23 08:25:57,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30177 to 10626. [2020-12-23 08:25:57,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10626 states. [2020-12-23 08:25:57,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10626 states to 10626 states and 18804 transitions. [2020-12-23 08:25:57,034 INFO L78 Accepts]: Start accepts. Automaton has 10626 states and 18804 transitions. Word has length 105 [2020-12-23 08:25:57,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:25:57,034 INFO L481 AbstractCegarLoop]: Abstraction has 10626 states and 18804 transitions. [2020-12-23 08:25:57,035 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:25:57,035 INFO L276 IsEmpty]: Start isEmpty. Operand 10626 states and 18804 transitions. [2020-12-23 08:25:57,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-23 08:25:57,037 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:25:57,038 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] [2020-12-23 08:25:57,038 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-23 08:25:57,038 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]=== [2020-12-23 08:25:57,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:25:57,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1844508423, now seen corresponding path program 1 times [2020-12-23 08:25:57,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:25:57,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226228024] [2020-12-23 08:25:57,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:25:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:25:57,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:25:57,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226228024] [2020-12-23 08:25:57,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:25:57,194 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:25:57,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411930539] [2020-12-23 08:25:57,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:25:57,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:25:57,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:25:57,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:25:57,196 INFO L87 Difference]: Start difference. First operand 10626 states and 18804 transitions. Second operand 5 states. [2020-12-23 08:25:58,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:25:58,502 INFO L93 Difference]: Finished difference Result 17508 states and 31081 transitions. [2020-12-23 08:25:58,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:25:58,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2020-12-23 08:25:58,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:25:58,528 INFO L225 Difference]: With dead ends: 17508 [2020-12-23 08:25:58,528 INFO L226 Difference]: Without dead ends: 17495 [2020-12-23 08:25:58,532 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 [2020-12-23 08:25:58,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17495 states. [2020-12-23 08:25:59,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17495 to 10644. [2020-12-23 08:25:59,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10644 states. [2020-12-23 08:25:59,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10644 states to 10644 states and 18822 transitions. [2020-12-23 08:25:59,323 INFO L78 Accepts]: Start accepts. Automaton has 10644 states and 18822 transitions. Word has length 105 [2020-12-23 08:25:59,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:25:59,323 INFO L481 AbstractCegarLoop]: Abstraction has 10644 states and 18822 transitions. [2020-12-23 08:25:59,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:25:59,324 INFO L276 IsEmpty]: Start isEmpty. Operand 10644 states and 18822 transitions. [2020-12-23 08:25:59,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-12-23 08:25:59,326 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:25:59,326 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] [2020-12-23 08:25:59,326 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-23 08:25:59,327 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]=== [2020-12-23 08:25:59,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:25:59,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1336275788, now seen corresponding path program 1 times [2020-12-23 08:25:59,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:25:59,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343430026] [2020-12-23 08:25:59,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:25:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:25:59,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:25:59,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343430026] [2020-12-23 08:25:59,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:25:59,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 08:25:59,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274175725] [2020-12-23 08:25:59,415 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 08:25:59,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:25:59,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 08:25:59,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 08:25:59,416 INFO L87 Difference]: Start difference. First operand 10644 states and 18822 transitions. Second operand 6 states. [2020-12-23 08:26:00,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:26:00,324 INFO L93 Difference]: Finished difference Result 10663 states and 18840 transitions. [2020-12-23 08:26:00,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 08:26:00,325 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 107 [2020-12-23 08:26:00,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:26:00,338 INFO L225 Difference]: With dead ends: 10663 [2020-12-23 08:26:00,338 INFO L226 Difference]: Without dead ends: 10650 [2020-12-23 08:26:00,342 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 [2020-12-23 08:26:00,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10650 states. [2020-12-23 08:26:01,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10650 to 10644. [2020-12-23 08:26:01,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10644 states. [2020-12-23 08:26:01,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10644 states to 10644 states and 18812 transitions. [2020-12-23 08:26:01,118 INFO L78 Accepts]: Start accepts. Automaton has 10644 states and 18812 transitions. Word has length 107 [2020-12-23 08:26:01,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:26:01,118 INFO L481 AbstractCegarLoop]: Abstraction has 10644 states and 18812 transitions. [2020-12-23 08:26:01,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 08:26:01,118 INFO L276 IsEmpty]: Start isEmpty. Operand 10644 states and 18812 transitions. [2020-12-23 08:26:01,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-12-23 08:26:01,122 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:26:01,123 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] [2020-12-23 08:26:01,123 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-12-23 08:26:01,123 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]=== [2020-12-23 08:26:01,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:26:01,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1717963875, now seen corresponding path program 1 times [2020-12-23 08:26:01,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:26:01,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238914676] [2020-12-23 08:26:01,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:26:01,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:26:01,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:26:01,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238914676] [2020-12-23 08:26:01,240 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:26:01,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:26:01,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323492449] [2020-12-23 08:26:01,243 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:26:01,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:26:01,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:26:01,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:26:01,244 INFO L87 Difference]: Start difference. First operand 10644 states and 18812 transitions. Second operand 5 states. [2020-12-23 08:26:03,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:26:03,564 INFO L93 Difference]: Finished difference Result 25276 states and 44438 transitions. [2020-12-23 08:26:03,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 08:26:03,565 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2020-12-23 08:26:03,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:26:03,588 INFO L225 Difference]: With dead ends: 25276 [2020-12-23 08:26:03,588 INFO L226 Difference]: Without dead ends: 16579 [2020-12-23 08:26:03,598 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 [2020-12-23 08:26:03,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16579 states. [2020-12-23 08:26:04,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16579 to 10644. [2020-12-23 08:26:04,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10644 states. [2020-12-23 08:26:04,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10644 states to 10644 states and 18802 transitions. [2020-12-23 08:26:04,523 INFO L78 Accepts]: Start accepts. Automaton has 10644 states and 18802 transitions. Word has length 114 [2020-12-23 08:26:04,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:26:04,523 INFO L481 AbstractCegarLoop]: Abstraction has 10644 states and 18802 transitions. [2020-12-23 08:26:04,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:26:04,524 INFO L276 IsEmpty]: Start isEmpty. Operand 10644 states and 18802 transitions. [2020-12-23 08:26:04,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-12-23 08:26:04,527 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:26:04,527 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] [2020-12-23 08:26:04,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-12-23 08:26:04,527 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]=== [2020-12-23 08:26:04,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:26:04,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1626987571, now seen corresponding path program 1 times [2020-12-23 08:26:04,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:26:04,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985220099] [2020-12-23 08:26:04,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:26:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:26:04,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:26:04,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985220099] [2020-12-23 08:26:04,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:26:04,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 08:26:04,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149803040] [2020-12-23 08:26:04,694 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 08:26:04,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:26:04,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 08:26:04,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-23 08:26:04,695 INFO L87 Difference]: Start difference. First operand 10644 states and 18802 transitions. Second operand 7 states. [2020-12-23 08:26:11,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:26:11,108 INFO L93 Difference]: Finished difference Result 39584 states and 69995 transitions. [2020-12-23 08:26:11,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-23 08:26:11,109 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2020-12-23 08:26:11,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:26:11,157 INFO L225 Difference]: With dead ends: 39584 [2020-12-23 08:26:11,158 INFO L226 Difference]: Without dead ends: 33213 [2020-12-23 08:26:11,169 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2020-12-23 08:26:11,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33213 states. [2020-12-23 08:26:12,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33213 to 13598. [2020-12-23 08:26:12,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13598 states. [2020-12-23 08:26:12,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13598 states to 13598 states and 24037 transitions. [2020-12-23 08:26:12,652 INFO L78 Accepts]: Start accepts. Automaton has 13598 states and 24037 transitions. Word has length 119 [2020-12-23 08:26:12,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:26:12,652 INFO L481 AbstractCegarLoop]: Abstraction has 13598 states and 24037 transitions. [2020-12-23 08:26:12,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 08:26:12,652 INFO L276 IsEmpty]: Start isEmpty. Operand 13598 states and 24037 transitions. [2020-12-23 08:26:12,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-12-23 08:26:12,657 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:26:12,657 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] [2020-12-23 08:26:12,657 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-12-23 08:26:12,658 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]=== [2020-12-23 08:26:12,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:26:12,658 INFO L82 PathProgramCache]: Analyzing trace with hash 263416431, now seen corresponding path program 1 times [2020-12-23 08:26:12,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:26:12,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709854194] [2020-12-23 08:26:12,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:26:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:26:12,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:26:12,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709854194] [2020-12-23 08:26:12,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:26:12,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:26:12,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930534601] [2020-12-23 08:26:12,811 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 08:26:12,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:26:12,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 08:26:12,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 08:26:12,812 INFO L87 Difference]: Start difference. First operand 13598 states and 24037 transitions. Second operand 6 states. [2020-12-23 08:26:16,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:26:16,707 INFO L93 Difference]: Finished difference Result 43005 states and 75860 transitions. [2020-12-23 08:26:16,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-23 08:26:16,708 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2020-12-23 08:26:16,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:26:16,752 INFO L225 Difference]: With dead ends: 43005 [2020-12-23 08:26:16,752 INFO L226 Difference]: Without dead ends: 31228 [2020-12-23 08:26:16,764 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-12-23 08:26:16,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31228 states. [2020-12-23 08:26:18,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31228 to 18944. [2020-12-23 08:26:18,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18944 states. [2020-12-23 08:26:18,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18944 states to 18944 states and 33227 transitions. [2020-12-23 08:26:18,605 INFO L78 Accepts]: Start accepts. Automaton has 18944 states and 33227 transitions. Word has length 119 [2020-12-23 08:26:18,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:26:18,606 INFO L481 AbstractCegarLoop]: Abstraction has 18944 states and 33227 transitions. [2020-12-23 08:26:18,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 08:26:18,606 INFO L276 IsEmpty]: Start isEmpty. Operand 18944 states and 33227 transitions. [2020-12-23 08:26:18,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-12-23 08:26:18,610 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:26:18,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] [2020-12-23 08:26:18,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-12-23 08:26:18,610 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]=== [2020-12-23 08:26:18,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:26:18,611 INFO L82 PathProgramCache]: Analyzing trace with hash -813647057, now seen corresponding path program 1 times [2020-12-23 08:26:18,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:26:18,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915102575] [2020-12-23 08:26:18,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:26:18,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:26:18,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:26:18,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915102575] [2020-12-23 08:26:18,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:26:18,685 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 08:26:18,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542912669] [2020-12-23 08:26:18,685 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 08:26:18,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:26:18,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 08:26:18,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 08:26:18,686 INFO L87 Difference]: Start difference. First operand 18944 states and 33227 transitions. Second operand 3 states. [2020-12-23 08:26:20,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:26:20,060 INFO L93 Difference]: Finished difference Result 31335 states and 55299 transitions. [2020-12-23 08:26:20,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 08:26:20,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2020-12-23 08:26:20,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:26:20,081 INFO L225 Difference]: With dead ends: 31335 [2020-12-23 08:26:20,081 INFO L226 Difference]: Without dead ends: 16234 [2020-12-23 08:26:20,093 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 [2020-12-23 08:26:20,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16234 states. [2020-12-23 08:26:21,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16234 to 16221. [2020-12-23 08:26:21,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16221 states. [2020-12-23 08:26:21,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16221 states to 16221 states and 29016 transitions. [2020-12-23 08:26:21,498 INFO L78 Accepts]: Start accepts. Automaton has 16221 states and 29016 transitions. Word has length 119 [2020-12-23 08:26:21,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:26:21,498 INFO L481 AbstractCegarLoop]: Abstraction has 16221 states and 29016 transitions. [2020-12-23 08:26:21,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 08:26:21,499 INFO L276 IsEmpty]: Start isEmpty. Operand 16221 states and 29016 transitions. [2020-12-23 08:26:21,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-12-23 08:26:21,502 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:26:21,502 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] [2020-12-23 08:26:21,502 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-12-23 08:26:21,502 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]=== [2020-12-23 08:26:21,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:26:21,503 INFO L82 PathProgramCache]: Analyzing trace with hash 565902333, now seen corresponding path program 1 times [2020-12-23 08:26:21,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:26:21,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300567683] [2020-12-23 08:26:21,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:26:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:26:21,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:26:21,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300567683] [2020-12-23 08:26:21,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:26:21,592 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:26:21,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562533472] [2020-12-23 08:26:21,592 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:26:21,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:26:21,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:26:21,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:26:21,593 INFO L87 Difference]: Start difference. First operand 16221 states and 29016 transitions. Second operand 5 states. [2020-12-23 08:26:24,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:26:24,424 INFO L93 Difference]: Finished difference Result 46880 states and 83854 transitions. [2020-12-23 08:26:24,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:26:24,425 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2020-12-23 08:26:24,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:26:24,469 INFO L225 Difference]: With dead ends: 46880 [2020-12-23 08:26:24,469 INFO L226 Difference]: Without dead ends: 32353 [2020-12-23 08:26:24,483 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 [2020-12-23 08:26:24,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32353 states. [2020-12-23 08:26:27,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32353 to 32353. [2020-12-23 08:26:27,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32353 states. [2020-12-23 08:26:27,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32353 states to 32353 states and 57900 transitions. [2020-12-23 08:26:27,174 INFO L78 Accepts]: Start accepts. Automaton has 32353 states and 57900 transitions. Word has length 120 [2020-12-23 08:26:27,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:26:27,174 INFO L481 AbstractCegarLoop]: Abstraction has 32353 states and 57900 transitions. [2020-12-23 08:26:27,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:26:27,174 INFO L276 IsEmpty]: Start isEmpty. Operand 32353 states and 57900 transitions. [2020-12-23 08:26:27,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-12-23 08:26:27,179 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:26:27,179 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] [2020-12-23 08:26:27,180 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-12-23 08:26:27,180 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]=== [2020-12-23 08:26:27,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:26:27,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1009679480, now seen corresponding path program 1 times [2020-12-23 08:26:27,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:26:27,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259702002] [2020-12-23 08:26:27,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:26:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:26:27,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:26:27,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259702002] [2020-12-23 08:26:27,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:26:27,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:26:27,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223177508] [2020-12-23 08:26:27,255 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:26:27,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:26:27,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:26:27,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:26:27,256 INFO L87 Difference]: Start difference. First operand 32353 states and 57900 transitions. Second operand 5 states. [2020-12-23 08:26:30,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:26:30,306 INFO L93 Difference]: Finished difference Result 61345 states and 109663 transitions. [2020-12-23 08:26:30,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 08:26:30,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2020-12-23 08:26:30,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:26:30,346 INFO L225 Difference]: With dead ends: 61345 [2020-12-23 08:26:30,346 INFO L226 Difference]: Without dead ends: 30677 [2020-12-23 08:26:30,362 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 [2020-12-23 08:26:30,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30677 states. [2020-12-23 08:26:33,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30677 to 30677. [2020-12-23 08:26:33,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30677 states. [2020-12-23 08:26:33,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30677 states to 30677 states and 54833 transitions. [2020-12-23 08:26:33,360 INFO L78 Accepts]: Start accepts. Automaton has 30677 states and 54833 transitions. Word has length 121 [2020-12-23 08:26:33,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:26:33,361 INFO L481 AbstractCegarLoop]: Abstraction has 30677 states and 54833 transitions. [2020-12-23 08:26:33,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:26:33,361 INFO L276 IsEmpty]: Start isEmpty. Operand 30677 states and 54833 transitions. [2020-12-23 08:26:33,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2020-12-23 08:26:33,364 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:26:33,364 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] [2020-12-23 08:26:33,364 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-12-23 08:26:33,364 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]=== [2020-12-23 08:26:33,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:26:33,364 INFO L82 PathProgramCache]: Analyzing trace with hash -651224904, now seen corresponding path program 1 times [2020-12-23 08:26:33,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:26:33,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403983179] [2020-12-23 08:26:33,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:26:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:26:33,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:26:33,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403983179] [2020-12-23 08:26:33,484 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:26:33,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 08:26:33,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537999560] [2020-12-23 08:26:33,485 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 08:26:33,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:26:33,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 08:26:33,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 08:26:33,486 INFO L87 Difference]: Start difference. First operand 30677 states and 54833 transitions. Second operand 7 states. [2020-12-23 08:26:38,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:26:38,184 INFO L93 Difference]: Finished difference Result 51997 states and 93637 transitions. [2020-12-23 08:26:38,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 08:26:38,184 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 122 [2020-12-23 08:26:38,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:26:38,330 INFO L225 Difference]: With dead ends: 51997 [2020-12-23 08:26:38,331 INFO L226 Difference]: Without dead ends: 51982 [2020-12-23 08:26:38,341 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 [2020-12-23 08:26:38,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51982 states. [2020-12-23 08:26:41,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51982 to 30743. [2020-12-23 08:26:41,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30743 states. [2020-12-23 08:26:41,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30743 states to 30743 states and 54877 transitions. [2020-12-23 08:26:41,450 INFO L78 Accepts]: Start accepts. Automaton has 30743 states and 54877 transitions. Word has length 122 [2020-12-23 08:26:41,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:26:41,451 INFO L481 AbstractCegarLoop]: Abstraction has 30743 states and 54877 transitions. [2020-12-23 08:26:41,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 08:26:41,451 INFO L276 IsEmpty]: Start isEmpty. Operand 30743 states and 54877 transitions. [2020-12-23 08:26:41,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-12-23 08:26:41,454 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:26:41,454 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] [2020-12-23 08:26:41,454 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-12-23 08:26:41,454 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]=== [2020-12-23 08:26:41,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:26:41,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1671071108, now seen corresponding path program 1 times [2020-12-23 08:26:41,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:26:41,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813524546] [2020-12-23 08:26:41,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:26:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:26:41,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:26:41,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813524546] [2020-12-23 08:26:41,694 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:26:41,695 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 08:26:41,695 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582025484] [2020-12-23 08:26:41,695 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 08:26:41,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:26:41,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 08:26:41,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 08:26:41,696 INFO L87 Difference]: Start difference. First operand 30743 states and 54877 transitions. Second operand 7 states. [2020-12-23 08:26:56,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:26:56,457 INFO L93 Difference]: Finished difference Result 193994 states and 352007 transitions. [2020-12-23 08:26:56,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-23 08:26:56,458 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 138 [2020-12-23 08:26:56,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:26:56,988 INFO L225 Difference]: With dead ends: 193994 [2020-12-23 08:26:56,988 INFO L226 Difference]: Without dead ends: 164971 [2020-12-23 08:26:57,062 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2020-12-23 08:26:57,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164971 states. [2020-12-23 08:27:03,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164971 to 61004. [2020-12-23 08:27:03,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61004 states. [2020-12-23 08:27:03,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61004 states to 61004 states and 108955 transitions. [2020-12-23 08:27:03,987 INFO L78 Accepts]: Start accepts. Automaton has 61004 states and 108955 transitions. Word has length 138 [2020-12-23 08:27:03,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:27:03,988 INFO L481 AbstractCegarLoop]: Abstraction has 61004 states and 108955 transitions. [2020-12-23 08:27:03,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 08:27:03,988 INFO L276 IsEmpty]: Start isEmpty. Operand 61004 states and 108955 transitions. [2020-12-23 08:27:03,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-12-23 08:27:03,994 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:27:03,994 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] [2020-12-23 08:27:03,994 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-12-23 08:27:03,994 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]=== [2020-12-23 08:27:03,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:27:03,995 INFO L82 PathProgramCache]: Analyzing trace with hash 663461615, now seen corresponding path program 1 times [2020-12-23 08:27:03,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:27:03,995 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333996168] [2020-12-23 08:27:03,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:27:04,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:27:04,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:27:04,074 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333996168] [2020-12-23 08:27:04,074 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:27:04,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:27:04,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308670315] [2020-12-23 08:27:04,075 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 08:27:04,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:27:04,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 08:27:04,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 08:27:04,075 INFO L87 Difference]: Start difference. First operand 61004 states and 108955 transitions. Second operand 3 states. [2020-12-23 08:27:14,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:27:14,185 INFO L93 Difference]: Finished difference Result 159514 states and 286243 transitions. [2020-12-23 08:27:14,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 08:27:14,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2020-12-23 08:27:14,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:27:14,352 INFO L225 Difference]: With dead ends: 159514 [2020-12-23 08:27:14,353 INFO L226 Difference]: Without dead ends: 101293 [2020-12-23 08:27:14,548 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 [2020-12-23 08:27:14,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101293 states. [2020-12-23 08:27:20,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101293 to 59846. [2020-12-23 08:27:20,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59846 states. [2020-12-23 08:27:20,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59846 states to 59846 states and 106671 transitions. [2020-12-23 08:27:20,961 INFO L78 Accepts]: Start accepts. Automaton has 59846 states and 106671 transitions. Word has length 139 [2020-12-23 08:27:20,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:27:20,962 INFO L481 AbstractCegarLoop]: Abstraction has 59846 states and 106671 transitions. [2020-12-23 08:27:20,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 08:27:20,962 INFO L276 IsEmpty]: Start isEmpty. Operand 59846 states and 106671 transitions. [2020-12-23 08:27:20,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-12-23 08:27:20,967 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:27:20,967 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] [2020-12-23 08:27:20,967 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-12-23 08:27:20,967 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]=== [2020-12-23 08:27:20,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:27:20,968 INFO L82 PathProgramCache]: Analyzing trace with hash 580253490, now seen corresponding path program 1 times [2020-12-23 08:27:20,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:27:20,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287758335] [2020-12-23 08:27:20,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:27:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:27:21,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:27:21,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287758335] [2020-12-23 08:27:21,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:27:21,045 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:27:21,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412778922] [2020-12-23 08:27:21,045 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:27:21,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:27:21,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:27:21,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:27:21,046 INFO L87 Difference]: Start difference. First operand 59846 states and 106671 transitions. Second operand 5 states. [2020-12-23 08:27:29,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:27:29,368 INFO L93 Difference]: Finished difference Result 131791 states and 231256 transitions. [2020-12-23 08:27:29,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 08:27:29,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2020-12-23 08:27:29,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:27:29,475 INFO L225 Difference]: With dead ends: 131791 [2020-12-23 08:27:29,475 INFO L226 Difference]: Without dead ends: 72178 [2020-12-23 08:27:29,512 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 08:27:29,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72178 states. [2020-12-23 08:27:35,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72178 to 60113. [2020-12-23 08:27:35,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60113 states. [2020-12-23 08:27:35,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60113 states to 60113 states and 106938 transitions. [2020-12-23 08:27:35,921 INFO L78 Accepts]: Start accepts. Automaton has 60113 states and 106938 transitions. Word has length 148 [2020-12-23 08:27:35,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:27:35,921 INFO L481 AbstractCegarLoop]: Abstraction has 60113 states and 106938 transitions. [2020-12-23 08:27:35,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:27:35,921 INFO L276 IsEmpty]: Start isEmpty. Operand 60113 states and 106938 transitions. [2020-12-23 08:27:35,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-12-23 08:27:35,928 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:27:35,928 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] [2020-12-23 08:27:35,928 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-12-23 08:27:35,929 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]=== [2020-12-23 08:27:35,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:27:35,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1208925759, now seen corresponding path program 1 times [2020-12-23 08:27:35,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:27:35,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139391559] [2020-12-23 08:27:35,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:27:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:27:36,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:27:36,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139391559] [2020-12-23 08:27:36,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:27:36,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 08:27:36,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863937151] [2020-12-23 08:27:36,007 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:27:36,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:27:36,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:27:36,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:27:36,008 INFO L87 Difference]: Start difference. First operand 60113 states and 106938 transitions. Second operand 4 states. [2020-12-23 08:27:46,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:27:46,356 INFO L93 Difference]: Finished difference Result 157307 states and 278940 transitions. [2020-12-23 08:27:46,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:27:46,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2020-12-23 08:27:46,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:27:46,640 INFO L225 Difference]: With dead ends: 157307 [2020-12-23 08:27:46,640 INFO L226 Difference]: Without dead ends: 97257 [2020-12-23 08:27:46,689 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 [2020-12-23 08:27:46,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97257 states. [2020-12-23 08:27:52,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97257 to 48990. [2020-12-23 08:27:52,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48990 states. [2020-12-23 08:27:52,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48990 states to 48990 states and 86650 transitions. [2020-12-23 08:27:52,405 INFO L78 Accepts]: Start accepts. Automaton has 48990 states and 86650 transitions. Word has length 149 [2020-12-23 08:27:52,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:27:52,405 INFO L481 AbstractCegarLoop]: Abstraction has 48990 states and 86650 transitions. [2020-12-23 08:27:52,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:27:52,405 INFO L276 IsEmpty]: Start isEmpty. Operand 48990 states and 86650 transitions. [2020-12-23 08:27:52,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-12-23 08:27:52,408 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:27:52,408 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:27:52,408 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-12-23 08:27:52,408 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]=== [2020-12-23 08:27:52,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:27:52,409 INFO L82 PathProgramCache]: Analyzing trace with hash 537858221, now seen corresponding path program 1 times [2020-12-23 08:27:52,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:27:52,409 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440669703] [2020-12-23 08:27:52,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:27:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:27:52,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:27:52,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440669703] [2020-12-23 08:27:52,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:27:52,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:27:52,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473693440] [2020-12-23 08:27:52,517 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:27:52,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:27:52,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:27:52,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:27:52,518 INFO L87 Difference]: Start difference. First operand 48990 states and 86650 transitions. Second operand 5 states. [2020-12-23 08:27:58,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:27:58,088 INFO L93 Difference]: Finished difference Result 97768 states and 173022 transitions. [2020-12-23 08:27:58,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:27:58,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 178 [2020-12-23 08:27:58,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:27:58,153 INFO L225 Difference]: With dead ends: 97768 [2020-12-23 08:27:58,153 INFO L226 Difference]: Without dead ends: 49005 [2020-12-23 08:27:58,176 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 [2020-12-23 08:27:58,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49005 states. [2020-12-23 08:28:03,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49005 to 48870. [2020-12-23 08:28:03,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48870 states. [2020-12-23 08:28:03,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48870 states to 48870 states and 86450 transitions. [2020-12-23 08:28:03,513 INFO L78 Accepts]: Start accepts. Automaton has 48870 states and 86450 transitions. Word has length 178 [2020-12-23 08:28:03,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:28:03,513 INFO L481 AbstractCegarLoop]: Abstraction has 48870 states and 86450 transitions. [2020-12-23 08:28:03,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:28:03,514 INFO L276 IsEmpty]: Start isEmpty. Operand 48870 states and 86450 transitions. [2020-12-23 08:28:03,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-12-23 08:28:03,518 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:28:03,518 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:28:03,518 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-12-23 08:28:03,518 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]=== [2020-12-23 08:28:03,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:28:03,519 INFO L82 PathProgramCache]: Analyzing trace with hash 214181523, now seen corresponding path program 1 times [2020-12-23 08:28:03,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:28:03,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878965619] [2020-12-23 08:28:03,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:28:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:28:03,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:28:03,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878965619] [2020-12-23 08:28:03,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:28:03,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:28:03,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668244750] [2020-12-23 08:28:03,829 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:28:03,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:28:03,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:28:03,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:28:03,829 INFO L87 Difference]: Start difference. First operand 48870 states and 86450 transitions. Second operand 5 states. [2020-12-23 08:28:11,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:28:11,038 INFO L93 Difference]: Finished difference Result 108447 states and 191614 transitions. [2020-12-23 08:28:11,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 08:28:11,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2020-12-23 08:28:11,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:28:11,120 INFO L225 Difference]: With dead ends: 108447 [2020-12-23 08:28:11,120 INFO L226 Difference]: Without dead ends: 59804 [2020-12-23 08:28:11,151 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:28:11,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59804 states. [2020-12-23 08:28:17,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59804 to 51150. [2020-12-23 08:28:17,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51150 states. [2020-12-23 08:28:17,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51150 states to 51150 states and 90010 transitions. [2020-12-23 08:28:17,142 INFO L78 Accepts]: Start accepts. Automaton has 51150 states and 90010 transitions. Word has length 180 [2020-12-23 08:28:17,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:28:17,142 INFO L481 AbstractCegarLoop]: Abstraction has 51150 states and 90010 transitions. [2020-12-23 08:28:17,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:28:17,142 INFO L276 IsEmpty]: Start isEmpty. Operand 51150 states and 90010 transitions. [2020-12-23 08:28:17,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2020-12-23 08:28:17,145 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:28:17,145 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:28:17,145 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-12-23 08:28:17,145 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]=== [2020-12-23 08:28:17,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:28:17,146 INFO L82 PathProgramCache]: Analyzing trace with hash 6919755, now seen corresponding path program 1 times [2020-12-23 08:28:17,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:28:17,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887966963] [2020-12-23 08:28:17,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:28:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:28:17,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:28:17,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887966963] [2020-12-23 08:28:17,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:28:17,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 08:28:17,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922646995] [2020-12-23 08:28:17,258 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 08:28:17,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:28:17,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 08:28:17,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 08:28:17,259 INFO L87 Difference]: Start difference. First operand 51150 states and 90010 transitions. Second operand 5 states. [2020-12-23 08:28:27,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:28:27,926 INFO L93 Difference]: Finished difference Result 143824 states and 255781 transitions. [2020-12-23 08:28:27,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 08:28:27,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 181 [2020-12-23 08:28:27,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:28:28,080 INFO L225 Difference]: With dead ends: 143824 [2020-12-23 08:28:28,080 INFO L226 Difference]: Without dead ends: 92730 [2020-12-23 08:28:28,313 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-23 08:28:28,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92730 states. [2020-12-23 08:28:34,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92730 to 51150. [2020-12-23 08:28:34,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51150 states. [2020-12-23 08:28:34,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51150 states to 51150 states and 89183 transitions. [2020-12-23 08:28:34,602 INFO L78 Accepts]: Start accepts. Automaton has 51150 states and 89183 transitions. Word has length 181 [2020-12-23 08:28:34,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:28:34,603 INFO L481 AbstractCegarLoop]: Abstraction has 51150 states and 89183 transitions. [2020-12-23 08:28:34,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 08:28:34,603 INFO L276 IsEmpty]: Start isEmpty. Operand 51150 states and 89183 transitions. [2020-12-23 08:28:34,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2020-12-23 08:28:34,606 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:28:34,606 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:28:34,606 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-12-23 08:28:34,607 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]=== [2020-12-23 08:28:34,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:28:34,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1036279053, now seen corresponding path program 1 times [2020-12-23 08:28:34,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:28:34,607 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955189031] [2020-12-23 08:28:34,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:28:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:28:34,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:28:34,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955189031] [2020-12-23 08:28:34,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 08:28:34,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 08:28:34,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770202877] [2020-12-23 08:28:34,868 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:28:34,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:28:34,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:28:34,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 08:28:34,870 INFO L87 Difference]: Start difference. First operand 51150 states and 89183 transitions. Second operand 4 states. [2020-12-23 08:28:44,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 08:28:44,734 INFO L93 Difference]: Finished difference Result 141369 states and 250297 transitions. [2020-12-23 08:28:44,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 08:28:44,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2020-12-23 08:28:44,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 08:28:44,874 INFO L225 Difference]: With dead ends: 141369 [2020-12-23 08:28:44,874 INFO L226 Difference]: Without dead ends: 90318 [2020-12-23 08:28:44,916 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 [2020-12-23 08:28:44,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90318 states. [2020-12-23 08:28:51,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90318 to 51150. [2020-12-23 08:28:51,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51150 states. [2020-12-23 08:28:51,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51150 states to 51150 states and 88835 transitions. [2020-12-23 08:28:51,384 INFO L78 Accepts]: Start accepts. Automaton has 51150 states and 88835 transitions. Word has length 181 [2020-12-23 08:28:51,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 08:28:51,384 INFO L481 AbstractCegarLoop]: Abstraction has 51150 states and 88835 transitions. [2020-12-23 08:28:51,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 08:28:51,384 INFO L276 IsEmpty]: Start isEmpty. Operand 51150 states and 88835 transitions. [2020-12-23 08:28:51,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2020-12-23 08:28:51,388 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 08:28:51,388 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 08:28:51,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2020-12-23 08:28:51,389 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]=== [2020-12-23 08:28:51,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 08:28:51,389 INFO L82 PathProgramCache]: Analyzing trace with hash 712074857, now seen corresponding path program 1 times [2020-12-23 08:28:51,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 08:28:51,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814175950] [2020-12-23 08:28:51,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 08:28:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:28:51,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:28:51,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814175950] [2020-12-23 08:28:51,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516596439] [2020-12-23 08:28:51,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 08:28:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 08:28:51,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 1172 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 08:28:51,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 08:28:52,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 08:28:52,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 08:28:52,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2020-12-23 08:28:52,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775914715] [2020-12-23 08:28:52,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 08:28:52,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 08:28:52,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 08:28:52,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-23 08:28:52,252 INFO L87 Difference]: Start difference. First operand 51150 states and 88835 transitions. Second operand 4 states.