/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/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--ath--ath6kl--ath6kl_usb.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 01:26:27,447 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 01:26:27,452 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 01:26:27,504 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 01:26:27,505 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 01:26:27,508 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 01:26:27,512 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 01:26:27,517 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 01:26:27,520 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 01:26:27,527 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 01:26:27,530 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 01:26:27,531 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 01:26:27,532 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 01:26:27,535 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 01:26:27,537 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 01:26:27,539 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 01:26:27,540 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 01:26:27,544 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 01:26:27,561 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 01:26:27,563 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 01:26:27,564 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 01:26:27,568 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 01:26:27,569 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 01:26:27,572 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 01:26:27,575 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 01:26:27,575 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 01:26:27,576 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 01:26:27,577 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 01:26:27,577 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 01:26:27,578 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 01:26:27,578 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 01:26:27,579 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 01:26:27,580 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 01:26:27,581 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 01:26:27,582 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 01:26:27,583 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 01:26:27,583 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 01:26:27,584 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 01:26:27,584 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 01:26:27,585 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 01:26:27,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 01:26:27,588 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-07 01:26:27,614 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 01:26:27,614 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 01:26:27,616 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 01:26:27,616 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 01:26:27,616 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 01:26:27,617 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 01:26:27,617 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 01:26:27,617 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 01:26:27,617 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-07 01:26:27,618 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 01:26:27,618 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-07 01:26:27,618 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-07 01:26:27,618 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 01:26:27,618 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-07 01:26:27,619 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 01:26:27,619 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 01:26:27,619 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 01:26:27,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 01:26:27,620 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 01:26:27,620 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 01:26:27,620 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-07 01:26:27,620 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 01:26:27,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 01:26:27,621 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-07 01:26:27,621 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 01:26:27,621 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-07 01:26:27,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 01:26:28,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 01:26:28,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 01:26:28,018 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 01:26:28,019 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 01:26:28,020 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--ath--ath6kl--ath6kl_usb.ko-entry_point.cil.out.i [2021-01-07 01:26:28,094 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/cfe68e530/9d4f6ee95e12436db1d08c76ccc88b75/FLAGd9b803e7c [2021-01-07 01:26:29,080 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 01:26:29,081 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--ath--ath6kl--ath6kl_usb.ko-entry_point.cil.out.i [2021-01-07 01:26:29,132 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/cfe68e530/9d4f6ee95e12436db1d08c76ccc88b75/FLAGd9b803e7c [2021-01-07 01:26:29,562 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/cfe68e530/9d4f6ee95e12436db1d08c76ccc88b75 [2021-01-07 01:26:29,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 01:26:29,567 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 01:26:29,568 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 01:26:29,569 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 01:26:29,572 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 01:26:29,573 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 01:26:29" (1/1) ... [2021-01-07 01:26:29,574 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6855c684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:26:29, skipping insertion in model container [2021-01-07 01:26:29,574 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 01:26:29" (1/1) ... [2021-01-07 01:26:29,583 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 01:26:29,697 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] 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~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[489],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~p~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] [2021-01-07 01:26:30,655 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/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--ath--ath6kl--ath6kl_usb.ko-entry_point.cil.out.i[190557,190570] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[128],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[176],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[168],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~urb_context~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~flags~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~1,] left hand side expression in assignment: lhs: VariableLHS[~urb_context~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[193],StructAccessExpression[IdentifierExpression[~pipe,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~flags~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[193],StructAccessExpression[IdentifierExpression[~pipe,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb_context,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~urb_context,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~status~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~urb_context~1,] left hand side expression in assignment: lhs: VariableLHS[~status~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb_context~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~urb_context~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[189],StructAccessExpression[IdentifierExpression[~pipe,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~urb_context~2,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~0,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~0,] left hand side expression in assignment: address: IdentifierExpression[~urb_count,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~0,] left hand side expression in assignment: address: IdentifierExpression[~urb_count,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~0,] left hand side expression in assignment: address: IdentifierExpression[~urb_count,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~0,] left hand side expression in assignment: address: IdentifierExpression[~urb_count,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~0,] left hand side expression in assignment: address: IdentifierExpression[~urb_count,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~0,] left hand side expression in assignment: address: IdentifierExpression[~urb_count,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~0,] left hand side expression in assignment: address: IdentifierExpression[~urb_count,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~0,] left hand side expression in assignment: address: IdentifierExpression[~urb_count,] left hand side expression in assignment: lhs: VariableLHS[~interface~0,] left hand side expression in assignment: lhs: VariableLHS[~iface_desc~0,] left hand side expression in assignment: lhs: VariableLHS[~status~1,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~endpoint~0,] left hand side expression in assignment: lhs: VariableLHS[~urbcount~0,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~1,] left hand side expression in assignment: lhs: VariableLHS[~pipe~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[211],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[210],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[209],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[219],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[201],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[201],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[201],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[201],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[201],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[201],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[385],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[205],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~status~1,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~urb_context~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb_context~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~urb_context~3,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~urb~0,] left hand side expression in assignment: lhs: VariableLHS[~usb_status~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: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar_usb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2246],StructAccessExpression[IdentifierExpression[~ar_usb,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~urb_context~4,] left hand side expression in assignment: lhs: VariableLHS[~pipe~1,] left hand side expression in assignment: lhs: VariableLHS[~skb~0,] left hand side expression in assignment: lhs: VariableLHS[~status~2,] left hand side expression in assignment: lhs: VariableLHS[~status~2,] left hand side expression in assignment: lhs: VariableLHS[~status~2,] left hand side expression in assignment: lhs: VariableLHS[~skb~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb_context~4,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~urb_context~4,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~urb_context~5,] left hand side expression in assignment: lhs: VariableLHS[~pipe~2,] left hand side expression in assignment: lhs: VariableLHS[~skb~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb_context~5,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~urb_context~5,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~__mptr~2,] left hand side expression in assignment: lhs: VariableLHS[~pipe~3,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~0,] left hand side expression in assignment: lhs: VariableLHS[~skb~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~dev~0,] left hand side expression in assignment: lhs: VariableLHS[~status~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar_usb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~ar_usb~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar_usb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[76],StructAccessExpression[IdentifierExpression[~ar_usb~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: lhs: VariableLHS[~pipe~4,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~__constr_expr_0~0,],counter] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~4,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[221],StructAccessExpression[IdentifierExpression[~pipe~4,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~4,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[245],StructAccessExpression[IdentifierExpression[~pipe~4,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar_usb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3228],StructAccessExpression[IdentifierExpression[~ar_usb~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~status~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar_usb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3236],StructAccessExpression[IdentifierExpression[~ar_usb~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~status~3,] left hand side expression in assignment: lhs: VariableLHS[~status~3,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~2,] left hand side expression in assignment: lhs: VariableLHS[~__ms~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~__ms~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~device~0,] left hand side expression in assignment: lhs: VariableLHS[~i~5,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~device~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[197],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[84],StructAccessExpression[IdentifierExpression[~device~0,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[393],IdentifierExpression[~i~5,]]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~device~1,] left hand side expression in assignment: lhs: VariableLHS[~pipe~5,] left hand side expression in assignment: lhs: VariableLHS[~status~4,] left hand side expression in assignment: lhs: VariableLHS[~urb_context~6,] left hand side expression in assignment: lhs: VariableLHS[~status~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb_context~6,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~urb_context~6,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~data~0,] left hand side expression in assignment: lhs: VariableLHS[~len~0,] left hand side expression in assignment: lhs: VariableLHS[~urb~1,] left hand side expression in assignment: lhs: VariableLHS[~status~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[92],StructAccessExpression[IdentifierExpression[~urb~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~usb_status~1,] left hand side expression in assignment: lhs: VariableLHS[~status~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~device~2,] left hand side expression in assignment: address: IdentifierExpression[~ul_pipe,] left hand side expression in assignment: address: IdentifierExpression[~dl_pipe,] left hand side expression in assignment: lhs: VariableLHS[~status~5,] left hand side expression in assignment: address: IdentifierExpression[~ul_pipe,] left hand side expression in assignment: address: IdentifierExpression[~dl_pipe,] left hand side expression in assignment: address: IdentifierExpression[~ul_pipe,] left hand side expression in assignment: address: IdentifierExpression[~dl_pipe,] left hand side expression in assignment: address: IdentifierExpression[~ul_pipe,] left hand side expression in assignment: address: IdentifierExpression[~ul_pipe,] left hand side expression in assignment: address: IdentifierExpression[~dl_pipe,] left hand side expression in assignment: address: IdentifierExpression[~ul_pipe,] left hand side expression in assignment: address: IdentifierExpression[~ul_pipe,] left hand side expression in assignment: address: IdentifierExpression[~dl_pipe,] left hand side expression in assignment: lhs: VariableLHS[~status~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~device~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~device~4,] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~buf~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~buf~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: lhs: VariableLHS[~ret~1,] left hand side expression in assignment: lhs: VariableLHS[~__len~0,] left hand side expression in assignment: lhs: VariableLHS[~__ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~2,] left hand side expression in assignment: lhs: VariableLHS[~ret~2,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~3,] left hand side expression in assignment: lhs: VariableLHS[~cmd~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cmd~0,],base],StructAccessExpression[IdentifierExpression[~cmd~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cmd~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~cmd~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~resp_len~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~3,] left hand side expression in assignment: lhs: VariableLHS[~resp~0,] left hand side expression in assignment: address: IdentifierExpression[~data,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~4,] left hand side expression in assignment: lhs: VariableLHS[~cmd~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cmd~1,],base],StructAccessExpression[IdentifierExpression[~cmd~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cmd~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~cmd~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cmd~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~cmd~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~4,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~5,] left hand side expression in assignment: lhs: VariableLHS[~ret~5,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~6,] left hand side expression in assignment: lhs: VariableLHS[~ret~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~dev~1,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~7,] left hand side expression in assignment: lhs: VariableLHS[~ret~7,] left hand side expression in assignment: lhs: VariableLHS[~vendor_id~0,] left hand side expression in assignment: lhs: VariableLHS[~product_id~0,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~7,] left hand side expression in assignment: lhs: VariableLHS[~ret~7,] left hand side expression in assignment: lhs: VariableLHS[~ar~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~7,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[121],StructAccessExpression[IdentifierExpression[~ar~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[117],StructAccessExpression[IdentifierExpression[~ar~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[45],StructAccessExpression[IdentifierExpression[~ar~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[6882],StructAccessExpression[IdentifierExpression[~ar~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[37],StructAccessExpression[IdentifierExpression[~ar~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar_usb~7,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3244],StructAccessExpression[IdentifierExpression[~ar_usb~7,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] left hand side expression in assignment: lhs: VariableLHS[~tmp~24,] left hand side expression in assignment: lhs: VariableLHS[~device~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~25,] left hand side expression in assignment: lhs: VariableLHS[~device~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~26,] left hand side expression in assignment: lhs: VariableLHS[~ret~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp~27,] left hand side expression in assignment: lhs: VariableLHS[~ath6kl_usb_driver_group1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~28,] left hand side expression in assignment: lhs: VariableLHS[~ath6kl_usb_ops_group0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~29,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg18~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg11~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~3,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg12~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg8~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg13~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg10~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg9~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg6~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___11~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg15~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___12~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg16~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___13~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___14~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg14~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___15~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg17~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___16~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg19~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___17~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___18~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___19~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___20~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~30,] left hand side expression in assignment: lhs: VariableLHS[~tmp~31,] left hand side expression in assignment: lhs: VariableLHS[~tmp~32,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~usb_counter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~set,] left hand side expression in assignment: lhs: VariableLHS[~last_index~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i~6,] left hand side expression in assignment: lhs: VariableLHS[~i~6,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~set_impl~0,GLOBAL],[IdentifierExpression[~last_index~0,GLOBAL]]] left hand side expression in assignment: lhs: VariableLHS[~last_index~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~deleted_index~0,] left hand side expression in assignment: lhs: VariableLHS[~i~7,] left hand side expression in assignment: lhs: VariableLHS[~deleted_index~0,] left hand side expression in assignment: lhs: VariableLHS[~i~7,] left hand side expression in assignment: lhs: VariableLHS[~i~7,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~set_impl~0,GLOBAL],[BinaryExpression[ARITHMINUS,IdentifierExpression[~i~7,],IntegerLiteral[1]]]] left hand side expression in assignment: lhs: VariableLHS[~i~7,] left hand side expression in assignment: lhs: VariableLHS[~last_index~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i~8,] left hand side expression in assignment: lhs: VariableLHS[~i~8,] 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___8~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~2,] left hand side expression in assignment: lhs: VariableLHS[~skb~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~3,] left hand side expression in assignment: lhs: VariableLHS[~skb~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~6,] [2021-01-07 01:26:31,548 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 01:26:31,570 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] 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~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[489],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~p~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] [2021-01-07 01:26:31,822 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/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--ath--ath6kl--ath6kl_usb.ko-entry_point.cil.out.i[190557,190570] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[128],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[176],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[168],StructAccessExpression[IdentifierExpression[~urb,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~urb_context~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~flags~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~1,] left hand side expression in assignment: lhs: VariableLHS[~urb_context~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[193],StructAccessExpression[IdentifierExpression[~pipe,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~flags~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[193],StructAccessExpression[IdentifierExpression[~pipe,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb_context,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~urb_context,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~status~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~urb_context~1,] left hand side expression in assignment: lhs: VariableLHS[~status~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb_context~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~urb_context~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[189],StructAccessExpression[IdentifierExpression[~pipe,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~urb_context~2,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~0,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~0,] left hand side expression in assignment: address: IdentifierExpression[~urb_count,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~0,] left hand side expression in assignment: address: IdentifierExpression[~urb_count,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~0,] left hand side expression in assignment: address: IdentifierExpression[~urb_count,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~0,] left hand side expression in assignment: address: IdentifierExpression[~urb_count,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~0,] left hand side expression in assignment: address: IdentifierExpression[~urb_count,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~0,] left hand side expression in assignment: address: IdentifierExpression[~urb_count,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~0,] left hand side expression in assignment: address: IdentifierExpression[~urb_count,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~0,] left hand side expression in assignment: address: IdentifierExpression[~urb_count,] left hand side expression in assignment: lhs: VariableLHS[~interface~0,] left hand side expression in assignment: lhs: VariableLHS[~iface_desc~0,] left hand side expression in assignment: lhs: VariableLHS[~status~1,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~endpoint~0,] left hand side expression in assignment: address: IdentifierExpression[~#urbcount~0,] left hand side expression in assignment: lhs: VariableLHS[~pipe_num~1,] left hand side expression in assignment: lhs: VariableLHS[~pipe~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[211],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[210],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[209],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[219],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[201],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[201],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[201],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[201],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[201],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[201],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[385],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[205],StructAccessExpression[IdentifierExpression[~pipe~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~status~1,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~urb_context~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb_context~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~urb_context~3,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~urb~0,] left hand side expression in assignment: lhs: VariableLHS[~usb_status~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: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar_usb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2246],StructAccessExpression[IdentifierExpression[~ar_usb,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~urb_context~4,] left hand side expression in assignment: lhs: VariableLHS[~pipe~1,] left hand side expression in assignment: lhs: VariableLHS[~skb~0,] left hand side expression in assignment: lhs: VariableLHS[~status~2,] left hand side expression in assignment: lhs: VariableLHS[~status~2,] left hand side expression in assignment: lhs: VariableLHS[~status~2,] left hand side expression in assignment: lhs: VariableLHS[~skb~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb_context~4,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~urb_context~4,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~urb_context~5,] left hand side expression in assignment: lhs: VariableLHS[~pipe~2,] left hand side expression in assignment: lhs: VariableLHS[~skb~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb_context~5,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~urb_context~5,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~__mptr~2,] left hand side expression in assignment: lhs: VariableLHS[~pipe~3,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~0,] left hand side expression in assignment: lhs: VariableLHS[~skb~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~dev~0,] left hand side expression in assignment: lhs: VariableLHS[~status~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar_usb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~ar_usb~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar_usb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[76],StructAccessExpression[IdentifierExpression[~ar_usb~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: lhs: VariableLHS[~pipe~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],base],StructAccessExpression[IdentifierExpression[~#__constr_expr_0~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~4,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[221],StructAccessExpression[IdentifierExpression[~pipe~4,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pipe~4,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[245],StructAccessExpression[IdentifierExpression[~pipe~4,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar_usb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3228],StructAccessExpression[IdentifierExpression[~ar_usb~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~status~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar_usb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3236],StructAccessExpression[IdentifierExpression[~ar_usb~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~status~3,] left hand side expression in assignment: lhs: VariableLHS[~status~3,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~2,] left hand side expression in assignment: lhs: VariableLHS[~__ms~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~__ms~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~device~0,] left hand side expression in assignment: lhs: VariableLHS[~i~5,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~device~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[197],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[84],StructAccessExpression[IdentifierExpression[~device~0,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[393],IdentifierExpression[~i~5,]]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~device~1,] left hand side expression in assignment: lhs: VariableLHS[~pipe~5,] left hand side expression in assignment: lhs: VariableLHS[~status~4,] left hand side expression in assignment: lhs: VariableLHS[~urb_context~6,] left hand side expression in assignment: lhs: VariableLHS[~status~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb_context~6,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~urb_context~6,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~data~0,] left hand side expression in assignment: lhs: VariableLHS[~len~0,] left hand side expression in assignment: lhs: VariableLHS[~urb~1,] left hand side expression in assignment: lhs: VariableLHS[~status~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~urb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[92],StructAccessExpression[IdentifierExpression[~urb~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~usb_status~1,] left hand side expression in assignment: lhs: VariableLHS[~status~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~device~2,] left hand side expression in assignment: address: IdentifierExpression[~ul_pipe,] left hand side expression in assignment: address: IdentifierExpression[~dl_pipe,] left hand side expression in assignment: lhs: VariableLHS[~status~5,] left hand side expression in assignment: address: IdentifierExpression[~ul_pipe,] left hand side expression in assignment: address: IdentifierExpression[~dl_pipe,] left hand side expression in assignment: address: IdentifierExpression[~ul_pipe,] left hand side expression in assignment: address: IdentifierExpression[~dl_pipe,] left hand side expression in assignment: address: IdentifierExpression[~ul_pipe,] left hand side expression in assignment: address: IdentifierExpression[~ul_pipe,] left hand side expression in assignment: address: IdentifierExpression[~dl_pipe,] left hand side expression in assignment: address: IdentifierExpression[~ul_pipe,] left hand side expression in assignment: address: IdentifierExpression[~ul_pipe,] left hand side expression in assignment: address: IdentifierExpression[~dl_pipe,] left hand side expression in assignment: lhs: VariableLHS[~status~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~device~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~device~4,] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~buf~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~buf~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: lhs: VariableLHS[~ret~1,] left hand side expression in assignment: lhs: VariableLHS[~__len~0,] left hand side expression in assignment: lhs: VariableLHS[~__ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~2,] left hand side expression in assignment: lhs: VariableLHS[~ret~2,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~3,] left hand side expression in assignment: lhs: VariableLHS[~cmd~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cmd~0,],base],StructAccessExpression[IdentifierExpression[~cmd~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cmd~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~cmd~0,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~#resp_len~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~3,] left hand side expression in assignment: lhs: VariableLHS[~resp~0,] left hand side expression in assignment: address: IdentifierExpression[~data,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~4,] left hand side expression in assignment: lhs: VariableLHS[~cmd~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cmd~1,],base],StructAccessExpression[IdentifierExpression[~cmd~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cmd~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~cmd~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cmd~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~cmd~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~4,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~5,] left hand side expression in assignment: lhs: VariableLHS[~ret~5,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~6,] left hand side expression in assignment: lhs: VariableLHS[~ret~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~dev~1,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~7,] left hand side expression in assignment: lhs: VariableLHS[~ret~7,] left hand side expression in assignment: lhs: VariableLHS[~vendor_id~0,] left hand side expression in assignment: lhs: VariableLHS[~product_id~0,] left hand side expression in assignment: lhs: VariableLHS[~ar_usb~7,] left hand side expression in assignment: lhs: VariableLHS[~ret~7,] left hand side expression in assignment: lhs: VariableLHS[~ar~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~7,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[121],StructAccessExpression[IdentifierExpression[~ar~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[117],StructAccessExpression[IdentifierExpression[~ar~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[45],StructAccessExpression[IdentifierExpression[~ar~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[6882],StructAccessExpression[IdentifierExpression[~ar~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[37],StructAccessExpression[IdentifierExpression[~ar~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ar_usb~7,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3244],StructAccessExpression[IdentifierExpression[~ar_usb~7,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] left hand side expression in assignment: lhs: VariableLHS[~tmp~24,] left hand side expression in assignment: lhs: VariableLHS[~device~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~25,] left hand side expression in assignment: lhs: VariableLHS[~device~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~26,] left hand side expression in assignment: lhs: VariableLHS[~ret~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp~27,] left hand side expression in assignment: lhs: VariableLHS[~ath6kl_usb_driver_group1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~28,] left hand side expression in assignment: lhs: VariableLHS[~ath6kl_usb_ops_group0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~29,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg18~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg11~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~3,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg12~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg8~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg13~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg10~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg9~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg6~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___11~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg15~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___12~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg16~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___13~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___14~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg14~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___15~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg17~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___16~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg19~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___17~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___18~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___19~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___20~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~30,] left hand side expression in assignment: lhs: VariableLHS[~tmp~31,] left hand side expression in assignment: lhs: VariableLHS[~tmp~32,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~usb_counter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~set,] left hand side expression in assignment: lhs: VariableLHS[~last_index~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i~6,] left hand side expression in assignment: lhs: VariableLHS[~i~6,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#set_impl~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#set_impl~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~last_index~0,GLOBAL]]]]] left hand side expression in assignment: lhs: VariableLHS[~last_index~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~deleted_index~0,] left hand side expression in assignment: lhs: VariableLHS[~i~7,] left hand side expression in assignment: lhs: VariableLHS[~deleted_index~0,] left hand side expression in assignment: lhs: VariableLHS[~i~7,] left hand side expression in assignment: lhs: VariableLHS[~i~7,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#set_impl~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#set_impl~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],BinaryExpression[ARITHMINUS,IdentifierExpression[~i~7,],IntegerLiteral[1]]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~7,] left hand side expression in assignment: lhs: VariableLHS[~last_index~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i~8,] left hand side expression in assignment: lhs: VariableLHS[~i~8,] 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___8~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~2,] left hand side expression in assignment: lhs: VariableLHS[~skb~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~3,] left hand side expression in assignment: lhs: VariableLHS[~skb~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~6,] [2021-01-07 01:26:32,046 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 01:26:32,258 INFO L208 MainTranslator]: Completed translation [2021-01-07 01:26:32,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:26:32 WrapperNode [2021-01-07 01:26:32,259 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 01:26:32,260 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 01:26:32,261 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 01:26:32,261 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 01:26:32,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:26:32" (1/1) ... [2021-01-07 01:26:32,323 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:26:32" (1/1) ... [2021-01-07 01:26:32,543 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 01:26:32,547 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 01:26:32,547 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 01:26:32,548 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 01:26:32,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:26:32" (1/1) ... [2021-01-07 01:26:32,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:26:32" (1/1) ... [2021-01-07 01:26:32,622 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:26:32" (1/1) ... [2021-01-07 01:26:32,623 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:26:32" (1/1) ... [2021-01-07 01:26:32,878 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:26:32" (1/1) ... [2021-01-07 01:26:32,913 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:26:32" (1/1) ... [2021-01-07 01:26:32,941 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:26:32" (1/1) ... [2021-01-07 01:26:32,980 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 01:26:32,982 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 01:26:32,982 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 01:26:32,983 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 01:26:32,984 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:26:32" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 01:26:33,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-01-07 01:26:33,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-01-07 01:26:33,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-01-07 01:26:33,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 01:26:33,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 01:26:33,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_u16 [2021-01-07 01:26:33,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 01:26:33,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 01:26:33,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 01:26:33,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 01:26:33,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_u32 [2021-01-07 01:26:33,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 01:26:33,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-01-07 01:26:33,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 01:26:33,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-01-07 01:26:33,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_u8 [2021-01-07 01:26:33,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 01:26:33,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 01:26:43,860 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 01:26:43,860 INFO L299 CfgBuilder]: Removed 1424 assume(true) statements. [2021-01-07 01:26:43,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 01:26:43 BoogieIcfgContainer [2021-01-07 01:26:43,865 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 01:26:43,869 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 01:26:43,869 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 01:26:43,872 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 01:26:43,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 01:26:29" (1/3) ... [2021-01-07 01:26:43,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7948241a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 01:26:43, skipping insertion in model container [2021-01-07 01:26:43,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:26:32" (2/3) ... [2021-01-07 01:26:43,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7948241a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 01:26:43, skipping insertion in model container [2021-01-07 01:26:43,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 01:26:43" (3/3) ... [2021-01-07 01:26:43,876 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--ath--ath6kl--ath6kl_usb.ko-entry_point.cil.out.i [2021-01-07 01:26:43,883 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 01:26:43,889 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-07 01:26:43,911 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-07 01:26:43,962 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 01:26:43,963 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-07 01:26:43,963 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 01:26:43,963 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 01:26:43,963 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 01:26:43,963 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 01:26:43,963 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 01:26:43,964 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 01:26:44,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states. [2021-01-07 01:26:44,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-01-07 01:26:44,014 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:26:44,015 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] [2021-01-07 01:26:44,015 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:26:44,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:26:44,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1077921483, now seen corresponding path program 1 times [2021-01-07 01:26:44,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:26:44,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993723675] [2021-01-07 01:26:44,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:26:44,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:26:44,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:26:44,637 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993723675] [2021-01-07 01:26:44,638 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:26:44,638 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:26:44,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946787895] [2021-01-07 01:26:44,643 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:26:44,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:26:44,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:26:44,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:26:44,660 INFO L87 Difference]: Start difference. First operand 1211 states. Second operand 3 states. [2021-01-07 01:26:44,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:26:44,873 INFO L93 Difference]: Finished difference Result 2419 states and 3371 transitions. [2021-01-07 01:26:44,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:26:44,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2021-01-07 01:26:44,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:26:44,901 INFO L225 Difference]: With dead ends: 2419 [2021-01-07 01:26:44,902 INFO L226 Difference]: Without dead ends: 1205 [2021-01-07 01:26:44,910 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:26:44,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2021-01-07 01:26:45,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 1205. [2021-01-07 01:26:45,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2021-01-07 01:26:45,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1602 transitions. [2021-01-07 01:26:45,024 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1602 transitions. Word has length 41 [2021-01-07 01:26:45,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:26:45,025 INFO L481 AbstractCegarLoop]: Abstraction has 1205 states and 1602 transitions. [2021-01-07 01:26:45,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:26:45,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1602 transitions. [2021-01-07 01:26:45,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-01-07 01:26:45,028 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:26:45,028 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] [2021-01-07 01:26:45,029 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 01:26:45,029 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:26:45,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:26:45,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1220483567, now seen corresponding path program 1 times [2021-01-07 01:26:45,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:26:45,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925655260] [2021-01-07 01:26:45,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:26:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:26:45,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 01:26:45,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925655260] [2021-01-07 01:26:45,226 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:26:45,226 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:26:45,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821314461] [2021-01-07 01:26:45,227 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:26:45,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:26:45,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:26:45,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:26:45,229 INFO L87 Difference]: Start difference. First operand 1205 states and 1602 transitions. Second operand 3 states. [2021-01-07 01:26:47,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:26:47,404 INFO L93 Difference]: Finished difference Result 3464 states and 4626 transitions. [2021-01-07 01:26:47,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:26:47,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2021-01-07 01:26:47,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:26:47,420 INFO L225 Difference]: With dead ends: 3464 [2021-01-07 01:26:47,421 INFO L226 Difference]: Without dead ends: 2323 [2021-01-07 01:26:47,424 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:26:47,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2323 states. [2021-01-07 01:26:47,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2323 to 2323. [2021-01-07 01:26:47,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2323 states. [2021-01-07 01:26:47,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2323 states to 2323 states and 3098 transitions. [2021-01-07 01:26:47,630 INFO L78 Accepts]: Start accepts. Automaton has 2323 states and 3098 transitions. Word has length 43 [2021-01-07 01:26:47,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:26:47,631 INFO L481 AbstractCegarLoop]: Abstraction has 2323 states and 3098 transitions. [2021-01-07 01:26:47,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:26:47,632 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 3098 transitions. [2021-01-07 01:26:47,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-07 01:26:47,648 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:26:47,649 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:26:47,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 01:26:47,649 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:26:47,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:26:47,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1842814587, now seen corresponding path program 1 times [2021-01-07 01:26:47,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:26:47,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526408309] [2021-01-07 01:26:47,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:26:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:26:47,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 01:26:47,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526408309] [2021-01-07 01:26:47,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:26:47,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 01:26:47,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836452784] [2021-01-07 01:26:47,968 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 01:26:47,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:26:47,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 01:26:47,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:26:47,970 INFO L87 Difference]: Start difference. First operand 2323 states and 3098 transitions. Second operand 5 states. [2021-01-07 01:26:48,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:26:48,393 INFO L93 Difference]: Finished difference Result 6839 states and 9139 transitions. [2021-01-07 01:26:48,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 01:26:48,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2021-01-07 01:26:48,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:26:48,416 INFO L225 Difference]: With dead ends: 6839 [2021-01-07 01:26:48,417 INFO L226 Difference]: Without dead ends: 4575 [2021-01-07 01:26:48,421 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 [2021-01-07 01:26:48,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4575 states. [2021-01-07 01:26:48,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4575 to 4535. [2021-01-07 01:26:48,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4535 states. [2021-01-07 01:26:48,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4535 states to 4535 states and 6050 transitions. [2021-01-07 01:26:48,566 INFO L78 Accepts]: Start accepts. Automaton has 4535 states and 6050 transitions. Word has length 51 [2021-01-07 01:26:48,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:26:48,567 INFO L481 AbstractCegarLoop]: Abstraction has 4535 states and 6050 transitions. [2021-01-07 01:26:48,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 01:26:48,567 INFO L276 IsEmpty]: Start isEmpty. Operand 4535 states and 6050 transitions. [2021-01-07 01:26:48,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-07 01:26:48,575 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:26:48,575 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] [2021-01-07 01:26:48,576 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 01:26:48,576 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:26:48,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:26:48,577 INFO L82 PathProgramCache]: Analyzing trace with hash -683844340, now seen corresponding path program 1 times [2021-01-07 01:26:48,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:26:48,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341941856] [2021-01-07 01:26:48,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:26:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:26:48,741 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 01:26:48,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341941856] [2021-01-07 01:26:48,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:26:48,741 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:26:48,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173901251] [2021-01-07 01:26:48,742 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:26:48,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:26:48,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:26:48,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:26:48,743 INFO L87 Difference]: Start difference. First operand 4535 states and 6050 transitions. Second operand 3 states. [2021-01-07 01:26:49,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:26:49,153 INFO L93 Difference]: Finished difference Result 10801 states and 14385 transitions. [2021-01-07 01:26:49,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:26:49,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2021-01-07 01:26:49,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:26:49,186 INFO L225 Difference]: With dead ends: 10801 [2021-01-07 01:26:49,186 INFO L226 Difference]: Without dead ends: 6330 [2021-01-07 01:26:49,195 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:26:49,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6330 states. [2021-01-07 01:26:49,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6330 to 6323. [2021-01-07 01:26:49,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6323 states. [2021-01-07 01:26:49,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6323 states to 6323 states and 8402 transitions. [2021-01-07 01:26:49,480 INFO L78 Accepts]: Start accepts. Automaton has 6323 states and 8402 transitions. Word has length 100 [2021-01-07 01:26:49,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:26:49,480 INFO L481 AbstractCegarLoop]: Abstraction has 6323 states and 8402 transitions. [2021-01-07 01:26:49,481 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:26:49,481 INFO L276 IsEmpty]: Start isEmpty. Operand 6323 states and 8402 transitions. [2021-01-07 01:26:49,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-01-07 01:26:49,492 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:26:49,492 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:26:49,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-07 01:26:49,493 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:26:49,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:26:49,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1867636703, now seen corresponding path program 1 times [2021-01-07 01:26:49,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:26:49,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535947937] [2021-01-07 01:26:49,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:26:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:26:49,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 01:26:49,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535947937] [2021-01-07 01:26:49,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:26:49,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:26:49,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049431895] [2021-01-07 01:26:49,701 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:26:49,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:26:49,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:26:49,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:26:49,702 INFO L87 Difference]: Start difference. First operand 6323 states and 8402 transitions. Second operand 3 states. [2021-01-07 01:26:50,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:26:50,008 INFO L93 Difference]: Finished difference Result 15376 states and 20514 transitions. [2021-01-07 01:26:50,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:26:50,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2021-01-07 01:26:50,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:26:50,054 INFO L225 Difference]: With dead ends: 15376 [2021-01-07 01:26:50,055 INFO L226 Difference]: Without dead ends: 9117 [2021-01-07 01:26:50,068 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:26:50,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9117 states. [2021-01-07 01:26:50,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9117 to 9103. [2021-01-07 01:26:50,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9103 states. [2021-01-07 01:26:50,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9103 states to 9103 states and 12168 transitions. [2021-01-07 01:26:50,382 INFO L78 Accepts]: Start accepts. Automaton has 9103 states and 12168 transitions. Word has length 104 [2021-01-07 01:26:50,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:26:50,383 INFO L481 AbstractCegarLoop]: Abstraction has 9103 states and 12168 transitions. [2021-01-07 01:26:50,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:26:50,383 INFO L276 IsEmpty]: Start isEmpty. Operand 9103 states and 12168 transitions. [2021-01-07 01:26:50,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-01-07 01:26:50,404 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:26:50,405 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:26:50,405 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-07 01:26:50,405 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:26:50,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:26:50,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1834598712, now seen corresponding path program 1 times [2021-01-07 01:26:50,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:26:50,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413923008] [2021-01-07 01:26:50,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:26:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:26:50,736 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-07 01:26:50,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413923008] [2021-01-07 01:26:50,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:26:50,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:26:50,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039915573] [2021-01-07 01:26:50,738 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:26:50,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:26:50,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:26:50,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:26:50,740 INFO L87 Difference]: Start difference. First operand 9103 states and 12168 transitions. Second operand 3 states. [2021-01-07 01:26:51,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:26:51,294 INFO L93 Difference]: Finished difference Result 22325 states and 29891 transitions. [2021-01-07 01:26:51,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:26:51,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2021-01-07 01:26:51,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:26:51,373 INFO L225 Difference]: With dead ends: 22325 [2021-01-07 01:26:51,373 INFO L226 Difference]: Without dead ends: 17762 [2021-01-07 01:26:51,389 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:26:51,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17762 states. [2021-01-07 01:26:51,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17762 to 9143. [2021-01-07 01:26:51,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9143 states. [2021-01-07 01:26:51,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9143 states to 9143 states and 12208 transitions. [2021-01-07 01:26:51,914 INFO L78 Accepts]: Start accepts. Automaton has 9143 states and 12208 transitions. Word has length 110 [2021-01-07 01:26:51,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:26:51,922 INFO L481 AbstractCegarLoop]: Abstraction has 9143 states and 12208 transitions. [2021-01-07 01:26:51,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:26:51,923 INFO L276 IsEmpty]: Start isEmpty. Operand 9143 states and 12208 transitions. [2021-01-07 01:26:51,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-01-07 01:26:51,937 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:26:51,937 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:26:51,937 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-07 01:26:51,937 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:26:51,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:26:51,938 INFO L82 PathProgramCache]: Analyzing trace with hash 227508482, now seen corresponding path program 1 times [2021-01-07 01:26:51,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:26:51,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952832054] [2021-01-07 01:26:51,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:26:52,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:26:52,138 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-07 01:26:52,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952832054] [2021-01-07 01:26:52,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:26:52,139 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 01:26:52,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404517678] [2021-01-07 01:26:52,139 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:26:52,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:26:52,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:26:52,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:26:52,140 INFO L87 Difference]: Start difference. First operand 9143 states and 12208 transitions. Second operand 4 states. [2021-01-07 01:26:53,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:26:53,578 INFO L93 Difference]: Finished difference Result 42869 states and 57332 transitions. [2021-01-07 01:26:53,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 01:26:53,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2021-01-07 01:26:53,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:26:53,663 INFO L225 Difference]: With dead ends: 42869 [2021-01-07 01:26:53,664 INFO L226 Difference]: Without dead ends: 33790 [2021-01-07 01:26:53,688 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:26:53,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33790 states. [2021-01-07 01:26:54,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33790 to 9223. [2021-01-07 01:26:54,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9223 states. [2021-01-07 01:26:54,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9223 states to 9223 states and 12288 transitions. [2021-01-07 01:26:54,445 INFO L78 Accepts]: Start accepts. Automaton has 9223 states and 12288 transitions. Word has length 111 [2021-01-07 01:26:54,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:26:54,446 INFO L481 AbstractCegarLoop]: Abstraction has 9223 states and 12288 transitions. [2021-01-07 01:26:54,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:26:54,446 INFO L276 IsEmpty]: Start isEmpty. Operand 9223 states and 12288 transitions. [2021-01-07 01:26:54,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-01-07 01:26:54,460 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:26:54,460 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:26:54,461 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-07 01:26:54,461 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:26:54,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:26:54,462 INFO L82 PathProgramCache]: Analyzing trace with hash 796501591, now seen corresponding path program 1 times [2021-01-07 01:26:54,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:26:54,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192578554] [2021-01-07 01:26:54,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:26:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:26:54,715 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-07 01:26:54,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192578554] [2021-01-07 01:26:54,716 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:26:54,716 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 01:26:54,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927058877] [2021-01-07 01:26:54,717 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:26:54,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:26:54,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:26:54,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:26:54,718 INFO L87 Difference]: Start difference. First operand 9223 states and 12288 transitions. Second operand 4 states. [2021-01-07 01:26:57,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:26:57,712 INFO L93 Difference]: Finished difference Result 22598 states and 30118 transitions. [2021-01-07 01:26:57,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 01:26:57,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2021-01-07 01:26:57,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:26:57,744 INFO L225 Difference]: With dead ends: 22598 [2021-01-07 01:26:57,744 INFO L226 Difference]: Without dead ends: 13439 [2021-01-07 01:26:57,757 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:26:57,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13439 states. [2021-01-07 01:26:58,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13439 to 9163. [2021-01-07 01:26:58,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9163 states. [2021-01-07 01:26:58,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9163 states to 9163 states and 12168 transitions. [2021-01-07 01:26:58,230 INFO L78 Accepts]: Start accepts. Automaton has 9163 states and 12168 transitions. Word has length 112 [2021-01-07 01:26:58,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:26:58,231 INFO L481 AbstractCegarLoop]: Abstraction has 9163 states and 12168 transitions. [2021-01-07 01:26:58,231 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:26:58,231 INFO L276 IsEmpty]: Start isEmpty. Operand 9163 states and 12168 transitions. [2021-01-07 01:26:58,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-01-07 01:26:58,245 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:26:58,245 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:26:58,245 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-07 01:26:58,246 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:26:58,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:26:58,246 INFO L82 PathProgramCache]: Analyzing trace with hash 676703786, now seen corresponding path program 1 times [2021-01-07 01:26:58,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:26:58,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488922903] [2021-01-07 01:26:58,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:26:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:26:58,443 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-07 01:26:58,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488922903] [2021-01-07 01:26:58,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:26:58,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:26:58,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391673286] [2021-01-07 01:26:58,444 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:26:58,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:26:58,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:26:58,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:26:58,445 INFO L87 Difference]: Start difference. First operand 9163 states and 12168 transitions. Second operand 3 states. [2021-01-07 01:26:58,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:26:58,991 INFO L93 Difference]: Finished difference Result 18310 states and 24331 transitions. [2021-01-07 01:26:58,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:26:58,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2021-01-07 01:26:58,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:26:59,014 INFO L225 Difference]: With dead ends: 18310 [2021-01-07 01:26:59,014 INFO L226 Difference]: Without dead ends: 9211 [2021-01-07 01:26:59,027 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:26:59,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9211 states. [2021-01-07 01:26:59,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9211 to 9187. [2021-01-07 01:26:59,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9187 states. [2021-01-07 01:26:59,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9187 states to 9187 states and 12192 transitions. [2021-01-07 01:26:59,715 INFO L78 Accepts]: Start accepts. Automaton has 9187 states and 12192 transitions. Word has length 114 [2021-01-07 01:26:59,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:26:59,716 INFO L481 AbstractCegarLoop]: Abstraction has 9187 states and 12192 transitions. [2021-01-07 01:26:59,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:26:59,716 INFO L276 IsEmpty]: Start isEmpty. Operand 9187 states and 12192 transitions. [2021-01-07 01:26:59,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-07 01:26:59,732 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:26:59,732 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:26:59,732 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-07 01:26:59,733 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:26:59,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:26:59,736 INFO L82 PathProgramCache]: Analyzing trace with hash 2142614062, now seen corresponding path program 1 times [2021-01-07 01:26:59,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:26:59,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643324619] [2021-01-07 01:26:59,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:26:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:26:59,945 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-07 01:26:59,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643324619] [2021-01-07 01:26:59,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659346757] [2021-01-07 01:26:59,946 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 [2021-01-07 01:27:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:27:00,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 1697 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-07 01:27:00,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:27:00,964 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-01-07 01:27:00,964 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:27:00,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-01-07 01:27:00,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464331835] [2021-01-07 01:27:00,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 01:27:00,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:27:00,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 01:27:00,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-07 01:27:00,967 INFO L87 Difference]: Start difference. First operand 9187 states and 12192 transitions. Second operand 6 states. [2021-01-07 01:27:01,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:27:01,846 INFO L93 Difference]: Finished difference Result 18468 states and 24572 transitions. [2021-01-07 01:27:01,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 01:27:01,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 116 [2021-01-07 01:27:01,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:27:01,867 INFO L225 Difference]: With dead ends: 18468 [2021-01-07 01:27:01,867 INFO L226 Difference]: Without dead ends: 9341 [2021-01-07 01:27:01,880 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-07 01:27:01,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9341 states. [2021-01-07 01:27:02,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9341 to 9317. [2021-01-07 01:27:02,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9317 states. [2021-01-07 01:27:02,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9317 states to 9317 states and 12322 transitions. [2021-01-07 01:27:02,419 INFO L78 Accepts]: Start accepts. Automaton has 9317 states and 12322 transitions. Word has length 116 [2021-01-07 01:27:02,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:27:02,419 INFO L481 AbstractCegarLoop]: Abstraction has 9317 states and 12322 transitions. [2021-01-07 01:27:02,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 01:27:02,420 INFO L276 IsEmpty]: Start isEmpty. Operand 9317 states and 12322 transitions. [2021-01-07 01:27:02,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-01-07 01:27:02,436 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:27:02,436 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:27:02,651 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-07 01:27:02,652 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:27:02,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:27:02,653 INFO L82 PathProgramCache]: Analyzing trace with hash 938124799, now seen corresponding path program 1 times [2021-01-07 01:27:02,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:27:02,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376946051] [2021-01-07 01:27:02,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:27:02,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:27:02,830 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-07 01:27:02,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376946051] [2021-01-07 01:27:02,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:27:02,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:27:02,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847589052] [2021-01-07 01:27:02,832 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:27:02,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:27:02,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:27:02,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:27:02,833 INFO L87 Difference]: Start difference. First operand 9317 states and 12322 transitions. Second operand 3 states. [2021-01-07 01:27:05,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:27:05,475 INFO L93 Difference]: Finished difference Result 21552 states and 28612 transitions. [2021-01-07 01:27:05,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:27:05,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2021-01-07 01:27:05,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:27:05,507 INFO L225 Difference]: With dead ends: 21552 [2021-01-07 01:27:05,507 INFO L226 Difference]: Without dead ends: 12301 [2021-01-07 01:27:05,526 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:27:05,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12301 states. [2021-01-07 01:27:06,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12301 to 12287. [2021-01-07 01:27:06,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12287 states. [2021-01-07 01:27:06,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12287 states to 12287 states and 16300 transitions. [2021-01-07 01:27:06,217 INFO L78 Accepts]: Start accepts. Automaton has 12287 states and 16300 transitions. Word has length 120 [2021-01-07 01:27:06,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:27:06,217 INFO L481 AbstractCegarLoop]: Abstraction has 12287 states and 16300 transitions. [2021-01-07 01:27:06,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:27:06,217 INFO L276 IsEmpty]: Start isEmpty. Operand 12287 states and 16300 transitions. [2021-01-07 01:27:06,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-01-07 01:27:06,229 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:27:06,230 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:27:06,230 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-07 01:27:06,230 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:27:06,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:27:06,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1636329878, now seen corresponding path program 2 times [2021-01-07 01:27:06,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:27:06,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279155956] [2021-01-07 01:27:06,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:27:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:27:06,487 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-01-07 01:27:06,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279155956] [2021-01-07 01:27:06,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308707830] [2021-01-07 01:27:06,488 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:27:17,477 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 01:27:17,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 01:27:17,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 1715 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 01:27:17,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:27:17,726 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-01-07 01:27:17,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:27:17,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-01-07 01:27:17,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147303967] [2021-01-07 01:27:17,727 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 01:27:17,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:27:17,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 01:27:17,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-01-07 01:27:17,728 INFO L87 Difference]: Start difference. First operand 12287 states and 16300 transitions. Second operand 8 states. [2021-01-07 01:27:18,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:27:18,626 INFO L93 Difference]: Finished difference Result 24571 states and 32643 transitions. [2021-01-07 01:27:18,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 01:27:18,627 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 120 [2021-01-07 01:27:18,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:27:18,652 INFO L225 Difference]: With dead ends: 24571 [2021-01-07 01:27:18,652 INFO L226 Difference]: Without dead ends: 12345 [2021-01-07 01:27:18,667 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-01-07 01:27:18,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12345 states. [2021-01-07 01:27:19,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12345 to 12345. [2021-01-07 01:27:19,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12345 states. [2021-01-07 01:27:19,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12345 states to 12345 states and 16358 transitions. [2021-01-07 01:27:19,213 INFO L78 Accepts]: Start accepts. Automaton has 12345 states and 16358 transitions. Word has length 120 [2021-01-07 01:27:19,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:27:19,213 INFO L481 AbstractCegarLoop]: Abstraction has 12345 states and 16358 transitions. [2021-01-07 01:27:19,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 01:27:19,213 INFO L276 IsEmpty]: Start isEmpty. Operand 12345 states and 16358 transitions. [2021-01-07 01:27:19,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-01-07 01:27:19,225 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:27:19,225 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:27:19,426 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-01-07 01:27:19,427 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:27:19,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:27:19,428 INFO L82 PathProgramCache]: Analyzing trace with hash 441157874, now seen corresponding path program 3 times [2021-01-07 01:27:19,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:27:19,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271991853] [2021-01-07 01:27:19,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:27:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:27:19,663 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-01-07 01:27:19,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271991853] [2021-01-07 01:27:19,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242057235] [2021-01-07 01:27:19,663 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:27:31,155 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-01-07 01:27:31,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 01:27:31,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 1565 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-07 01:27:31,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:27:31,386 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-01-07 01:27:31,386 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 01:27:31,386 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2021-01-07 01:27:31,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767967456] [2021-01-07 01:27:31,387 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 01:27:31,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:27:31,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 01:27:31,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-01-07 01:27:31,388 INFO L87 Difference]: Start difference. First operand 12345 states and 16358 transitions. Second operand 5 states. [2021-01-07 01:27:34,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:27:34,969 INFO L93 Difference]: Finished difference Result 37147 states and 49410 transitions. [2021-01-07 01:27:34,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 01:27:34,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2021-01-07 01:27:34,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:27:35,026 INFO L225 Difference]: With dead ends: 37147 [2021-01-07 01:27:35,026 INFO L226 Difference]: Without dead ends: 30914 [2021-01-07 01:27:35,045 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-01-07 01:27:35,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30914 states. [2021-01-07 01:27:36,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30914 to 24719. [2021-01-07 01:27:36,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24719 states. [2021-01-07 01:27:36,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24719 states to 24719 states and 32820 transitions. [2021-01-07 01:27:36,263 INFO L78 Accepts]: Start accepts. Automaton has 24719 states and 32820 transitions. Word has length 122 [2021-01-07 01:27:36,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:27:36,263 INFO L481 AbstractCegarLoop]: Abstraction has 24719 states and 32820 transitions. [2021-01-07 01:27:36,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 01:27:36,264 INFO L276 IsEmpty]: Start isEmpty. Operand 24719 states and 32820 transitions. [2021-01-07 01:27:36,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-01-07 01:27:36,276 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:27:36,276 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:27:36,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-01-07 01:27:36,492 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:27:36,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:27:36,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1346057549, now seen corresponding path program 1 times [2021-01-07 01:27:36,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:27:36,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189872125] [2021-01-07 01:27:36,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:27:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:27:36,673 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-01-07 01:27:36,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189872125] [2021-01-07 01:27:36,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:27:36,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 01:27:36,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752008809] [2021-01-07 01:27:36,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:27:36,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:27:36,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:27:36,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:27:36,675 INFO L87 Difference]: Start difference. First operand 24719 states and 32820 transitions. Second operand 4 states. [2021-01-07 01:27:38,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:27:38,881 INFO L93 Difference]: Finished difference Result 85102 states and 113293 transitions. [2021-01-07 01:27:38,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 01:27:38,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2021-01-07 01:27:38,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:27:38,992 INFO L225 Difference]: With dead ends: 85102 [2021-01-07 01:27:38,992 INFO L226 Difference]: Without dead ends: 66495 [2021-01-07 01:27:39,024 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:27:39,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66495 states. [2021-01-07 01:27:40,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66495 to 25031. [2021-01-07 01:27:40,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25031 states. [2021-01-07 01:27:40,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25031 states to 25031 states and 33262 transitions. [2021-01-07 01:27:40,561 INFO L78 Accepts]: Start accepts. Automaton has 25031 states and 33262 transitions. Word has length 124 [2021-01-07 01:27:40,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:27:40,562 INFO L481 AbstractCegarLoop]: Abstraction has 25031 states and 33262 transitions. [2021-01-07 01:27:40,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:27:40,562 INFO L276 IsEmpty]: Start isEmpty. Operand 25031 states and 33262 transitions. [2021-01-07 01:27:40,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-01-07 01:27:40,572 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:27:40,572 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:27:40,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-07 01:27:40,572 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:27:40,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:27:40,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1586108454, now seen corresponding path program 1 times [2021-01-07 01:27:40,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:27:40,573 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873224608] [2021-01-07 01:27:40,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:27:40,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:27:40,801 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-01-07 01:27:40,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873224608] [2021-01-07 01:27:40,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180239628] [2021-01-07 01:27:40,802 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:27:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:27:41,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 1736 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-07 01:27:41,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:27:41,815 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-01-07 01:27:41,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:27:41,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-01-07 01:27:41,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542964884] [2021-01-07 01:27:41,816 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 01:27:41,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:27:41,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 01:27:41,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2021-01-07 01:27:41,817 INFO L87 Difference]: Start difference. First operand 25031 states and 33262 transitions. Second operand 10 states. [2021-01-07 01:27:43,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:27:43,059 INFO L93 Difference]: Finished difference Result 50114 states and 66678 transitions. [2021-01-07 01:27:43,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 01:27:43,060 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 126 [2021-01-07 01:27:43,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:27:43,095 INFO L225 Difference]: With dead ends: 50114 [2021-01-07 01:27:43,095 INFO L226 Difference]: Without dead ends: 25145 [2021-01-07 01:27:43,212 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2021-01-07 01:27:43,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25145 states. [2021-01-07 01:27:44,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25145 to 25145. [2021-01-07 01:27:44,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25145 states. [2021-01-07 01:27:44,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25145 states to 25145 states and 33376 transitions. [2021-01-07 01:27:44,461 INFO L78 Accepts]: Start accepts. Automaton has 25145 states and 33376 transitions. Word has length 126 [2021-01-07 01:27:44,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:27:44,461 INFO L481 AbstractCegarLoop]: Abstraction has 25145 states and 33376 transitions. [2021-01-07 01:27:44,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 01:27:44,462 INFO L276 IsEmpty]: Start isEmpty. Operand 25145 states and 33376 transitions. [2021-01-07 01:27:44,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-01-07 01:27:44,469 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:27:44,470 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:27:44,670 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:27:44,672 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:27:44,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:27:44,673 INFO L82 PathProgramCache]: Analyzing trace with hash 524798270, now seen corresponding path program 2 times [2021-01-07 01:27:44,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:27:44,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986029441] [2021-01-07 01:27:44,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:27:44,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:27:44,873 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-01-07 01:27:44,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986029441] [2021-01-07 01:27:44,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394848749] [2021-01-07 01:27:44,874 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:27:55,760 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 01:27:55,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 01:27:55,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 1748 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-07 01:27:55,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:27:55,951 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2021-01-07 01:27:56,060 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-01-07 01:27:56,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:27:56,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-01-07 01:27:56,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422271993] [2021-01-07 01:27:56,061 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 01:27:56,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:27:56,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 01:27:56,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-01-07 01:27:56,062 INFO L87 Difference]: Start difference. First operand 25145 states and 33376 transitions. Second operand 6 states. [2021-01-07 01:27:57,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:27:57,100 INFO L93 Difference]: Finished difference Result 50436 states and 66957 transitions. [2021-01-07 01:27:57,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 01:27:57,100 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2021-01-07 01:27:57,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:27:57,128 INFO L225 Difference]: With dead ends: 50436 [2021-01-07 01:27:57,128 INFO L226 Difference]: Without dead ends: 25361 [2021-01-07 01:27:57,157 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-01-07 01:27:57,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25361 states. [2021-01-07 01:27:58,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25361 to 25289. [2021-01-07 01:27:58,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25289 states. [2021-01-07 01:27:58,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25289 states to 25289 states and 33520 transitions. [2021-01-07 01:27:58,766 INFO L78 Accepts]: Start accepts. Automaton has 25289 states and 33520 transitions. Word has length 128 [2021-01-07 01:27:58,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:27:58,766 INFO L481 AbstractCegarLoop]: Abstraction has 25289 states and 33520 transitions. [2021-01-07 01:27:58,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 01:27:58,767 INFO L276 IsEmpty]: Start isEmpty. Operand 25289 states and 33520 transitions. [2021-01-07 01:27:58,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-01-07 01:27:58,775 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:27:58,775 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:27:58,980 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-01-07 01:27:58,981 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:27:58,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:27:58,982 INFO L82 PathProgramCache]: Analyzing trace with hash -2104666046, now seen corresponding path program 3 times [2021-01-07 01:27:58,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:27:58,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468980790] [2021-01-07 01:27:58,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:27:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:27:59,265 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-01-07 01:27:59,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468980790] [2021-01-07 01:27:59,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955283845] [2021-01-07 01:27:59,266 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:28:12,971 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-01-07 01:28:12,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 01:28:13,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 1565 conjuncts, 13 conjunts are in the unsatisfiable core [2021-01-07 01:28:13,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:28:13,201 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-01-07 01:28:13,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 01:28:13,201 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2021-01-07 01:28:13,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656122403] [2021-01-07 01:28:13,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 01:28:13,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:28:13,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 01:28:13,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-01-07 01:28:13,203 INFO L87 Difference]: Start difference. First operand 25289 states and 33520 transitions. Second operand 5 states. [2021-01-07 01:28:17,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:28:17,612 INFO L93 Difference]: Finished difference Result 105969 states and 142172 transitions. [2021-01-07 01:28:17,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 01:28:17,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2021-01-07 01:28:17,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:28:17,706 INFO L225 Difference]: With dead ends: 105969 [2021-01-07 01:28:17,706 INFO L226 Difference]: Without dead ends: 80750 [2021-01-07 01:28:17,734 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-01-07 01:28:17,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80750 states. [2021-01-07 01:28:19,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80750 to 25705. [2021-01-07 01:28:19,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25705 states. [2021-01-07 01:28:19,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25705 states to 25705 states and 33936 transitions. [2021-01-07 01:28:19,811 INFO L78 Accepts]: Start accepts. Automaton has 25705 states and 33936 transitions. Word has length 130 [2021-01-07 01:28:19,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:28:19,811 INFO L481 AbstractCegarLoop]: Abstraction has 25705 states and 33936 transitions. [2021-01-07 01:28:19,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 01:28:19,811 INFO L276 IsEmpty]: Start isEmpty. Operand 25705 states and 33936 transitions. [2021-01-07 01:28:19,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-01-07 01:28:19,819 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:28:19,819 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:28:20,019 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-01-07 01:28:20,020 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:28:20,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:28:20,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1471801849, now seen corresponding path program 1 times [2021-01-07 01:28:20,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:28:20,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164543913] [2021-01-07 01:28:20,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:28:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:28:20,220 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-01-07 01:28:20,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164543913] [2021-01-07 01:28:20,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080260454] [2021-01-07 01:28:20,221 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:28:20,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:28:21,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 1774 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 01:28:21,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:28:21,137 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-01-07 01:28:21,137 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:28:21,137 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-01-07 01:28:21,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902661674] [2021-01-07 01:28:21,138 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 01:28:21,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:28:21,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 01:28:21,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-07 01:28:21,139 INFO L87 Difference]: Start difference. First operand 25705 states and 33936 transitions. Second operand 7 states. [2021-01-07 01:28:22,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:28:22,620 INFO L93 Difference]: Finished difference Result 51484 states and 68005 transitions. [2021-01-07 01:28:22,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 01:28:22,621 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 131 [2021-01-07 01:28:22,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:28:22,649 INFO L225 Difference]: With dead ends: 51484 [2021-01-07 01:28:22,649 INFO L226 Difference]: Without dead ends: 25849 [2021-01-07 01:28:22,668 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-07 01:28:22,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25849 states. [2021-01-07 01:28:24,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25849 to 25849. [2021-01-07 01:28:24,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25849 states. [2021-01-07 01:28:24,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25849 states to 25849 states and 34080 transitions. [2021-01-07 01:28:24,102 INFO L78 Accepts]: Start accepts. Automaton has 25849 states and 34080 transitions. Word has length 131 [2021-01-07 01:28:24,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:28:24,102 INFO L481 AbstractCegarLoop]: Abstraction has 25849 states and 34080 transitions. [2021-01-07 01:28:24,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 01:28:24,103 INFO L276 IsEmpty]: Start isEmpty. Operand 25849 states and 34080 transitions. [2021-01-07 01:28:24,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-07 01:28:24,112 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:28:24,113 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:28:24,313 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-01-07 01:28:24,314 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:28:24,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:28:24,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1727673917, now seen corresponding path program 2 times [2021-01-07 01:28:24,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:28:24,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190709642] [2021-01-07 01:28:24,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:28:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:28:25,039 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-01-07 01:28:25,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190709642] [2021-01-07 01:28:25,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:28:25,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 01:28:25,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467950596] [2021-01-07 01:28:25,040 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:28:25,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:28:25,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:28:25,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:28:25,041 INFO L87 Difference]: Start difference. First operand 25849 states and 34080 transitions. Second operand 4 states. [2021-01-07 01:28:28,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:28:28,010 INFO L93 Difference]: Finished difference Result 38859 states and 51267 transitions. [2021-01-07 01:28:28,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 01:28:28,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2021-01-07 01:28:28,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:28:28,025 INFO L225 Difference]: With dead ends: 38859 [2021-01-07 01:28:28,025 INFO L226 Difference]: Without dead ends: 13072 [2021-01-07 01:28:28,044 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:28:28,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13072 states. [2021-01-07 01:28:28,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13072 to 12997. [2021-01-07 01:28:28,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12997 states. [2021-01-07 01:28:28,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12997 states to 12997 states and 17155 transitions. [2021-01-07 01:28:28,819 INFO L78 Accepts]: Start accepts. Automaton has 12997 states and 17155 transitions. Word has length 133 [2021-01-07 01:28:28,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:28:28,820 INFO L481 AbstractCegarLoop]: Abstraction has 12997 states and 17155 transitions. [2021-01-07 01:28:28,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:28:28,820 INFO L276 IsEmpty]: Start isEmpty. Operand 12997 states and 17155 transitions. [2021-01-07 01:28:28,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-07 01:28:28,825 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:28:28,825 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:28:28,826 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-07 01:28:28,826 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:28:28,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:28:28,826 INFO L82 PathProgramCache]: Analyzing trace with hash -151457029, now seen corresponding path program 1 times [2021-01-07 01:28:28,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:28:28,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18683614] [2021-01-07 01:28:28,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:28:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:28:29,578 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-01-07 01:28:29,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18683614] [2021-01-07 01:28:29,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:28:29,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-07 01:28:29,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038110147] [2021-01-07 01:28:29,580 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 01:28:29,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:28:29,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 01:28:29,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-01-07 01:28:29,581 INFO L87 Difference]: Start difference. First operand 12997 states and 17155 transitions. Second operand 10 states. [2021-01-07 01:28:35,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:28:35,639 INFO L93 Difference]: Finished difference Result 59069 states and 78244 transitions. [2021-01-07 01:28:35,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-07 01:28:35,641 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 133 [2021-01-07 01:28:35,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:28:35,691 INFO L225 Difference]: With dead ends: 59069 [2021-01-07 01:28:35,691 INFO L226 Difference]: Without dead ends: 46157 [2021-01-07 01:28:35,705 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2021-01-07 01:28:35,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46157 states. [2021-01-07 01:28:37,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46157 to 13153. [2021-01-07 01:28:37,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13153 states. [2021-01-07 01:28:37,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13153 states to 13153 states and 17259 transitions. [2021-01-07 01:28:37,401 INFO L78 Accepts]: Start accepts. Automaton has 13153 states and 17259 transitions. Word has length 133 [2021-01-07 01:28:37,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:28:37,402 INFO L481 AbstractCegarLoop]: Abstraction has 13153 states and 17259 transitions. [2021-01-07 01:28:37,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 01:28:37,402 INFO L276 IsEmpty]: Start isEmpty. Operand 13153 states and 17259 transitions. [2021-01-07 01:28:37,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-01-07 01:28:37,407 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:28:37,408 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:28:37,408 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-07 01:28:37,408 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:28:37,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:28:37,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1841371975, now seen corresponding path program 1 times [2021-01-07 01:28:37,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:28:37,409 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631344981] [2021-01-07 01:28:37,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:28:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:28:37,699 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-07 01:28:37,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631344981] [2021-01-07 01:28:37,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:28:37,700 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 01:28:37,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977729883] [2021-01-07 01:28:37,700 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 01:28:37,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:28:37,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 01:28:37,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:28:37,701 INFO L87 Difference]: Start difference. First operand 13153 states and 17259 transitions. Second operand 5 states. [2021-01-07 01:28:48,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:28:48,328 INFO L93 Difference]: Finished difference Result 96248 states and 128494 transitions. [2021-01-07 01:28:48,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 01:28:48,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2021-01-07 01:28:48,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:28:48,433 INFO L225 Difference]: With dead ends: 96248 [2021-01-07 01:28:48,434 INFO L226 Difference]: Without dead ends: 83180 [2021-01-07 01:28:48,458 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-07 01:28:48,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83180 states. [2021-01-07 01:28:50,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83180 to 13309. [2021-01-07 01:28:50,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13309 states. [2021-01-07 01:28:50,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13309 states to 13309 states and 17415 transitions. [2021-01-07 01:28:50,524 INFO L78 Accepts]: Start accepts. Automaton has 13309 states and 17415 transitions. Word has length 135 [2021-01-07 01:28:50,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:28:50,524 INFO L481 AbstractCegarLoop]: Abstraction has 13309 states and 17415 transitions. [2021-01-07 01:28:50,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 01:28:50,524 INFO L276 IsEmpty]: Start isEmpty. Operand 13309 states and 17415 transitions. [2021-01-07 01:28:50,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-01-07 01:28:50,528 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:28:50,528 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:28:50,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-07 01:28:50,529 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:28:50,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:28:50,529 INFO L82 PathProgramCache]: Analyzing trace with hash 618714123, now seen corresponding path program 1 times [2021-01-07 01:28:50,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:28:50,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966106458] [2021-01-07 01:28:50,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:28:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:28:51,986 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 6 [2021-01-07 01:28:52,300 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2021-01-07 01:28:52,474 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2021-01-07 01:28:53,055 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-07 01:28:53,055 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966106458] [2021-01-07 01:28:53,056 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:28:53,056 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-07 01:28:53,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200781348] [2021-01-07 01:28:53,056 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-07 01:28:53,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:28:53,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-07 01:28:53,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-01-07 01:28:53,057 INFO L87 Difference]: Start difference. First operand 13309 states and 17415 transitions. Second operand 14 states. [2021-01-07 01:29:23,188 WARN L197 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 84 [2021-01-07 01:29:24,564 WARN L197 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 105 [2021-01-07 01:29:26,877 WARN L197 SmtUtils]: Spent 785.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 118 [2021-01-07 01:29:31,015 WARN L197 SmtUtils]: Spent 901.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 142 [2021-01-07 01:29:39,220 WARN L197 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 163 DAG size of output: 154