/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--can--can-dev.ko-entry_point.cil.out.i


--------------------------------------------------------------------------------


This is Ultimate 0.2.1-bitabs-178dd20
[2021-01-07 01:22:24,646 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2021-01-07 01:22:24,650 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2021-01-07 01:22:24,702 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-01-07 01:22:24,703 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-01-07 01:22:24,705 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-01-07 01:22:24,707 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-01-07 01:22:24,710 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2021-01-07 01:22:24,712 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-01-07 01:22:24,714 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-01-07 01:22:24,715 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2021-01-07 01:22:24,717 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-01-07 01:22:24,718 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-01-07 01:22:24,720 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-01-07 01:22:24,721 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-01-07 01:22:24,723 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-01-07 01:22:24,724 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-01-07 01:22:24,726 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-01-07 01:22:24,729 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-01-07 01:22:24,732 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2021-01-07 01:22:24,734 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-01-07 01:22:24,736 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-01-07 01:22:24,738 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2021-01-07 01:22:24,740 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-01-07 01:22:24,743 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-01-07 01:22:24,755 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-01-07 01:22:24,756 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-01-07 01:22:24,757 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-01-07 01:22:24,758 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-01-07 01:22:24,762 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-01-07 01:22:24,762 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-01-07 01:22:24,763 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-01-07 01:22:24,768 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-01-07 01:22:24,769 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2021-01-07 01:22:24,771 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-01-07 01:22:24,772 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2021-01-07 01:22:24,773 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-01-07 01:22:24,774 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-01-07 01:22:24,774 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2021-01-07 01:22:24,780 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2021-01-07 01:22:24,781 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2021-01-07 01:22:24,783 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:22:24,839 INFO  L113        SettingsManager]: Loading preferences was successful
[2021-01-07 01:22:24,839 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2021-01-07 01:22:24,844 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-01-07 01:22:24,845 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2021-01-07 01:22:24,845 INFO  L138        SettingsManager]:  * Use SBE=true
[2021-01-07 01:22:24,845 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-01-07 01:22:24,845 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2021-01-07 01:22:24,845 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2021-01-07 01:22:24,846 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2021-01-07 01:22:24,846 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-01-07 01:22:24,847 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2021-01-07 01:22:24,847 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2021-01-07 01:22:24,847 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2021-01-07 01:22:24,848 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2021-01-07 01:22:24,848 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-01-07 01:22:24,848 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2021-01-07 01:22:24,848 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2021-01-07 01:22:24,849 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-01-07 01:22:24,849 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-01-07 01:22:24,849 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2021-01-07 01:22:24,849 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-01-07 01:22:24,849 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2021-01-07 01:22:24,850 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-01-07 01:22:24,850 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-01-07 01:22:24,850 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2021-01-07 01:22:24,850 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:22:25,301 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2021-01-07 01:22:25,331 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-01-07 01:22:25,334 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-01-07 01:22:25,336 INFO  L271        PluginConnector]: Initializing CDTParser...
[2021-01-07 01:22:25,337 INFO  L275        PluginConnector]: CDTParser initialized
[2021-01-07 01:22:25,338 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--can--can-dev.ko-entry_point.cil.out.i
[2021-01-07 01:22:25,424 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/4ff5746f0/e068b1bbd4e640918f3e9ea70891dec4/FLAG5c11e83fa
[2021-01-07 01:22:26,739 INFO  L306              CDTParser]: Found 1 translation units.
[2021-01-07 01:22:26,740 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--can--can-dev.ko-entry_point.cil.out.i
[2021-01-07 01:22:26,797 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/4ff5746f0/e068b1bbd4e640918f3e9ea70891dec4/FLAG5c11e83fa
[2021-01-07 01:22:27,065 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/4ff5746f0/e068b1bbd4e640918f3e9ea70891dec4
[2021-01-07 01:22:27,069 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-01-07 01:22:27,072 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2021-01-07 01:22:27,074 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-01-07 01:22:27,074 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-01-07 01:22:27,087 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2021-01-07 01:22:27,088 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 01:22:27" (1/1) ...
[2021-01-07 01:22:27,090 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6be0d1d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:22:27, skipping insertion in model container
[2021-01-07 01:22:27,091 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 01:22:27" (1/1) ...
[2021-01-07 01:22:27,101 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2021-01-07 01:22:27,260 INFO  L178         MainTranslator]: Built tables and reachable declarations
left hand side expression in assignment: lhs: VariableLHS[~tmp~0,<LOCAL,skb_shared>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb,<LOCAL,skb_reserve>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[232],StructAccessExpression[IdentifierExpression[~skb,<LOCAL,skb_reserve>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb,<LOCAL,skb_reserve>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[216],StructAccessExpression[IdentifierExpression[~skb,<LOCAL,skb_reserve>],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,<LOCAL,ldv_malloc>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~1,<LOCAL,ldv_malloc>]
left hand side expression in assignment: lhs: VariableLHS[~p~0,<LOCAL,ldv_malloc>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,<LOCAL,ldv_zalloc>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~2,<LOCAL,ldv_zalloc>]
left hand side expression in assignment: lhs: VariableLHS[~p~1,<LOCAL,ldv_zalloc>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~3,<LOCAL,ldv_undef_int>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~4,<LOCAL,ldv_undef_ulong>]
[2021-01-07 01:22:28,221 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--can--can-dev.ko-entry_point.cil.out.i[167793,167806]
left hand side expression in assignment: lhs: VariableLHS[~tmp~5,<LOCAL,netif_carrier_ok>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~6,<LOCAL,nla_total_size>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~7,<LOCAL,nla_put_u32>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~8,<LOCAL,nla_get_u32>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~9,<LOCAL,sock_put>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb,<LOCAL,can_skb_set_owner>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[136],StructAccessExpression[IdentifierExpression[~skb,<LOCAL,can_skb_set_owner>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb,<LOCAL,can_skb_set_owner>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~skb,<LOCAL,can_skb_set_owner>],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,<LOCAL,can_create_echo_skb>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~10,<LOCAL,can_create_echo_skb>]
left hand side expression in assignment: lhs: VariableLHS[~nskb~0,<LOCAL,can_create_echo_skb>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,<LOCAL,can_create_echo_skb>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~11,<LOCAL,can_len2dlc>]
left hand side expression in assignment: address: IdentifierExpression[~tseg2,<LOCAL,can_update_spt>]
left hand side expression in assignment: address: IdentifierExpression[~tseg2,<LOCAL,can_update_spt>]
left hand side expression in assignment: address: IdentifierExpression[~tseg2,<LOCAL,can_update_spt>]
left hand side expression in assignment: address: IdentifierExpression[~tseg1,<LOCAL,can_update_spt>]
left hand side expression in assignment: address: IdentifierExpression[~tseg1,<LOCAL,can_update_spt>]
left hand side expression in assignment: address: IdentifierExpression[~tseg2,<LOCAL,can_update_spt>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~12,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~priv~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~best_rate~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~best_error~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~error~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~best_tseg~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~best_brp~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~brp~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~tseg~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~tseg1~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~tseg2~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~spt_error~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~spt~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~sampl_pt~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~sampl_pt~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~sampl_pt~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~sampl_pt~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~tseg~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~tsegall~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~brp~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~brp~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~rate~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~error~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~error~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~best_error~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~spt~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~error~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~error~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~spt_error~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~best_tseg~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~best_brp~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~best_rate~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~tseg~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~error~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~v64~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~__base~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~__rem~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~v64~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],base],StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],offset]]]
left hand side expression in assignment: lhs: VariableLHS[~tmp~13,<LOCAL,can_fixup_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~priv~1,<LOCAL,can_fixup_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~tseg1~1,<LOCAL,can_fixup_bittiming>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_fixup_bittiming>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_fixup_bittiming>],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~brp64~0,<LOCAL,can_fixup_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~__base~1,<LOCAL,can_fixup_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~__rem~1,<LOCAL,can_fixup_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~brp64~0,<LOCAL,can_fixup_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~brp64~0,<LOCAL,can_fixup_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~__base___0~0,<LOCAL,can_fixup_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~__rem___0~0,<LOCAL,can_fixup_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~brp64~0,<LOCAL,can_fixup_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~brp64~0,<LOCAL,can_fixup_bittiming>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_fixup_bittiming>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_fixup_bittiming>],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~alltseg~0,<LOCAL,can_fixup_bittiming>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_fixup_bittiming>],base],StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_fixup_bittiming>],offset]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_fixup_bittiming>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_fixup_bittiming>],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~err~0,<LOCAL,can_get_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~err~0,<LOCAL,can_get_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~err~0,<LOCAL,can_get_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~14,<LOCAL,can_flush_echo_skb>]
left hand side expression in assignment: lhs: VariableLHS[~priv~2,<LOCAL,can_flush_echo_skb>]
left hand side expression in assignment: lhs: VariableLHS[~stats~0,<LOCAL,can_flush_echo_skb>]
left hand side expression in assignment: lhs: VariableLHS[~i~0,<LOCAL,can_flush_echo_skb>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem160,<LOCAL,can_flush_echo_skb>],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem160,<LOCAL,can_flush_echo_skb>],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~0,<LOCAL,can_flush_echo_skb>],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~0,<LOCAL,can_flush_echo_skb>],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~0,<LOCAL,can_flush_echo_skb>],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats~0,<LOCAL,can_flush_echo_skb>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~stats~0,<LOCAL,can_flush_echo_skb>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats~0,<LOCAL,can_flush_echo_skb>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[128],StructAccessExpression[IdentifierExpression[~stats~0,<LOCAL,can_flush_echo_skb>],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~i~0,<LOCAL,can_flush_echo_skb>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~15,<LOCAL,can_put_echo_skb>]
left hand side expression in assignment: lhs: VariableLHS[~priv~3,<LOCAL,can_put_echo_skb>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,<LOCAL,can_put_echo_skb>]
left hand side expression in assignment: lhs: VariableLHS[~skb,<LOCAL,can_put_echo_skb>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb,<LOCAL,can_put_echo_skb>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[129],StructAccessExpression[IdentifierExpression[~skb,<LOCAL,can_put_echo_skb>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb,<LOCAL,can_put_echo_skb>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[126],StructAccessExpression[IdentifierExpression[~skb,<LOCAL,can_put_echo_skb>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb,<LOCAL,can_put_echo_skb>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~skb,<LOCAL,can_put_echo_skb>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem177,<LOCAL,can_put_echo_skb>],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem177,<LOCAL,can_put_echo_skb>],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~idx,<LOCAL,can_put_echo_skb>],IntegerLiteral[4294967296]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~idx,<LOCAL,can_put_echo_skb>],IntegerLiteral[4294967296]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~idx,<LOCAL,can_put_echo_skb>],IntegerLiteral[4294967296]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]]]
left hand side expression in assignment: lhs: VariableLHS[~tmp~16,<LOCAL,can_get_echo_skb>]
left hand side expression in assignment: lhs: VariableLHS[~priv~4,<LOCAL,can_get_echo_skb>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,<LOCAL,can_get_echo_skb>]
left hand side expression in assignment: lhs: VariableLHS[~skb~0,<LOCAL,can_get_echo_skb>]
left hand side expression in assignment: lhs: VariableLHS[~cf~0,<LOCAL,can_get_echo_skb>]
left hand side expression in assignment: lhs: VariableLHS[~dlc~0,<LOCAL,can_get_echo_skb>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem193,<LOCAL,can_get_echo_skb>],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem193,<LOCAL,can_get_echo_skb>],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~idx,<LOCAL,can_get_echo_skb>],IntegerLiteral[4294967296]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~idx,<LOCAL,can_get_echo_skb>],IntegerLiteral[4294967296]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~idx,<LOCAL,can_get_echo_skb>],IntegerLiteral[4294967296]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]]]
left hand side expression in assignment: lhs: VariableLHS[~tmp~17,<LOCAL,can_free_echo_skb>]
left hand side expression in assignment: lhs: VariableLHS[~priv~5,<LOCAL,can_free_echo_skb>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,<LOCAL,can_free_echo_skb>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem201,<LOCAL,can_free_echo_skb>],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem201,<LOCAL,can_free_echo_skb>],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~idx,<LOCAL,can_free_echo_skb>],IntegerLiteral[4294967296]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~idx,<LOCAL,can_free_echo_skb>],IntegerLiteral[4294967296]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~idx,<LOCAL,can_free_echo_skb>],IntegerLiteral[4294967296]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]]]
left hand side expression in assignment: lhs: VariableLHS[~dev~0,<LOCAL,can_restart>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~18,<LOCAL,can_restart>]
left hand side expression in assignment: lhs: VariableLHS[~priv~6,<LOCAL,can_restart>]
left hand side expression in assignment: lhs: VariableLHS[~stats~1,<LOCAL,can_restart>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,<LOCAL,can_restart>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,<LOCAL,can_restart>]
left hand side expression in assignment: lhs: VariableLHS[~skb~1,<LOCAL,can_restart>]
left hand side expression in assignment: lhs: VariableLHS[~err~1,<LOCAL,can_restart>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cf~1,<LOCAL,can_restart>],base],StructAccessExpression[IdentifierExpression[~cf~1,<LOCAL,can_restart>],offset]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats~1,<LOCAL,can_restart>],base],StructAccessExpression[IdentifierExpression[~stats~1,<LOCAL,can_restart>],offset]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats~1,<LOCAL,can_restart>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~stats~1,<LOCAL,can_restart>],offset]]]]
left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~0,<LOCAL,can_restart>],modname]
left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~0,<LOCAL,can_restart>],function]
left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~0,<LOCAL,can_restart>],filename]
left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~0,<LOCAL,can_restart>],format]
left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~0,<LOCAL,can_restart>],lineno]
left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~0,<LOCAL,can_restart>],flags]
left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,<LOCAL,can_restart>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~priv~6,<LOCAL,can_restart>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~priv~6,<LOCAL,can_restart>],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~err~1,<LOCAL,can_restart>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~19,<LOCAL,can_restart_now>]
left hand side expression in assignment: lhs: VariableLHS[~priv~7,<LOCAL,can_restart_now>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~20,<LOCAL,can_bus_off>]
left hand side expression in assignment: lhs: VariableLHS[~priv~8,<LOCAL,can_bus_off>]
left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~1,<LOCAL,can_bus_off>],modname]
left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~1,<LOCAL,can_bus_off>],function]
left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~1,<LOCAL,can_bus_off>],filename]
left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~1,<LOCAL,can_bus_off>],format]
left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~1,<LOCAL,can_bus_off>],lineno]
left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~1,<LOCAL,can_bus_off>],flags]
left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,<LOCAL,can_bus_off>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~priv~8,<LOCAL,can_bus_off>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~priv~8,<LOCAL,can_bus_off>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_setup>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[532],StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_setup>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_setup>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[528],StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_setup>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_setup>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[534],StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_setup>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_setup>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[573],StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_setup>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_setup>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[909],StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_setup>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_setup>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[512],StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_setup>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_setup>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[204],StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_setup>],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~skb~2,<LOCAL,alloc_can_skb>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~21,<LOCAL,alloc_can_skb>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~2,<LOCAL,alloc_can_skb>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[134],StructAccessExpression[IdentifierExpression[~skb~2,<LOCAL,alloc_can_skb>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~2,<LOCAL,alloc_can_skb>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[129],StructAccessExpression[IdentifierExpression[~skb~2,<LOCAL,alloc_can_skb>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~2,<LOCAL,alloc_can_skb>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[126],StructAccessExpression[IdentifierExpression[~skb~2,<LOCAL,alloc_can_skb>],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,<LOCAL,alloc_can_skb>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tmp___0~9,<LOCAL,alloc_can_skb>],base],StructAccessExpression[IdentifierExpression[~tmp___0~9,<LOCAL,alloc_can_skb>],offset]]]
left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,<LOCAL,alloc_can_skb>]
left hand side expression in assignment: address: IdentifierExpression[~cf,<LOCAL,alloc_can_skb>]
left hand side expression in assignment: lhs: VariableLHS[~skb~3,<LOCAL,alloc_canfd_skb>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~22,<LOCAL,alloc_canfd_skb>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~3,<LOCAL,alloc_canfd_skb>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[134],StructAccessExpression[IdentifierExpression[~skb~3,<LOCAL,alloc_canfd_skb>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~3,<LOCAL,alloc_canfd_skb>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[129],StructAccessExpression[IdentifierExpression[~skb~3,<LOCAL,alloc_canfd_skb>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~3,<LOCAL,alloc_canfd_skb>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[126],StructAccessExpression[IdentifierExpression[~skb~3,<LOCAL,alloc_canfd_skb>],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~tmp___0~10,<LOCAL,alloc_canfd_skb>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tmp___0~10,<LOCAL,alloc_canfd_skb>],base],StructAccessExpression[IdentifierExpression[~tmp___0~10,<LOCAL,alloc_canfd_skb>],offset]]]
left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,<LOCAL,alloc_canfd_skb>]
left hand side expression in assignment: address: IdentifierExpression[~cfd,<LOCAL,alloc_canfd_skb>]
left hand side expression in assignment: lhs: VariableLHS[~skb~4,<LOCAL,alloc_can_err_skb>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~23,<LOCAL,alloc_can_err_skb>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem258,<LOCAL,alloc_can_err_skb>],base],StructAccessExpression[IdentifierExpression[#t~mem258,<LOCAL,alloc_can_err_skb>],offset]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem259,<LOCAL,alloc_can_err_skb>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[#t~mem259,<LOCAL,alloc_can_err_skb>],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~size~0,<LOCAL,alloc_candev>]
left hand side expression in assignment: lhs: VariableLHS[~size~0,<LOCAL,alloc_candev>]
left hand side expression in assignment: lhs: VariableLHS[~dev~1,<LOCAL,alloc_candev>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~24,<LOCAL,alloc_candev>]
left hand side expression in assignment: lhs: VariableLHS[~priv~9,<LOCAL,alloc_candev>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~priv~9,<LOCAL,alloc_candev>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[288],StructAccessExpression[IdentifierExpression[~priv~9,<LOCAL,alloc_candev>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~priv~9,<LOCAL,alloc_candev>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[292],StructAccessExpression[IdentifierExpression[~priv~9,<LOCAL,alloc_candev>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~priv~9,<LOCAL,alloc_candev>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[108],StructAccessExpression[IdentifierExpression[~priv~9,<LOCAL,alloc_candev>],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~tmp~25,<LOCAL,can_change_mtu>]
left hand side expression in assignment: lhs: VariableLHS[~priv~10,<LOCAL,can_change_mtu>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~priv~10,<LOCAL,can_change_mtu>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[112],StructAccessExpression[IdentifierExpression[~priv~10,<LOCAL,can_change_mtu>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~priv~10,<LOCAL,can_change_mtu>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[112],StructAccessExpression[IdentifierExpression[~priv~10,<LOCAL,can_change_mtu>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_change_mtu>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[528],StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_change_mtu>],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~tmp~26,<LOCAL,open_candev>]
left hand side expression in assignment: lhs: VariableLHS[~priv~11,<LOCAL,open_candev>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___0~11,<LOCAL,open_candev>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,<LOCAL,open_candev>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,<LOCAL,open_candev>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~27,<LOCAL,close_candev>]
left hand side expression in assignment: lhs: VariableLHS[~priv~12,<LOCAL,close_candev>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~28,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~priv~13,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___0~12,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___1~5,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~__len~0,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~__ret~0,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~__ret~0,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~err~2,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~__len___0~0,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~__ret___0~0,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~__ret___0~0,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~err~2,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~cm~0,<LOCAL,can_changelink>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~priv~13,<LOCAL,can_changelink>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[112],StructAccessExpression[IdentifierExpression[~priv~13,<LOCAL,can_changelink>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~priv~13,<LOCAL,can_changelink>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[112],StructAccessExpression[IdentifierExpression[~priv~13,<LOCAL,can_changelink>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_changelink>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[528],StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_changelink>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_changelink>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[528],StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_changelink>],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,<LOCAL,can_changelink>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~priv~13,<LOCAL,can_changelink>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[120],StructAccessExpression[IdentifierExpression[~priv~13,<LOCAL,can_changelink>],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~err~2,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~__len___1~0,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~__ret___1~0,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~__ret___1~0,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~err~2,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~__len___2~0,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~__ret___2~0,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~__ret___2~0,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~err~2,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~29,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~priv~14,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~size~1,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___0~13,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~size~1,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___1~6,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~size~1,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~size~1,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~size~1,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___4~1,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~size~1,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___5~1,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~size~1,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___6~1,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~size~1,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___7~1,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~size~1,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~size~1,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~30,<LOCAL,can_fill_info>]
left hand side expression in assignment: lhs: VariableLHS[~priv~15,<LOCAL,can_fill_info>]
left hand side expression in assignment: lhs: StructLHS[VariableLHS[~cm~1,<LOCAL,can_fill_info>],mask]
left hand side expression in assignment: lhs: StructLHS[VariableLHS[~cm~1,<LOCAL,can_fill_info>],flags]
left hand side expression in assignment: lhs: VariableLHS[~state~0,<LOCAL,can_fill_info>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___0~14,<LOCAL,can_fill_info>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___1~7,<LOCAL,can_fill_info>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___2~3,<LOCAL,can_fill_info>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___3~2,<LOCAL,can_fill_info>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___4~2,<LOCAL,can_fill_info>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___5~2,<LOCAL,can_fill_info>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___6~2,<LOCAL,can_fill_info>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___7~2,<LOCAL,can_fill_info>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___8~1,<LOCAL,can_fill_info>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,<LOCAL,can_fill_info>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~31,<LOCAL,can_fill_xstats>]
left hand side expression in assignment: lhs: VariableLHS[~priv~16,<LOCAL,can_fill_xstats>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___0~15,<LOCAL,can_fill_xstats>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,<LOCAL,register_candev>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2630],StructAccessExpression[IdentifierExpression[~dev,<LOCAL,register_candev>],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~tmp~32,<LOCAL,register_candev>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~33,<LOCAL,safe_candev_priv>]
left hand side expression in assignment: lhs: VariableLHS[~err~3,<LOCAL,can_dev_init>]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_0~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_1~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_2~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_3~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~LDV_IN_INTERRUPT~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~LDV_IN_INTERRUPT~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_state_2~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_list_2~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_state_2~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_list_2~0,GLOBAL]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ldv_timer_list_2~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~ldv_timer_list_2~0,GLOBAL],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_state_2~0,GLOBAL]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ldv_timer_list_2~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~ldv_timer_list_2~0,GLOBAL],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_state_2~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_0~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_1~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_2~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_3~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_list_1_0~0,GLOBAL]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ldv_timer_list_1_0~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~ldv_timer_list_1_0~0,GLOBAL],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_0~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_list_1_1~0,GLOBAL]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ldv_timer_list_1_1~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~ldv_timer_list_1_1~0,GLOBAL],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_1~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_list_1_2~0,GLOBAL]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ldv_timer_list_1_2~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~ldv_timer_list_1_2~0,GLOBAL],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_2~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_list_1_3~0,GLOBAL]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ldv_timer_list_1_3~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~ldv_timer_list_1_3~0,GLOBAL],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_3~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_list_1_0~0,GLOBAL]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ldv_timer_list_1_0~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~ldv_timer_list_1_0~0,GLOBAL],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_0~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_list_1_1~0,GLOBAL]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ldv_timer_list_1_1~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~ldv_timer_list_1_1~0,GLOBAL],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_1~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_list_1_2~0,GLOBAL]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ldv_timer_list_1_2~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~ldv_timer_list_1_2~0,GLOBAL],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_2~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_list_1_3~0,GLOBAL]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ldv_timer_list_1_3~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~ldv_timer_list_1_3~0,GLOBAL],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_3~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~tmp~34,<LOCAL,choose_timer_1>]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_0~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_1~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_2~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_3~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~LDV_IN_INTERRUPT~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~LDV_IN_INTERRUPT~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~tmp~35,<LOCAL,ldv_initialize_rtnl_link_ops_4>]
left hand side expression in assignment: lhs: VariableLHS[~can_link_ops_group0~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~tmp___0~16,<LOCAL,ldv_initialize_rtnl_link_ops_4>]
left hand side expression in assignment: lhs: VariableLHS[~can_link_ops_group1~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~tmp___1~8,<LOCAL,ldv_initialize_rtnl_link_ops_4>]
left hand side expression in assignment: lhs: VariableLHS[~can_link_ops_group4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~tmp___2~4,<LOCAL,ldv_initialize_rtnl_link_ops_4>]
left hand side expression in assignment: lhs: VariableLHS[~can_link_ops_group3~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~tmp___3~3,<LOCAL,ldv_initialize_rtnl_link_ops_4>]
left hand side expression in assignment: lhs: VariableLHS[~can_link_ops_group2~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~tmp~36,<LOCAL,main>]
left hand side expression in assignment: lhs: VariableLHS[~ldvarg0~0,<LOCAL,main>]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~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_0~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~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___0~17,<LOCAL,main>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___1~9,<LOCAL,main>]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~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_4~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_4~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_4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~tmp___2~5,<LOCAL,main>]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~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_0~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_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[~tmp~37,<LOCAL,ldv_netif_rx_20>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~38,<LOCAL,ldv_netif_rx_22>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~39,<LOCAL,ldv_mod_timer_23>]
left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~0,<LOCAL,ldv_mod_timer_23>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~40,<LOCAL,ldv_mod_timer_24>]
left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~1,<LOCAL,ldv_mod_timer_24>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~41,<LOCAL,ldv_netdev_alloc_skb_25>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~42,<LOCAL,ldv_del_timer_sync_27>]
left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~2,<LOCAL,ldv_del_timer_sync_27>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~43,<LOCAL,can_led_event>]
left hand side expression in assignment: lhs: VariableLHS[~priv~17,<LOCAL,can_led_event>]
left hand side expression in assignment: lhs: VariableLHS[~__mptr~0,<LOCAL,can_led_release>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~44,<LOCAL,can_led_release>]
left hand side expression in assignment: lhs: VariableLHS[~priv~18,<LOCAL,can_led_release>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~45,<LOCAL,devm_can_led_init>]
left hand side expression in assignment: lhs: VariableLHS[~priv~19,<LOCAL,devm_can_led_init>]
left hand side expression in assignment: lhs: VariableLHS[~res~0,<LOCAL,devm_can_led_init>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~46,<LOCAL,can_led_notifier>]
left hand side expression in assignment: lhs: VariableLHS[~netdev~0,<LOCAL,can_led_notifier>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___0~18,<LOCAL,can_led_notifier>]
left hand side expression in assignment: lhs: VariableLHS[~priv~20,<LOCAL,can_led_notifier>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~47,<LOCAL,can_led_notifier_init>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~48,<LOCAL,ldv_main_exported_3>]
left hand side expression in assignment: lhs: VariableLHS[~ldvarg2~0,<LOCAL,ldv_main_exported_3>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___0~19,<LOCAL,ldv_main_exported_3>]
left hand side expression in assignment: lhs: VariableLHS[~ldvarg3~0,<LOCAL,ldv_main_exported_3>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___1~10,<LOCAL,ldv_main_exported_3>]
left hand side expression in assignment: lhs: VariableLHS[~ldvarg1~0,<LOCAL,ldv_main_exported_3>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___2~6,<LOCAL,ldv_main_exported_3>]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~set,<LOCAL,ldv_set_init>]
left hand side expression in assignment: lhs: VariableLHS[~last_index~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~i~1,<LOCAL,ldv_set_add>]
left hand side expression in assignment: lhs: VariableLHS[~i~1,<LOCAL,ldv_set_add>]
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,<LOCAL,ldv_set_remove>]
left hand side expression in assignment: lhs: VariableLHS[~i~2,<LOCAL,ldv_set_remove>]
left hand side expression in assignment: lhs: VariableLHS[~deleted_index~0,<LOCAL,ldv_set_remove>]
left hand side expression in assignment: lhs: VariableLHS[~i~2,<LOCAL,ldv_set_remove>]
left hand side expression in assignment: lhs: VariableLHS[~i~2,<LOCAL,ldv_set_remove>]
left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~set_impl~0,GLOBAL],[BinaryExpression[ARITHMINUS,IdentifierExpression[~i~2,<LOCAL,ldv_set_remove>],IntegerLiteral[1]]]]
left hand side expression in assignment: lhs: VariableLHS[~i~2,<LOCAL,ldv_set_remove>]
left hand side expression in assignment: lhs: VariableLHS[~last_index~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~i~3,<LOCAL,ldv_set_contains>]
left hand side expression in assignment: lhs: VariableLHS[~i~3,<LOCAL,ldv_set_contains>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___8~2,<LOCAL,ldv_is_err_or_null>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___7~3,<LOCAL,ldv_is_err_or_null>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___8~2,<LOCAL,ldv_is_err_or_null>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___8~2,<LOCAL,ldv_is_err_or_null>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___7~4,<LOCAL,ldv_skb_alloc>]
left hand side expression in assignment: lhs: VariableLHS[~skb~5,<LOCAL,ldv_skb_alloc>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___7~5,<LOCAL,ldv_dev_alloc_skb>]
left hand side expression in assignment: lhs: VariableLHS[~skb~6,<LOCAL,ldv_dev_alloc_skb>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___7~6,<LOCAL,ldv_netdev_alloc_skb>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___7~7,<LOCAL,ldv_skb_current>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___7~8,<LOCAL,ldv_check_final_state>]
[2021-01-07 01:22:29,164 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-01-07 01:22:29,253 INFO  L203         MainTranslator]: Completed pre-run
left hand side expression in assignment: lhs: VariableLHS[~tmp~0,<LOCAL,skb_shared>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb,<LOCAL,skb_reserve>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[232],StructAccessExpression[IdentifierExpression[~skb,<LOCAL,skb_reserve>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb,<LOCAL,skb_reserve>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[216],StructAccessExpression[IdentifierExpression[~skb,<LOCAL,skb_reserve>],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,<LOCAL,ldv_malloc>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~1,<LOCAL,ldv_malloc>]
left hand side expression in assignment: lhs: VariableLHS[~p~0,<LOCAL,ldv_malloc>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,<LOCAL,ldv_zalloc>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~2,<LOCAL,ldv_zalloc>]
left hand side expression in assignment: lhs: VariableLHS[~p~1,<LOCAL,ldv_zalloc>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~3,<LOCAL,ldv_undef_int>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~4,<LOCAL,ldv_undef_ulong>]
[2021-01-07 01:22:29,509 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--can--can-dev.ko-entry_point.cil.out.i[167793,167806]
left hand side expression in assignment: lhs: VariableLHS[~tmp~5,<LOCAL,netif_carrier_ok>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~6,<LOCAL,nla_total_size>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~7,<LOCAL,nla_put_u32>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~8,<LOCAL,nla_get_u32>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~9,<LOCAL,sock_put>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb,<LOCAL,can_skb_set_owner>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[136],StructAccessExpression[IdentifierExpression[~skb,<LOCAL,can_skb_set_owner>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb,<LOCAL,can_skb_set_owner>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~skb,<LOCAL,can_skb_set_owner>],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,<LOCAL,can_create_echo_skb>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~10,<LOCAL,can_create_echo_skb>]
left hand side expression in assignment: lhs: VariableLHS[~nskb~0,<LOCAL,can_create_echo_skb>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,<LOCAL,can_create_echo_skb>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~11,<LOCAL,can_len2dlc>]
left hand side expression in assignment: address: IdentifierExpression[~tseg2,<LOCAL,can_update_spt>]
left hand side expression in assignment: address: IdentifierExpression[~tseg2,<LOCAL,can_update_spt>]
left hand side expression in assignment: address: IdentifierExpression[~tseg2,<LOCAL,can_update_spt>]
left hand side expression in assignment: address: IdentifierExpression[~tseg1,<LOCAL,can_update_spt>]
left hand side expression in assignment: address: IdentifierExpression[~tseg1,<LOCAL,can_update_spt>]
left hand side expression in assignment: address: IdentifierExpression[~tseg2,<LOCAL,can_update_spt>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~12,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~priv~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~best_rate~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~best_error~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~error~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~best_tseg~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~best_brp~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~brp~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~tseg~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: address: IdentifierExpression[~#tseg1~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: address: IdentifierExpression[~#tseg2~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~spt_error~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~spt~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~sampl_pt~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~sampl_pt~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~sampl_pt~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~sampl_pt~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~tseg~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~tsegall~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~brp~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~brp~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~rate~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~error~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~error~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~best_error~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~spt~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~error~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~error~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~spt_error~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~best_tseg~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~best_brp~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~best_rate~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~tseg~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~error~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~v64~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~__base~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~__rem~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~v64~0,<LOCAL,can_calc_bittiming>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],base],StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_calc_bittiming>],offset]]]
left hand side expression in assignment: lhs: VariableLHS[~tmp~13,<LOCAL,can_fixup_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~priv~1,<LOCAL,can_fixup_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~tseg1~1,<LOCAL,can_fixup_bittiming>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_fixup_bittiming>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_fixup_bittiming>],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~brp64~0,<LOCAL,can_fixup_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~__base~1,<LOCAL,can_fixup_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~__rem~1,<LOCAL,can_fixup_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~brp64~0,<LOCAL,can_fixup_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~brp64~0,<LOCAL,can_fixup_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~__base___0~0,<LOCAL,can_fixup_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~__rem___0~0,<LOCAL,can_fixup_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~brp64~0,<LOCAL,can_fixup_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~brp64~0,<LOCAL,can_fixup_bittiming>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_fixup_bittiming>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_fixup_bittiming>],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~alltseg~0,<LOCAL,can_fixup_bittiming>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_fixup_bittiming>],base],StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_fixup_bittiming>],offset]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_fixup_bittiming>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~bt,<LOCAL,can_fixup_bittiming>],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~err~0,<LOCAL,can_get_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~err~0,<LOCAL,can_get_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~err~0,<LOCAL,can_get_bittiming>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~14,<LOCAL,can_flush_echo_skb>]
left hand side expression in assignment: lhs: VariableLHS[~priv~2,<LOCAL,can_flush_echo_skb>]
left hand side expression in assignment: lhs: VariableLHS[~stats~0,<LOCAL,can_flush_echo_skb>]
left hand side expression in assignment: lhs: VariableLHS[~i~0,<LOCAL,can_flush_echo_skb>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem169,<LOCAL,can_flush_echo_skb>],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem169,<LOCAL,can_flush_echo_skb>],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~0,<LOCAL,can_flush_echo_skb>],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~0,<LOCAL,can_flush_echo_skb>],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~0,<LOCAL,can_flush_echo_skb>],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats~0,<LOCAL,can_flush_echo_skb>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~stats~0,<LOCAL,can_flush_echo_skb>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats~0,<LOCAL,can_flush_echo_skb>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[128],StructAccessExpression[IdentifierExpression[~stats~0,<LOCAL,can_flush_echo_skb>],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~i~0,<LOCAL,can_flush_echo_skb>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~15,<LOCAL,can_put_echo_skb>]
left hand side expression in assignment: lhs: VariableLHS[~priv~3,<LOCAL,can_put_echo_skb>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,<LOCAL,can_put_echo_skb>]
left hand side expression in assignment: lhs: VariableLHS[~skb,<LOCAL,can_put_echo_skb>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb,<LOCAL,can_put_echo_skb>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[129],StructAccessExpression[IdentifierExpression[~skb,<LOCAL,can_put_echo_skb>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb,<LOCAL,can_put_echo_skb>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[126],StructAccessExpression[IdentifierExpression[~skb,<LOCAL,can_put_echo_skb>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb,<LOCAL,can_put_echo_skb>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~skb,<LOCAL,can_put_echo_skb>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem186,<LOCAL,can_put_echo_skb>],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem186,<LOCAL,can_put_echo_skb>],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~idx,<LOCAL,can_put_echo_skb>],IntegerLiteral[4294967296]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~idx,<LOCAL,can_put_echo_skb>],IntegerLiteral[4294967296]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~idx,<LOCAL,can_put_echo_skb>],IntegerLiteral[4294967296]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]]]
left hand side expression in assignment: lhs: VariableLHS[~tmp~16,<LOCAL,can_get_echo_skb>]
left hand side expression in assignment: lhs: VariableLHS[~priv~4,<LOCAL,can_get_echo_skb>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,<LOCAL,can_get_echo_skb>]
left hand side expression in assignment: lhs: VariableLHS[~skb~0,<LOCAL,can_get_echo_skb>]
left hand side expression in assignment: lhs: VariableLHS[~cf~0,<LOCAL,can_get_echo_skb>]
left hand side expression in assignment: lhs: VariableLHS[~dlc~0,<LOCAL,can_get_echo_skb>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem202,<LOCAL,can_get_echo_skb>],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem202,<LOCAL,can_get_echo_skb>],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~idx,<LOCAL,can_get_echo_skb>],IntegerLiteral[4294967296]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~idx,<LOCAL,can_get_echo_skb>],IntegerLiteral[4294967296]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~idx,<LOCAL,can_get_echo_skb>],IntegerLiteral[4294967296]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]]]
left hand side expression in assignment: lhs: VariableLHS[~tmp~17,<LOCAL,can_free_echo_skb>]
left hand side expression in assignment: lhs: VariableLHS[~priv~5,<LOCAL,can_free_echo_skb>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,<LOCAL,can_free_echo_skb>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem210,<LOCAL,can_free_echo_skb>],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem210,<LOCAL,can_free_echo_skb>],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~idx,<LOCAL,can_free_echo_skb>],IntegerLiteral[4294967296]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~idx,<LOCAL,can_free_echo_skb>],IntegerLiteral[4294967296]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~idx,<LOCAL,can_free_echo_skb>],IntegerLiteral[4294967296]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]]]
left hand side expression in assignment: lhs: VariableLHS[~dev~0,<LOCAL,can_restart>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~18,<LOCAL,can_restart>]
left hand side expression in assignment: lhs: VariableLHS[~priv~6,<LOCAL,can_restart>]
left hand side expression in assignment: lhs: VariableLHS[~stats~1,<LOCAL,can_restart>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,<LOCAL,can_restart>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,<LOCAL,can_restart>]
left hand side expression in assignment: lhs: VariableLHS[~skb~1,<LOCAL,can_restart>]
left hand side expression in assignment: lhs: VariableLHS[~err~1,<LOCAL,can_restart>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem215,<LOCAL,can_restart>],base],StructAccessExpression[IdentifierExpression[#t~mem215,<LOCAL,can_restart>],offset]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats~1,<LOCAL,can_restart>],base],StructAccessExpression[IdentifierExpression[~stats~1,<LOCAL,can_restart>],offset]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats~1,<LOCAL,can_restart>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~stats~1,<LOCAL,can_restart>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~0,<LOCAL,can_restart>],base],StructAccessExpression[IdentifierExpression[~#descriptor~0,<LOCAL,can_restart>],offset]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~0,<LOCAL,can_restart>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#descriptor~0,<LOCAL,can_restart>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~0,<LOCAL,can_restart>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~#descriptor~0,<LOCAL,can_restart>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~0,<LOCAL,can_restart>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~#descriptor~0,<LOCAL,can_restart>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~0,<LOCAL,can_restart>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~#descriptor~0,<LOCAL,can_restart>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~0,<LOCAL,can_restart>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~#descriptor~0,<LOCAL,can_restart>],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,<LOCAL,can_restart>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~priv~6,<LOCAL,can_restart>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~priv~6,<LOCAL,can_restart>],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~err~1,<LOCAL,can_restart>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~19,<LOCAL,can_restart_now>]
left hand side expression in assignment: lhs: VariableLHS[~priv~7,<LOCAL,can_restart_now>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~20,<LOCAL,can_bus_off>]
left hand side expression in assignment: lhs: VariableLHS[~priv~8,<LOCAL,can_bus_off>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~1,<LOCAL,can_bus_off>],base],StructAccessExpression[IdentifierExpression[~#descriptor~1,<LOCAL,can_bus_off>],offset]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~1,<LOCAL,can_bus_off>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#descriptor~1,<LOCAL,can_bus_off>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~1,<LOCAL,can_bus_off>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~#descriptor~1,<LOCAL,can_bus_off>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~1,<LOCAL,can_bus_off>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~#descriptor~1,<LOCAL,can_bus_off>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~1,<LOCAL,can_bus_off>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~#descriptor~1,<LOCAL,can_bus_off>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~1,<LOCAL,can_bus_off>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~#descriptor~1,<LOCAL,can_bus_off>],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,<LOCAL,can_bus_off>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~priv~8,<LOCAL,can_bus_off>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~priv~8,<LOCAL,can_bus_off>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_setup>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[532],StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_setup>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_setup>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[528],StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_setup>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_setup>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[534],StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_setup>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_setup>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[573],StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_setup>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_setup>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[909],StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_setup>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_setup>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[512],StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_setup>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_setup>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[204],StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_setup>],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~skb~2,<LOCAL,alloc_can_skb>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~21,<LOCAL,alloc_can_skb>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~2,<LOCAL,alloc_can_skb>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[134],StructAccessExpression[IdentifierExpression[~skb~2,<LOCAL,alloc_can_skb>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~2,<LOCAL,alloc_can_skb>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[129],StructAccessExpression[IdentifierExpression[~skb~2,<LOCAL,alloc_can_skb>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~2,<LOCAL,alloc_can_skb>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[126],StructAccessExpression[IdentifierExpression[~skb~2,<LOCAL,alloc_can_skb>],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,<LOCAL,alloc_can_skb>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tmp___0~9,<LOCAL,alloc_can_skb>],base],StructAccessExpression[IdentifierExpression[~tmp___0~9,<LOCAL,alloc_can_skb>],offset]]]
left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,<LOCAL,alloc_can_skb>]
left hand side expression in assignment: address: IdentifierExpression[~cf,<LOCAL,alloc_can_skb>]
left hand side expression in assignment: lhs: VariableLHS[~skb~3,<LOCAL,alloc_canfd_skb>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~22,<LOCAL,alloc_canfd_skb>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~3,<LOCAL,alloc_canfd_skb>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[134],StructAccessExpression[IdentifierExpression[~skb~3,<LOCAL,alloc_canfd_skb>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~3,<LOCAL,alloc_canfd_skb>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[129],StructAccessExpression[IdentifierExpression[~skb~3,<LOCAL,alloc_canfd_skb>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~3,<LOCAL,alloc_canfd_skb>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[126],StructAccessExpression[IdentifierExpression[~skb~3,<LOCAL,alloc_canfd_skb>],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~tmp___0~10,<LOCAL,alloc_canfd_skb>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tmp___0~10,<LOCAL,alloc_canfd_skb>],base],StructAccessExpression[IdentifierExpression[~tmp___0~10,<LOCAL,alloc_canfd_skb>],offset]]]
left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,<LOCAL,alloc_canfd_skb>]
left hand side expression in assignment: address: IdentifierExpression[~cfd,<LOCAL,alloc_canfd_skb>]
left hand side expression in assignment: lhs: VariableLHS[~skb~4,<LOCAL,alloc_can_err_skb>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~23,<LOCAL,alloc_can_err_skb>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem272,<LOCAL,alloc_can_err_skb>],base],StructAccessExpression[IdentifierExpression[#t~mem272,<LOCAL,alloc_can_err_skb>],offset]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem273,<LOCAL,alloc_can_err_skb>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[#t~mem273,<LOCAL,alloc_can_err_skb>],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~size~0,<LOCAL,alloc_candev>]
left hand side expression in assignment: lhs: VariableLHS[~size~0,<LOCAL,alloc_candev>]
left hand side expression in assignment: lhs: VariableLHS[~dev~1,<LOCAL,alloc_candev>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~24,<LOCAL,alloc_candev>]
left hand side expression in assignment: lhs: VariableLHS[~priv~9,<LOCAL,alloc_candev>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~priv~9,<LOCAL,alloc_candev>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[288],StructAccessExpression[IdentifierExpression[~priv~9,<LOCAL,alloc_candev>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~priv~9,<LOCAL,alloc_candev>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[292],StructAccessExpression[IdentifierExpression[~priv~9,<LOCAL,alloc_candev>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~priv~9,<LOCAL,alloc_candev>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[108],StructAccessExpression[IdentifierExpression[~priv~9,<LOCAL,alloc_candev>],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~tmp~25,<LOCAL,can_change_mtu>]
left hand side expression in assignment: lhs: VariableLHS[~priv~10,<LOCAL,can_change_mtu>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~priv~10,<LOCAL,can_change_mtu>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[112],StructAccessExpression[IdentifierExpression[~priv~10,<LOCAL,can_change_mtu>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~priv~10,<LOCAL,can_change_mtu>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[112],StructAccessExpression[IdentifierExpression[~priv~10,<LOCAL,can_change_mtu>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_change_mtu>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[528],StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_change_mtu>],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~tmp~26,<LOCAL,open_candev>]
left hand side expression in assignment: lhs: VariableLHS[~priv~11,<LOCAL,open_candev>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___0~11,<LOCAL,open_candev>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,<LOCAL,open_candev>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,<LOCAL,open_candev>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~27,<LOCAL,close_candev>]
left hand side expression in assignment: lhs: VariableLHS[~priv~12,<LOCAL,close_candev>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~28,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~priv~13,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___0~12,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___1~5,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~__len~0,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~__ret~0,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~__ret~0,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~err~2,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~__len___0~0,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~__ret___0~0,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~__ret___0~0,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~err~2,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~cm~0,<LOCAL,can_changelink>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~priv~13,<LOCAL,can_changelink>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[112],StructAccessExpression[IdentifierExpression[~priv~13,<LOCAL,can_changelink>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~priv~13,<LOCAL,can_changelink>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[112],StructAccessExpression[IdentifierExpression[~priv~13,<LOCAL,can_changelink>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_changelink>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[528],StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_changelink>],offset]]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_changelink>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[528],StructAccessExpression[IdentifierExpression[~dev,<LOCAL,can_changelink>],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,<LOCAL,can_changelink>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~priv~13,<LOCAL,can_changelink>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[120],StructAccessExpression[IdentifierExpression[~priv~13,<LOCAL,can_changelink>],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~err~2,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~__len___1~0,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~__ret___1~0,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~__ret___1~0,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~err~2,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~__len___2~0,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~__ret___2~0,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~__ret___2~0,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~err~2,<LOCAL,can_changelink>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~29,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~priv~14,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~size~1,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___0~13,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~size~1,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___1~6,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~size~1,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~size~1,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~size~1,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___4~1,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~size~1,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___5~1,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~size~1,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___6~1,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~size~1,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___7~1,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~size~1,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~size~1,<LOCAL,can_get_size>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~30,<LOCAL,can_fill_info>]
left hand side expression in assignment: lhs: VariableLHS[~priv~15,<LOCAL,can_fill_info>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#cm~1,<LOCAL,can_fill_info>],base],StructAccessExpression[IdentifierExpression[~#cm~1,<LOCAL,can_fill_info>],offset]]]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#cm~1,<LOCAL,can_fill_info>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#cm~1,<LOCAL,can_fill_info>],offset]]]]
left hand side expression in assignment: address: IdentifierExpression[~#state~0,<LOCAL,can_fill_info>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___0~14,<LOCAL,can_fill_info>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___1~7,<LOCAL,can_fill_info>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___2~3,<LOCAL,can_fill_info>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___3~2,<LOCAL,can_fill_info>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___4~2,<LOCAL,can_fill_info>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___5~2,<LOCAL,can_fill_info>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___6~2,<LOCAL,can_fill_info>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___7~2,<LOCAL,can_fill_info>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___8~1,<LOCAL,can_fill_info>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,<LOCAL,can_fill_info>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~31,<LOCAL,can_fill_xstats>]
left hand side expression in assignment: lhs: VariableLHS[~priv~16,<LOCAL,can_fill_xstats>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___0~15,<LOCAL,can_fill_xstats>]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,<LOCAL,register_candev>],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2630],StructAccessExpression[IdentifierExpression[~dev,<LOCAL,register_candev>],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~tmp~32,<LOCAL,register_candev>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~33,<LOCAL,safe_candev_priv>]
left hand side expression in assignment: lhs: VariableLHS[~err~3,<LOCAL,can_dev_init>]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_0~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_1~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_2~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_3~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~LDV_IN_INTERRUPT~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~LDV_IN_INTERRUPT~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_state_2~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_list_2~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_state_2~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_list_2~0,GLOBAL]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ldv_timer_list_2~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~ldv_timer_list_2~0,GLOBAL],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_state_2~0,GLOBAL]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ldv_timer_list_2~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~ldv_timer_list_2~0,GLOBAL],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_state_2~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_0~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_1~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_2~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_3~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_list_1_0~0,GLOBAL]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ldv_timer_list_1_0~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~ldv_timer_list_1_0~0,GLOBAL],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_0~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_list_1_1~0,GLOBAL]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ldv_timer_list_1_1~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~ldv_timer_list_1_1~0,GLOBAL],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_1~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_list_1_2~0,GLOBAL]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ldv_timer_list_1_2~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~ldv_timer_list_1_2~0,GLOBAL],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_2~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_list_1_3~0,GLOBAL]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ldv_timer_list_1_3~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~ldv_timer_list_1_3~0,GLOBAL],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_3~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_list_1_0~0,GLOBAL]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ldv_timer_list_1_0~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~ldv_timer_list_1_0~0,GLOBAL],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_0~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_list_1_1~0,GLOBAL]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ldv_timer_list_1_1~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~ldv_timer_list_1_1~0,GLOBAL],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_1~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_list_1_2~0,GLOBAL]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ldv_timer_list_1_2~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~ldv_timer_list_1_2~0,GLOBAL],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_2~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_list_1_3~0,GLOBAL]
left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ldv_timer_list_1_3~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~ldv_timer_list_1_3~0,GLOBAL],offset]]]]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_3~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~tmp~34,<LOCAL,choose_timer_1>]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_0~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_1~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_2~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_1_3~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~LDV_IN_INTERRUPT~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~LDV_IN_INTERRUPT~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~tmp~35,<LOCAL,ldv_initialize_rtnl_link_ops_4>]
left hand side expression in assignment: lhs: VariableLHS[~can_link_ops_group0~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~tmp___0~16,<LOCAL,ldv_initialize_rtnl_link_ops_4>]
left hand side expression in assignment: lhs: VariableLHS[~can_link_ops_group1~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~tmp___1~8,<LOCAL,ldv_initialize_rtnl_link_ops_4>]
left hand side expression in assignment: lhs: VariableLHS[~can_link_ops_group4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~tmp___2~4,<LOCAL,ldv_initialize_rtnl_link_ops_4>]
left hand side expression in assignment: lhs: VariableLHS[~can_link_ops_group3~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~tmp___3~3,<LOCAL,ldv_initialize_rtnl_link_ops_4>]
left hand side expression in assignment: lhs: VariableLHS[~can_link_ops_group2~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~tmp~36,<LOCAL,main>]
left hand side expression in assignment: lhs: VariableLHS[~ldvarg0~0,<LOCAL,main>]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~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_0~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~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___0~17,<LOCAL,main>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___1~9,<LOCAL,main>]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_4~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_4~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_4~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_4~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~tmp___2~5,<LOCAL,main>]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~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_0~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_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[~tmp~37,<LOCAL,ldv_netif_rx_20>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~38,<LOCAL,ldv_netif_rx_22>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~39,<LOCAL,ldv_mod_timer_23>]
left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~0,<LOCAL,ldv_mod_timer_23>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~40,<LOCAL,ldv_mod_timer_24>]
left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~1,<LOCAL,ldv_mod_timer_24>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~41,<LOCAL,ldv_netdev_alloc_skb_25>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~42,<LOCAL,ldv_del_timer_sync_27>]
left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~2,<LOCAL,ldv_del_timer_sync_27>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~43,<LOCAL,can_led_event>]
left hand side expression in assignment: lhs: VariableLHS[~priv~17,<LOCAL,can_led_event>]
left hand side expression in assignment: lhs: VariableLHS[~__mptr~0,<LOCAL,can_led_release>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~44,<LOCAL,can_led_release>]
left hand side expression in assignment: lhs: VariableLHS[~priv~18,<LOCAL,can_led_release>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~45,<LOCAL,devm_can_led_init>]
left hand side expression in assignment: lhs: VariableLHS[~priv~19,<LOCAL,devm_can_led_init>]
left hand side expression in assignment: lhs: VariableLHS[~res~0,<LOCAL,devm_can_led_init>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~46,<LOCAL,can_led_notifier>]
left hand side expression in assignment: lhs: VariableLHS[~netdev~0,<LOCAL,can_led_notifier>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___0~18,<LOCAL,can_led_notifier>]
left hand side expression in assignment: lhs: VariableLHS[~priv~20,<LOCAL,can_led_notifier>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~47,<LOCAL,can_led_notifier_init>]
left hand side expression in assignment: lhs: VariableLHS[~tmp~48,<LOCAL,ldv_main_exported_3>]
left hand side expression in assignment: lhs: VariableLHS[~ldvarg2~0,<LOCAL,ldv_main_exported_3>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___0~19,<LOCAL,ldv_main_exported_3>]
left hand side expression in assignment: lhs: VariableLHS[~ldvarg3~0,<LOCAL,ldv_main_exported_3>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___1~10,<LOCAL,ldv_main_exported_3>]
left hand side expression in assignment: lhs: VariableLHS[~ldvarg1~0,<LOCAL,ldv_main_exported_3>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___2~6,<LOCAL,ldv_main_exported_3>]
left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~set,<LOCAL,ldv_set_init>]
left hand side expression in assignment: lhs: VariableLHS[~last_index~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~i~1,<LOCAL,ldv_set_add>]
left hand side expression in assignment: lhs: VariableLHS[~i~1,<LOCAL,ldv_set_add>]
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,<LOCAL,ldv_set_remove>]
left hand side expression in assignment: lhs: VariableLHS[~i~2,<LOCAL,ldv_set_remove>]
left hand side expression in assignment: lhs: VariableLHS[~deleted_index~0,<LOCAL,ldv_set_remove>]
left hand side expression in assignment: lhs: VariableLHS[~i~2,<LOCAL,ldv_set_remove>]
left hand side expression in assignment: lhs: VariableLHS[~i~2,<LOCAL,ldv_set_remove>]
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~2,<LOCAL,ldv_set_remove>],IntegerLiteral[1]]]]]]
left hand side expression in assignment: lhs: VariableLHS[~i~2,<LOCAL,ldv_set_remove>]
left hand side expression in assignment: lhs: VariableLHS[~last_index~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~i~3,<LOCAL,ldv_set_contains>]
left hand side expression in assignment: lhs: VariableLHS[~i~3,<LOCAL,ldv_set_contains>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___8~2,<LOCAL,ldv_is_err_or_null>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___7~3,<LOCAL,ldv_is_err_or_null>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___8~2,<LOCAL,ldv_is_err_or_null>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___8~2,<LOCAL,ldv_is_err_or_null>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___7~4,<LOCAL,ldv_skb_alloc>]
left hand side expression in assignment: lhs: VariableLHS[~skb~5,<LOCAL,ldv_skb_alloc>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___7~5,<LOCAL,ldv_dev_alloc_skb>]
left hand side expression in assignment: lhs: VariableLHS[~skb~6,<LOCAL,ldv_dev_alloc_skb>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___7~6,<LOCAL,ldv_netdev_alloc_skb>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___7~7,<LOCAL,ldv_skb_current>]
left hand side expression in assignment: lhs: VariableLHS[~tmp___7~8,<LOCAL,ldv_check_final_state>]
[2021-01-07 01:22:29,788 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-01-07 01:22:30,010 INFO  L208         MainTranslator]: Completed translation
[2021-01-07 01:22:30,010 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:22:30 WrapperNode
[2021-01-07 01:22:30,010 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-01-07 01:22:30,013 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-01-07 01:22:30,013 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-01-07 01:22:30,013 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2021-01-07 01:22:30,040 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:22:30" (1/1) ...
[2021-01-07 01:22:30,168 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:22:30" (1/1) ...
[2021-01-07 01:22:30,644 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-01-07 01:22:30,648 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-01-07 01:22:30,648 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2021-01-07 01:22:30,648 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2021-01-07 01:22:30,661 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:22:30" (1/1) ...
[2021-01-07 01:22:30,661 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:22:30" (1/1) ...
[2021-01-07 01:22:30,765 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:22:30" (1/1) ...
[2021-01-07 01:22:30,765 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:22:30" (1/1) ...
[2021-01-07 01:22:31,143 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:22:30" (1/1) ...
[2021-01-07 01:22:31,219 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:22:30" (1/1) ...
[2021-01-07 01:22:31,280 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:22:30" (1/1) ...
[2021-01-07 01:22:31,357 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-01-07 01:22:31,360 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-01-07 01:22:31,360 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2021-01-07 01:22:31,360 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2021-01-07 01:22:31,361 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:22:30" (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:22:31,481 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~int
[2021-01-07 01:22:31,482 INFO  L130     BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$
[2021-01-07 01:22:31,483 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$
[2021-01-07 01:22:31,483 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2021-01-07 01:22:31,483 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2021-01-07 01:22:31,483 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2021-01-07 01:22:31,484 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2021-01-07 01:22:31,484 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-01-07 01:22:31,484 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2021-01-07 01:22:31,485 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-01-07 01:22:31,486 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2021-01-07 01:22:31,487 INFO  L130     BoogieDeclarations]: Found specification of procedure can_fill_info
[2021-01-07 01:22:31,487 INFO  L138     BoogieDeclarations]: Found implementation of procedure can_fill_info
[2021-01-07 01:22:31,487 INFO  L130     BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int
[2021-01-07 01:22:31,487 INFO  L138     BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int
[2021-01-07 01:22:31,487 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2021-01-07 01:22:31,487 INFO  L130     BoogieDeclarations]: Found specification of procedure read~unchecked~int
[2021-01-07 01:22:31,488 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-01-07 01:22:31,488 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-01-07 01:22:43,546 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-01-07 01:22:43,546 INFO  L299             CfgBuilder]: Removed 1345 assume(true) statements.
[2021-01-07 01:22:43,551 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 01:22:43 BoogieIcfgContainer
[2021-01-07 01:22:43,551 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-01-07 01:22:43,553 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-01-07 01:22:43,553 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2021-01-07 01:22:43,557 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2021-01-07 01:22:43,558 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 01:22:27" (1/3) ...
[2021-01-07 01:22:43,559 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d23c106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 01:22:43, skipping insertion in model container
[2021-01-07 01:22:43,559 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:22:30" (2/3) ...
[2021-01-07 01:22:43,560 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d23c106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 01:22:43, skipping insertion in model container
[2021-01-07 01:22:43,560 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 01:22:43" (3/3) ...
[2021-01-07 01:22:43,562 INFO  L111   eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--can--can-dev.ko-entry_point.cil.out.i
[2021-01-07 01:22:43,571 INFO  L153   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-01-07 01:22:43,579 INFO  L165   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2021-01-07 01:22:43,601 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2021-01-07 01:22:43,639 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2021-01-07 01:22:43,639 INFO  L378      AbstractCegarLoop]: Hoare is true
[2021-01-07 01:22:43,640 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-01-07 01:22:43,640 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-01-07 01:22:43,640 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-01-07 01:22:43,640 INFO  L382      AbstractCegarLoop]: Difference is false
[2021-01-07 01:22:43,640 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-01-07 01:22:43,640 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2021-01-07 01:22:43,687 INFO  L276                IsEmpty]: Start isEmpty. Operand 1820 states.
[2021-01-07 01:22:43,700 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2021-01-07 01:22:43,700 INFO  L414         BasicCegarLoop]: Found error trace
[2021-01-07 01:22:43,701 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]
[2021-01-07 01:22:43,702 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-07 01:22:43,709 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-01-07 01:22:43,709 INFO  L82        PathProgramCache]: Analyzing trace with hash -636873605, now seen corresponding path program 1 times
[2021-01-07 01:22:43,721 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-07 01:22:43,721 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780556544]
[2021-01-07 01:22:43,721 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-07 01:22:44,209 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-07 01:22:44,457 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:22:44,458 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780556544]
[2021-01-07 01:22:44,459 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-01-07 01:22:44,459 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-01-07 01:22:44,460 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846277013]
[2021-01-07 01:22:44,465 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-01-07 01:22:44,465 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-07 01:22:44,480 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-01-07 01:22:44,481 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-01-07 01:22:44,483 INFO  L87              Difference]: Start difference. First operand 1820 states. Second operand 3 states.
[2021-01-07 01:22:45,575 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-07 01:22:45,576 INFO  L93              Difference]: Finished difference Result 5402 states and 8026 transitions.
[2021-01-07 01:22:45,576 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-01-07 01:22:45,578 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 20
[2021-01-07 01:22:45,579 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-07 01:22:45,628 INFO  L225             Difference]: With dead ends: 5402
[2021-01-07 01:22:45,628 INFO  L226             Difference]: Without dead ends: 3553
[2021-01-07 01:22:45,643 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:22:45,676 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3553 states.
[2021-01-07 01:22:45,878 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3553 to 3553.
[2021-01-07 01:22:45,879 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3553 states.
[2021-01-07 01:22:45,901 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3553 states to 3553 states and 5105 transitions.
[2021-01-07 01:22:45,903 INFO  L78                 Accepts]: Start accepts. Automaton has 3553 states and 5105 transitions. Word has length 20
[2021-01-07 01:22:45,904 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-01-07 01:22:45,904 INFO  L481      AbstractCegarLoop]: Abstraction has 3553 states and 5105 transitions.
[2021-01-07 01:22:45,904 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2021-01-07 01:22:45,905 INFO  L276                IsEmpty]: Start isEmpty. Operand 3553 states and 5105 transitions.
[2021-01-07 01:22:45,916 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2021-01-07 01:22:45,916 INFO  L414         BasicCegarLoop]: Found error trace
[2021-01-07 01:22:45,917 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]
[2021-01-07 01:22:45,917 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-01-07 01:22:45,917 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-07 01:22:45,919 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-01-07 01:22:45,919 INFO  L82        PathProgramCache]: Analyzing trace with hash 1054608242, now seen corresponding path program 1 times
[2021-01-07 01:22:45,920 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-07 01:22:45,920 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810900170]
[2021-01-07 01:22:45,920 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-07 01:22:46,057 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-07 01:22:46,339 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:22:46,340 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810900170]
[2021-01-07 01:22:46,340 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-01-07 01:22:46,341 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-01-07 01:22:46,341 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767047597]
[2021-01-07 01:22:46,343 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-01-07 01:22:46,343 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-07 01:22:46,344 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-01-07 01:22:46,345 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2021-01-07 01:22:46,345 INFO  L87              Difference]: Start difference. First operand 3553 states and 5105 transitions. Second operand 5 states.
[2021-01-07 01:22:47,257 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-07 01:22:47,258 INFO  L93              Difference]: Finished difference Result 10639 states and 15294 transitions.
[2021-01-07 01:22:47,258 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2021-01-07 01:22:47,258 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 26
[2021-01-07 01:22:47,259 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-07 01:22:47,304 INFO  L225             Difference]: With dead ends: 10639
[2021-01-07 01:22:47,304 INFO  L226             Difference]: Without dead ends: 7089
[2021-01-07 01:22:47,314 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:22:47,326 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7089 states.
[2021-01-07 01:22:47,544 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7089 to 6969.
[2021-01-07 01:22:47,545 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6969 states.
[2021-01-07 01:22:47,577 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6969 states to 6969 states and 10030 transitions.
[2021-01-07 01:22:47,578 INFO  L78                 Accepts]: Start accepts. Automaton has 6969 states and 10030 transitions. Word has length 26
[2021-01-07 01:22:47,579 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-01-07 01:22:47,579 INFO  L481      AbstractCegarLoop]: Abstraction has 6969 states and 10030 transitions.
[2021-01-07 01:22:47,579 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2021-01-07 01:22:47,580 INFO  L276                IsEmpty]: Start isEmpty. Operand 6969 states and 10030 transitions.
[2021-01-07 01:22:47,596 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 71
[2021-01-07 01:22:47,597 INFO  L414         BasicCegarLoop]: Found error trace
[2021-01-07 01:22:47,597 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]
[2021-01-07 01:22:47,597 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-01-07 01:22:47,598 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-07 01:22:47,601 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-01-07 01:22:47,601 INFO  L82        PathProgramCache]: Analyzing trace with hash 1900546352, now seen corresponding path program 1 times
[2021-01-07 01:22:47,601 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-07 01:22:47,602 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458485229]
[2021-01-07 01:22:47,602 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-07 01:22:47,727 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-07 01:22:47,914 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-01-07 01:22:47,915 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458485229]
[2021-01-07 01:22:47,916 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-01-07 01:22:47,916 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-01-07 01:22:47,917 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124638229]
[2021-01-07 01:22:47,921 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-01-07 01:22:47,922 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-07 01:22:47,923 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-01-07 01:22:47,925 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2021-01-07 01:22:47,930 INFO  L87              Difference]: Start difference. First operand 6969 states and 10030 transitions. Second operand 5 states.
[2021-01-07 01:22:49,286 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-07 01:22:49,287 INFO  L93              Difference]: Finished difference Result 27021 states and 38914 transitions.
[2021-01-07 01:22:49,287 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2021-01-07 01:22:49,287 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 70
[2021-01-07 01:22:49,288 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-07 01:22:49,403 INFO  L225             Difference]: With dead ends: 27021
[2021-01-07 01:22:49,404 INFO  L226             Difference]: Without dead ends: 20061
[2021-01-07 01:22:49,428 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2021-01-07 01:22:49,464 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20061 states.
[2021-01-07 01:22:50,080 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20061 to 20045.
[2021-01-07 01:22:50,080 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20045 states.
[2021-01-07 01:22:50,142 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20045 states to 20045 states and 28832 transitions.
[2021-01-07 01:22:50,143 INFO  L78                 Accepts]: Start accepts. Automaton has 20045 states and 28832 transitions. Word has length 70
[2021-01-07 01:22:50,143 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-01-07 01:22:50,143 INFO  L481      AbstractCegarLoop]: Abstraction has 20045 states and 28832 transitions.
[2021-01-07 01:22:50,144 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2021-01-07 01:22:50,144 INFO  L276                IsEmpty]: Start isEmpty. Operand 20045 states and 28832 transitions.
[2021-01-07 01:22:50,158 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 72
[2021-01-07 01:22:50,158 INFO  L414         BasicCegarLoop]: Found error trace
[2021-01-07 01:22:50,159 INFO  L422         BasicCegarLoop]: trace histogram [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]
[2021-01-07 01:22:50,159 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-01-07 01:22:50,160 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-07 01:22:50,160 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-01-07 01:22:50,161 INFO  L82        PathProgramCache]: Analyzing trace with hash -110241493, now seen corresponding path program 1 times
[2021-01-07 01:22:50,161 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-07 01:22:50,161 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736396697]
[2021-01-07 01:22:50,161 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-07 01:22:50,275 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-07 01:22:50,439 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-01-07 01:22:50,440 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736396697]
[2021-01-07 01:22:50,440 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-01-07 01:22:50,440 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-01-07 01:22:50,440 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694771151]
[2021-01-07 01:22:50,441 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-01-07 01:22:50,441 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-07 01:22:50,443 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-01-07 01:22:50,444 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-01-07 01:22:50,444 INFO  L87              Difference]: Start difference. First operand 20045 states and 28832 transitions. Second operand 4 states.
[2021-01-07 01:22:52,986 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-07 01:22:52,986 INFO  L93              Difference]: Finished difference Result 93068 states and 134517 transitions.
[2021-01-07 01:22:52,987 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2021-01-07 01:22:52,988 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 71
[2021-01-07 01:22:52,989 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-07 01:22:53,289 INFO  L225             Difference]: With dead ends: 93068
[2021-01-07 01:22:53,290 INFO  L226             Difference]: Without dead ends: 73032
[2021-01-07 01:22:53,604 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:22:53,703 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 73032 states.
[2021-01-07 01:22:55,302 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 73032 to 20149.
[2021-01-07 01:22:55,302 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20149 states.
[2021-01-07 01:22:55,360 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20149 states to 20149 states and 28936 transitions.
[2021-01-07 01:22:55,361 INFO  L78                 Accepts]: Start accepts. Automaton has 20149 states and 28936 transitions. Word has length 71
[2021-01-07 01:22:55,363 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-01-07 01:22:55,364 INFO  L481      AbstractCegarLoop]: Abstraction has 20149 states and 28936 transitions.
[2021-01-07 01:22:55,364 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2021-01-07 01:22:55,364 INFO  L276                IsEmpty]: Start isEmpty. Operand 20149 states and 28936 transitions.
[2021-01-07 01:22:55,388 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2021-01-07 01:22:55,388 INFO  L414         BasicCegarLoop]: Found error trace
[2021-01-07 01:22:55,389 INFO  L422         BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-01-07 01:22:55,390 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-01-07 01:22:55,390 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-07 01:22:55,390 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-01-07 01:22:55,390 INFO  L82        PathProgramCache]: Analyzing trace with hash 1159529646, now seen corresponding path program 1 times
[2021-01-07 01:22:55,391 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-07 01:22:55,396 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497754261]
[2021-01-07 01:22:55,396 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-07 01:22:56,435 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-07 01:22:56,719 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2021-01-07 01:22:56,719 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497754261]
[2021-01-07 01:22:56,720 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-01-07 01:22:56,720 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-01-07 01:22:56,720 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718587275]
[2021-01-07 01:22:56,722 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-01-07 01:22:56,723 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-07 01:22:56,724 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-01-07 01:22:56,724 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2021-01-07 01:22:56,724 INFO  L87              Difference]: Start difference. First operand 20149 states and 28936 transitions. Second operand 5 states.
[2021-01-07 01:22:58,557 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-07 01:22:58,557 INFO  L93              Difference]: Finished difference Result 50122 states and 71995 transitions.
[2021-01-07 01:22:58,558 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2021-01-07 01:22:58,558 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 74
[2021-01-07 01:22:58,559 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-07 01:22:58,660 INFO  L225             Difference]: With dead ends: 50122
[2021-01-07 01:22:58,660 INFO  L226             Difference]: Without dead ends: 29982
[2021-01-07 01:22:58,705 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2021-01-07 01:22:58,743 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 29982 states.
[2021-01-07 01:23:00,103 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 29982 to 20167.
[2021-01-07 01:23:00,104 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20167 states.
[2021-01-07 01:23:00,167 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20167 states to 20167 states and 28951 transitions.
[2021-01-07 01:23:00,168 INFO  L78                 Accepts]: Start accepts. Automaton has 20167 states and 28951 transitions. Word has length 74
[2021-01-07 01:23:00,168 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-01-07 01:23:00,169 INFO  L481      AbstractCegarLoop]: Abstraction has 20167 states and 28951 transitions.
[2021-01-07 01:23:00,169 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2021-01-07 01:23:00,169 INFO  L276                IsEmpty]: Start isEmpty. Operand 20167 states and 28951 transitions.
[2021-01-07 01:23:00,190 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2021-01-07 01:23:00,190 INFO  L414         BasicCegarLoop]: Found error trace
[2021-01-07 01:23:00,190 INFO  L422         BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-01-07 01:23:00,191 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-01-07 01:23:00,191 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-07 01:23:00,191 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-01-07 01:23:00,191 INFO  L82        PathProgramCache]: Analyzing trace with hash 1839588016, now seen corresponding path program 1 times
[2021-01-07 01:23:00,192 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-07 01:23:00,192 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241487234]
[2021-01-07 01:23:00,192 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-07 01:23:03,444 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-07 01:23:03,835 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-01-07 01:23:03,835 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241487234]
[2021-01-07 01:23:03,836 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-01-07 01:23:03,836 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2021-01-07 01:23:03,836 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93362386]
[2021-01-07 01:23:03,837 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 11 states
[2021-01-07 01:23:03,837 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-07 01:23:03,838 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2021-01-07 01:23:03,839 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110
[2021-01-07 01:23:03,839 INFO  L87              Difference]: Start difference. First operand 20167 states and 28951 transitions. Second operand 11 states.
[2021-01-07 01:23:13,712 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-07 01:23:13,712 INFO  L93              Difference]: Finished difference Result 124134 states and 179920 transitions.
[2021-01-07 01:23:13,713 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2021-01-07 01:23:13,713 INFO  L78                 Accepts]: Start accepts. Automaton has 11 states. Word has length 74
[2021-01-07 01:23:13,714 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-07 01:23:14,175 INFO  L225             Difference]: With dead ends: 124134
[2021-01-07 01:23:14,176 INFO  L226             Difference]: Without dead ends: 103976
[2021-01-07 01:23:14,242 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=220, Invalid=536, Unknown=0, NotChecked=0, Total=756
[2021-01-07 01:23:14,417 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 103976 states.
[2021-01-07 01:23:17,448 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 103976 to 20375.
[2021-01-07 01:23:17,448 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20375 states.
[2021-01-07 01:23:17,489 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20375 states to 20375 states and 29107 transitions.
[2021-01-07 01:23:17,490 INFO  L78                 Accepts]: Start accepts. Automaton has 20375 states and 29107 transitions. Word has length 74
[2021-01-07 01:23:17,490 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-01-07 01:23:17,491 INFO  L481      AbstractCegarLoop]: Abstraction has 20375 states and 29107 transitions.
[2021-01-07 01:23:17,491 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 11 states.
[2021-01-07 01:23:17,491 INFO  L276                IsEmpty]: Start isEmpty. Operand 20375 states and 29107 transitions.
[2021-01-07 01:23:17,513 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2021-01-07 01:23:17,514 INFO  L414         BasicCegarLoop]: Found error trace
[2021-01-07 01:23:17,514 INFO  L422         BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-01-07 01:23:17,514 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-01-07 01:23:17,514 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-07 01:23:17,515 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-01-07 01:23:17,515 INFO  L82        PathProgramCache]: Analyzing trace with hash -849825764, now seen corresponding path program 1 times
[2021-01-07 01:23:17,515 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-07 01:23:17,516 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047260033]
[2021-01-07 01:23:17,516 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-07 01:23:17,602 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-07 01:23:17,695 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-01-07 01:23:17,696 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047260033]
[2021-01-07 01:23:17,696 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-01-07 01:23:17,696 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-01-07 01:23:17,696 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886864122]
[2021-01-07 01:23:17,697 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-01-07 01:23:17,697 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-07 01:23:17,697 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-01-07 01:23:17,698 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-01-07 01:23:17,698 INFO  L87              Difference]: Start difference. First operand 20375 states and 29107 transitions. Second operand 3 states.
[2021-01-07 01:23:21,257 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-07 01:23:21,258 INFO  L93              Difference]: Finished difference Result 49330 states and 70595 transitions.
[2021-01-07 01:23:21,258 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-01-07 01:23:21,258 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 76
[2021-01-07 01:23:21,259 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-07 01:23:21,359 INFO  L225             Difference]: With dead ends: 49330
[2021-01-07 01:23:21,360 INFO  L226             Difference]: Without dead ends: 38987
[2021-01-07 01:23:21,390 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:23:21,446 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 38987 states.
[2021-01-07 01:23:23,592 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 38987 to 20531.
[2021-01-07 01:23:23,592 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20531 states.
[2021-01-07 01:23:23,631 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20531 states to 20531 states and 29263 transitions.
[2021-01-07 01:23:23,632 INFO  L78                 Accepts]: Start accepts. Automaton has 20531 states and 29263 transitions. Word has length 76
[2021-01-07 01:23:23,632 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-01-07 01:23:23,632 INFO  L481      AbstractCegarLoop]: Abstraction has 20531 states and 29263 transitions.
[2021-01-07 01:23:23,632 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2021-01-07 01:23:23,632 INFO  L276                IsEmpty]: Start isEmpty. Operand 20531 states and 29263 transitions.
[2021-01-07 01:23:23,661 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2021-01-07 01:23:23,662 INFO  L414         BasicCegarLoop]: Found error trace
[2021-01-07 01:23:23,662 INFO  L422         BasicCegarLoop]: trace histogram [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]
[2021-01-07 01:23:23,662 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-01-07 01:23:23,662 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-07 01:23:23,663 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-01-07 01:23:23,663 INFO  L82        PathProgramCache]: Analyzing trace with hash -1669469059, now seen corresponding path program 1 times
[2021-01-07 01:23:23,663 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-07 01:23:23,663 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784768683]
[2021-01-07 01:23:23,664 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-07 01:23:23,746 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-07 01:23:23,884 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-01-07 01:23:23,885 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784768683]
[2021-01-07 01:23:23,885 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-01-07 01:23:23,885 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-01-07 01:23:23,885 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680707082]
[2021-01-07 01:23:23,886 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-01-07 01:23:23,886 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-07 01:23:23,886 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-01-07 01:23:23,887 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2021-01-07 01:23:23,887 INFO  L87              Difference]: Start difference. First operand 20531 states and 29263 transitions. Second operand 4 states.
[2021-01-07 01:23:28,906 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-07 01:23:28,906 INFO  L93              Difference]: Finished difference Result 49952 states and 71222 transitions.
[2021-01-07 01:23:28,907 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2021-01-07 01:23:28,907 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 78
[2021-01-07 01:23:28,907 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-07 01:23:28,968 INFO  L225             Difference]: With dead ends: 49952
[2021-01-07 01:23:28,968 INFO  L226             Difference]: Without dead ends: 29430
[2021-01-07 01:23:29,004 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:23:29,038 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 29430 states.
[2021-01-07 01:23:31,317 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 29430 to 20297.
[2021-01-07 01:23:31,317 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20297 states.
[2021-01-07 01:23:31,370 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20297 states to 20297 states and 28795 transitions.
[2021-01-07 01:23:31,370 INFO  L78                 Accepts]: Start accepts. Automaton has 20297 states and 28795 transitions. Word has length 78
[2021-01-07 01:23:31,370 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-01-07 01:23:31,370 INFO  L481      AbstractCegarLoop]: Abstraction has 20297 states and 28795 transitions.
[2021-01-07 01:23:31,371 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2021-01-07 01:23:31,371 INFO  L276                IsEmpty]: Start isEmpty. Operand 20297 states and 28795 transitions.
[2021-01-07 01:23:31,390 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2021-01-07 01:23:31,390 INFO  L414         BasicCegarLoop]: Found error trace
[2021-01-07 01:23:31,390 INFO  L422         BasicCegarLoop]: trace histogram [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]
[2021-01-07 01:23:31,390 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-01-07 01:23:31,390 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-07 01:23:31,391 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-01-07 01:23:31,391 INFO  L82        PathProgramCache]: Analyzing trace with hash 135443171, now seen corresponding path program 1 times
[2021-01-07 01:23:31,391 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-07 01:23:31,391 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498583995]
[2021-01-07 01:23:31,392 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-07 01:23:31,480 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-07 01:23:31,599 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-01-07 01:23:31,599 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498583995]
[2021-01-07 01:23:31,600 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-01-07 01:23:31,600 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-01-07 01:23:31,600 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555242030]
[2021-01-07 01:23:31,601 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-01-07 01:23:31,601 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-07 01:23:31,602 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-01-07 01:23:31,608 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-01-07 01:23:31,608 INFO  L87              Difference]: Start difference. First operand 20297 states and 28795 transitions. Second operand 3 states.
[2021-01-07 01:23:33,709 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-07 01:23:33,709 INFO  L93              Difference]: Finished difference Result 40637 states and 57684 transitions.
[2021-01-07 01:23:33,710 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-01-07 01:23:33,710 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 79
[2021-01-07 01:23:33,710 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-07 01:23:33,739 INFO  L225             Difference]: With dead ends: 40637
[2021-01-07 01:23:33,739 INFO  L226             Difference]: Without dead ends: 20349
[2021-01-07 01:23:33,760 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:23:33,783 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20349 states.
[2021-01-07 01:23:35,479 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20349 to 20349.
[2021-01-07 01:23:35,479 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20349 states.
[2021-01-07 01:23:35,513 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20349 states to 20349 states and 28847 transitions.
[2021-01-07 01:23:35,513 INFO  L78                 Accepts]: Start accepts. Automaton has 20349 states and 28847 transitions. Word has length 79
[2021-01-07 01:23:35,513 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-01-07 01:23:35,513 INFO  L481      AbstractCegarLoop]: Abstraction has 20349 states and 28847 transitions.
[2021-01-07 01:23:35,514 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2021-01-07 01:23:35,514 INFO  L276                IsEmpty]: Start isEmpty. Operand 20349 states and 28847 transitions.
[2021-01-07 01:23:35,531 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2021-01-07 01:23:35,531 INFO  L414         BasicCegarLoop]: Found error trace
[2021-01-07 01:23:35,531 INFO  L422         BasicCegarLoop]: trace histogram [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]
[2021-01-07 01:23:35,531 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-01-07 01:23:35,532 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-07 01:23:35,532 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-01-07 01:23:35,532 INFO  L82        PathProgramCache]: Analyzing trace with hash 67353562, now seen corresponding path program 1 times
[2021-01-07 01:23:35,532 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-07 01:23:35,533 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744756286]
[2021-01-07 01:23:35,533 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-07 01:23:35,642 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-07 01:23:35,753 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-01-07 01:23:35,753 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744756286]
[2021-01-07 01:23:35,753 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203027385]
[2021-01-07 01:23:35,754 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:23:36,848 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-07 01:23:36,857 INFO  L263         TraceCheckSpWp]: Trace formula consists of 2184 conjuncts, 4 conjunts are in the unsatisfiable core
[2021-01-07 01:23:36,872 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2021-01-07 01:23:37,128 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-01-07 01:23:37,128 INFO  L219   FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2021-01-07 01:23:37,128 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6
[2021-01-07 01:23:37,129 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466120811]
[2021-01-07 01:23:37,132 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-01-07 01:23:37,133 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-07 01:23:37,133 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-01-07 01:23:37,134 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2021-01-07 01:23:37,134 INFO  L87              Difference]: Start difference. First operand 20349 states and 28847 transitions. Second operand 6 states.
[2021-01-07 01:23:39,369 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-07 01:23:39,369 INFO  L93              Difference]: Finished difference Result 40741 states and 57788 transitions.
[2021-01-07 01:23:39,370 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2021-01-07 01:23:39,370 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 80
[2021-01-07 01:23:39,370 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-07 01:23:39,488 INFO  L225             Difference]: With dead ends: 40741
[2021-01-07 01:23:39,489 INFO  L226             Difference]: Without dead ends: 20401
[2021-01-07 01:23:39,536 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2021-01-07 01:23:39,564 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20401 states.
[2021-01-07 01:23:42,582 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20401 to 20401.
[2021-01-07 01:23:42,583 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20401 states.
[2021-01-07 01:23:42,617 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20401 states to 20401 states and 28899 transitions.
[2021-01-07 01:23:42,618 INFO  L78                 Accepts]: Start accepts. Automaton has 20401 states and 28899 transitions. Word has length 80
[2021-01-07 01:23:42,618 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-01-07 01:23:42,618 INFO  L481      AbstractCegarLoop]: Abstraction has 20401 states and 28899 transitions.
[2021-01-07 01:23:42,618 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2021-01-07 01:23:42,618 INFO  L276                IsEmpty]: Start isEmpty. Operand 20401 states and 28899 transitions.
[2021-01-07 01:23:42,646 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2021-01-07 01:23:42,647 INFO  L414         BasicCegarLoop]: Found error trace
[2021-01-07 01:23:42,647 INFO  L422         BasicCegarLoop]: trace histogram [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]
[2021-01-07 01:23:42,861 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2021-01-07 01:23:42,862 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-07 01:23:42,862 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-01-07 01:23:42,862 INFO  L82        PathProgramCache]: Analyzing trace with hash -2043424317, now seen corresponding path program 2 times
[2021-01-07 01:23:42,863 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-07 01:23:42,863 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444822673]
[2021-01-07 01:23:42,863 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-07 01:23:43,017 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-07 01:23:43,163 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-01-07 01:23:43,164 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444822673]
[2021-01-07 01:23:43,164 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429885532]
[2021-01-07 01:23:43,164 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:23:45,329 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2021-01-07 01:23:45,329 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2021-01-07 01:23:45,344 INFO  L263         TraceCheckSpWp]: Trace formula consists of 2190 conjuncts, 5 conjunts are in the unsatisfiable core
[2021-01-07 01:23:45,351 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2021-01-07 01:23:45,512 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-01-07 01:23:45,513 INFO  L219   FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2021-01-07 01:23:45,513 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8
[2021-01-07 01:23:45,513 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194814226]
[2021-01-07 01:23:45,514 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-01-07 01:23:45,514 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-07 01:23:45,514 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-01-07 01:23:45,515 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56
[2021-01-07 01:23:45,515 INFO  L87              Difference]: Start difference. First operand 20401 states and 28899 transitions. Second operand 8 states.
[2021-01-07 01:23:47,417 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-07 01:23:47,417 INFO  L93              Difference]: Finished difference Result 40845 states and 57892 transitions.
[2021-01-07 01:23:47,418 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2021-01-07 01:23:47,418 INFO  L78                 Accepts]: Start accepts. Automaton has 8 states. Word has length 81
[2021-01-07 01:23:47,418 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-07 01:23:47,455 INFO  L225             Difference]: With dead ends: 40845
[2021-01-07 01:23:47,456 INFO  L226             Difference]: Without dead ends: 20453
[2021-01-07 01:23:47,489 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 79 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:23:47,515 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20453 states.
[2021-01-07 01:23:50,021 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20453 to 20453.
[2021-01-07 01:23:50,022 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20453 states.
[2021-01-07 01:23:50,056 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20453 states to 20453 states and 28951 transitions.
[2021-01-07 01:23:50,057 INFO  L78                 Accepts]: Start accepts. Automaton has 20453 states and 28951 transitions. Word has length 81
[2021-01-07 01:23:50,057 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-01-07 01:23:50,057 INFO  L481      AbstractCegarLoop]: Abstraction has 20453 states and 28951 transitions.
[2021-01-07 01:23:50,057 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2021-01-07 01:23:50,057 INFO  L276                IsEmpty]: Start isEmpty. Operand 20453 states and 28951 transitions.
[2021-01-07 01:23:50,071 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 83
[2021-01-07 01:23:50,072 INFO  L414         BasicCegarLoop]: Found error trace
[2021-01-07 01:23:50,072 INFO  L422         BasicCegarLoop]: trace histogram [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]
[2021-01-07 01:23:50,287 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2021-01-07 01:23:50,288 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-07 01:23:50,289 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-01-07 01:23:50,289 INFO  L82        PathProgramCache]: Analyzing trace with hash 1241938170, now seen corresponding path program 3 times
[2021-01-07 01:23:50,289 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-07 01:23:50,290 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322516934]
[2021-01-07 01:23:50,290 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-07 01:23:50,398 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-07 01:23:50,534 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-01-07 01:23:50,535 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322516934]
[2021-01-07 01:23:50,535 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548044883]
[2021-01-07 01:23:50,535 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:23:56,463 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2021-01-07 01:23:56,463 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2021-01-07 01:23:56,495 INFO  L263         TraceCheckSpWp]: Trace formula consists of 2178 conjuncts, 62 conjunts are in the unsatisfiable core
[2021-01-07 01:23:56,501 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2021-01-07 01:23:56,902 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-01-07 01:23:57,025 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2021-01-07 01:23:57,026 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2021-01-07 01:23:57,026 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 17
[2021-01-07 01:23:57,027 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573528306]
[2021-01-07 01:23:57,027 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 13 states
[2021-01-07 01:23:57,027 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-07 01:23:57,028 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2021-01-07 01:23:57,028 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272
[2021-01-07 01:23:57,028 INFO  L87              Difference]: Start difference. First operand 20453 states and 28951 transitions. Second operand 13 states.
[2021-01-07 01:23:59,117 WARN  L197               SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40
[2021-01-07 01:23:59,346 WARN  L197               SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48
[2021-01-07 01:24:00,315 WARN  L197               SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54
[2021-01-07 01:24:00,542 WARN  L197               SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56
[2021-01-07 01:24:00,847 WARN  L197               SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54
[2021-01-07 01:24:02,925 WARN  L197               SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47
[2021-01-07 01:24:12,569 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-07 01:24:12,570 INFO  L93              Difference]: Finished difference Result 124264 states and 178672 transitions.
[2021-01-07 01:24:12,571 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2021-01-07 01:24:12,572 INFO  L78                 Accepts]: Start accepts. Automaton has 13 states. Word has length 82
[2021-01-07 01:24:12,572 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-07 01:24:12,753 INFO  L225             Difference]: With dead ends: 124264
[2021-01-07 01:24:12,754 INFO  L226             Difference]: Without dead ends: 103820
[2021-01-07 01:24:12,966 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=270, Invalid=920, Unknown=0, NotChecked=0, Total=1190
[2021-01-07 01:24:13,085 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 103820 states.
[2021-01-07 01:24:15,957 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 103820 to 21025.
[2021-01-07 01:24:15,957 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21025 states.
[2021-01-07 01:24:15,990 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21025 states to 21025 states and 29575 transitions.
[2021-01-07 01:24:15,991 INFO  L78                 Accepts]: Start accepts. Automaton has 21025 states and 29575 transitions. Word has length 82
[2021-01-07 01:24:15,991 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-01-07 01:24:15,991 INFO  L481      AbstractCegarLoop]: Abstraction has 21025 states and 29575 transitions.
[2021-01-07 01:24:15,991 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 13 states.
[2021-01-07 01:24:15,991 INFO  L276                IsEmpty]: Start isEmpty. Operand 21025 states and 29575 transitions.
[2021-01-07 01:24:16,002 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 83
[2021-01-07 01:24:16,002 INFO  L414         BasicCegarLoop]: Found error trace
[2021-01-07 01:24:16,003 INFO  L422         BasicCegarLoop]: trace histogram [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]
[2021-01-07 01:24:16,216 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2021-01-07 01:24:16,217 INFO  L429      AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-07 01:24:16,218 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-01-07 01:24:16,218 INFO  L82        PathProgramCache]: Analyzing trace with hash 847571384, now seen corresponding path program 1 times
[2021-01-07 01:24:16,218 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-07 01:24:16,218 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496392375]
[2021-01-07 01:24:16,219 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-07 01:24:16,326 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-07 01:24:16,460 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-01-07 01:24:16,461 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496392375]
[2021-01-07 01:24:16,461 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951754778]
[2021-01-07 01:24:16,461 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:24:17,368 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-07 01:24:17,378 INFO  L263         TraceCheckSpWp]: Trace formula consists of 2202 conjuncts, 6 conjunts are in the unsatisfiable core
[2021-01-07 01:24:17,383 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2021-01-07 01:24:17,515 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-01-07 01:24:17,515 INFO  L219   FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2021-01-07 01:24:17,515 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10
[2021-01-07 01:24:17,516 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110947553]
[2021-01-07 01:24:17,516 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 10 states
[2021-01-07 01:24:17,516 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-07 01:24:17,517 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-01-07 01:24:17,517 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90
[2021-01-07 01:24:17,517 INFO  L87              Difference]: Start difference. First operand 21025 states and 29575 transitions. Second operand 10 states.
[2021-01-07 01:24:21,014 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-07 01:24:21,014 INFO  L93              Difference]: Finished difference Result 42145 states and 59348 transitions.
[2021-01-07 01:24:21,015 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2021-01-07 01:24:21,015 INFO  L78                 Accepts]: Start accepts. Automaton has 10 states. Word has length 82
[2021-01-07 01:24:21,016 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-07 01:24:21,046 INFO  L225             Difference]: With dead ends: 42145
[2021-01-07 01:24:21,047 INFO  L226             Difference]: Without dead ends: 21129
[2021-01-07 01:24:21,067 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 79 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:24:21,085 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21129 states.
[2021-01-07 01:24:23,496 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21129 to 21129.
[2021-01-07 01:24:23,496 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21129 states.
[2021-01-07 01:24:23,533 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21129 states to 21129 states and 29679 transitions.
[2021-01-07 01:24:23,533 INFO  L78                 Accepts]: Start accepts. Automaton has 21129 states and 29679 transitions. Word has length 82
[2021-01-07 01:24:23,533 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-01-07 01:24:23,534 INFO  L481      AbstractCegarLoop]: Abstraction has 21129 states and 29679 transitions.
[2021-01-07 01:24:23,534 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 10 states.
[2021-01-07 01:24:23,534 INFO  L276                IsEmpty]: Start isEmpty. Operand 21129 states and 29679 transitions.
[2021-01-07 01:24:23,543 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2021-01-07 01:24:23,543 INFO  L414         BasicCegarLoop]: Found error trace
[2021-01-07 01:24:23,543 INFO  L422         BasicCegarLoop]: trace histogram [4, 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]
[2021-01-07 01:24:23,744 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2021-01-07 01:24:23,744 INFO  L429      AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-07 01:24:23,745 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-01-07 01:24:23,745 INFO  L82        PathProgramCache]: Analyzing trace with hash -385406623, now seen corresponding path program 2 times
[2021-01-07 01:24:23,745 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-07 01:24:23,748 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071585160]
[2021-01-07 01:24:23,748 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-07 01:24:23,906 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-07 01:24:24,035 INFO  L134       CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-01-07 01:24:24,036 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071585160]
[2021-01-07 01:24:24,036 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683134802]
[2021-01-07 01:24:24,036 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:24:25,797 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2021-01-07 01:24:25,797 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2021-01-07 01:24:25,813 INFO  L263         TraceCheckSpWp]: Trace formula consists of 2208 conjuncts, 7 conjunts are in the unsatisfiable core
[2021-01-07 01:24:25,817 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2021-01-07 01:24:26,138 INFO  L134       CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-01-07 01:24:26,139 INFO  L219   FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2021-01-07 01:24:26,139 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12
[2021-01-07 01:24:26,139 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810548094]
[2021-01-07 01:24:26,139 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 12 states
[2021-01-07 01:24:26,140 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-07 01:24:26,140 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-01-07 01:24:26,140 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132
[2021-01-07 01:24:26,140 INFO  L87              Difference]: Start difference. First operand 21129 states and 29679 transitions. Second operand 12 states.
[2021-01-07 01:24:28,847 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-07 01:24:28,847 INFO  L93              Difference]: Finished difference Result 42353 states and 59556 transitions.
[2021-01-07 01:24:28,848 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2021-01-07 01:24:28,848 INFO  L78                 Accepts]: Start accepts. Automaton has 12 states. Word has length 83
[2021-01-07 01:24:28,848 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-07 01:24:28,877 INFO  L225             Difference]: With dead ends: 42353
[2021-01-07 01:24:28,877 INFO  L226             Difference]: Without dead ends: 21233
[2021-01-07 01:24:28,894 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132
[2021-01-07 01:24:28,909 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21233 states.
[2021-01-07 01:24:31,411 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21233 to 21233.
[2021-01-07 01:24:31,412 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21233 states.
[2021-01-07 01:24:31,449 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21233 states to 21233 states and 29783 transitions.
[2021-01-07 01:24:31,449 INFO  L78                 Accepts]: Start accepts. Automaton has 21233 states and 29783 transitions. Word has length 83
[2021-01-07 01:24:31,450 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-01-07 01:24:31,450 INFO  L481      AbstractCegarLoop]: Abstraction has 21233 states and 29783 transitions.
[2021-01-07 01:24:31,450 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 12 states.
[2021-01-07 01:24:31,450 INFO  L276                IsEmpty]: Start isEmpty. Operand 21233 states and 29783 transitions.
[2021-01-07 01:24:31,461 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2021-01-07 01:24:31,462 INFO  L414         BasicCegarLoop]: Found error trace
[2021-01-07 01:24:31,462 INFO  L422         BasicCegarLoop]: trace histogram [5, 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]
[2021-01-07 01:24:31,673 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2021-01-07 01:24:31,674 INFO  L429      AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-07 01:24:31,674 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-01-07 01:24:31,675 INFO  L82        PathProgramCache]: Analyzing trace with hash 46980824, now seen corresponding path program 3 times
[2021-01-07 01:24:31,675 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-07 01:24:31,675 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384902568]
[2021-01-07 01:24:31,676 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-07 01:24:31,807 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-07 01:24:31,991 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-01-07 01:24:31,992 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384902568]
[2021-01-07 01:24:31,992 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202968363]
[2021-01-07 01:24:31,992 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:24:36,489 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2021-01-07 01:24:36,490 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2021-01-07 01:24:36,510 INFO  L263         TraceCheckSpWp]: Trace formula consists of 2184 conjuncts, 62 conjunts are in the unsatisfiable core
[2021-01-07 01:24:36,514 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2021-01-07 01:24:37,059 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2021-01-07 01:24:37,059 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2021-01-07 01:24:37,059 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [8] total 20
[2021-01-07 01:24:37,060 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707921041]
[2021-01-07 01:24:37,060 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 14 states
[2021-01-07 01:24:37,060 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-07 01:24:37,061 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2021-01-07 01:24:37,061 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380
[2021-01-07 01:24:37,061 INFO  L87              Difference]: Start difference. First operand 21233 states and 29783 transitions. Second operand 14 states.
[2021-01-07 01:24:39,138 WARN  L197               SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40
[2021-01-07 01:24:39,438 WARN  L197               SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46
[2021-01-07 01:24:40,402 WARN  L197               SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52
[2021-01-07 01:24:40,640 WARN  L197               SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58
[2021-01-07 01:24:40,943 WARN  L197               SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64
[2021-01-07 01:24:41,227 WARN  L197               SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70
[2021-01-07 01:24:42,966 WARN  L197               SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 67
[2021-01-07 01:24:43,264 WARN  L197               SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63
[2021-01-07 01:24:51,077 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-07 01:24:51,077 INFO  L93              Difference]: Finished difference Result 91624 states and 130952 transitions.
[2021-01-07 01:24:51,078 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2021-01-07 01:24:51,078 INFO  L78                 Accepts]: Start accepts. Automaton has 14 states. Word has length 84
[2021-01-07 01:24:51,079 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-07 01:24:51,176 INFO  L225             Difference]: With dead ends: 91624
[2021-01-07 01:24:51,176 INFO  L226             Difference]: Without dead ends: 70400
[2021-01-07 01:24:51,205 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=280, Invalid=980, Unknown=0, NotChecked=0, Total=1260
[2021-01-07 01:24:51,260 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 70400 states.
[2021-01-07 01:24:54,420 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 70400 to 21337.
[2021-01-07 01:24:54,421 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21337 states.
[2021-01-07 01:24:54,458 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21337 states to 21337 states and 29887 transitions.
[2021-01-07 01:24:54,458 INFO  L78                 Accepts]: Start accepts. Automaton has 21337 states and 29887 transitions. Word has length 84
[2021-01-07 01:24:54,459 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-01-07 01:24:54,459 INFO  L481      AbstractCegarLoop]: Abstraction has 21337 states and 29887 transitions.
[2021-01-07 01:24:54,459 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 14 states.
[2021-01-07 01:24:54,459 INFO  L276                IsEmpty]: Start isEmpty. Operand 21337 states and 29887 transitions.
[2021-01-07 01:24:54,469 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2021-01-07 01:24:54,470 INFO  L414         BasicCegarLoop]: Found error trace
[2021-01-07 01:24:54,470 INFO  L422         BasicCegarLoop]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-01-07 01:24:54,684 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2021-01-07 01:24:54,685 INFO  L429      AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-07 01:24:54,685 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-01-07 01:24:54,686 INFO  L82        PathProgramCache]: Analyzing trace with hash -1980197908, now seen corresponding path program 1 times
[2021-01-07 01:24:54,686 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-07 01:24:54,686 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178844830]
[2021-01-07 01:24:54,687 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-07 01:24:54,789 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-07 01:24:54,934 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-01-07 01:24:54,934 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178844830]
[2021-01-07 01:24:54,934 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133260976]
[2021-01-07 01:24:54,935 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:24:56,056 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-07 01:24:56,063 INFO  L263         TraceCheckSpWp]: Trace formula consists of 2269 conjuncts, 8 conjunts are in the unsatisfiable core
[2021-01-07 01:24:56,066 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2021-01-07 01:24:56,300 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-01-07 01:24:56,301 INFO  L219   FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2021-01-07 01:24:56,301 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14
[2021-01-07 01:24:56,301 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248110002]
[2021-01-07 01:24:56,302 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 14 states
[2021-01-07 01:24:56,302 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-07 01:24:56,302 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2021-01-07 01:24:56,303 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182
[2021-01-07 01:24:56,303 INFO  L87              Difference]: Start difference. First operand 21337 states and 29887 transitions. Second operand 14 states.
[2021-01-07 01:24:59,576 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-07 01:24:59,576 INFO  L93              Difference]: Finished difference Result 42769 states and 59972 transitions.
[2021-01-07 01:24:59,577 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2021-01-07 01:24:59,577 INFO  L78                 Accepts]: Start accepts. Automaton has 14 states. Word has length 90
[2021-01-07 01:24:59,578 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-07 01:24:59,606 INFO  L225             Difference]: With dead ends: 42769
[2021-01-07 01:24:59,606 INFO  L226             Difference]: Without dead ends: 21441
[2021-01-07 01:24:59,625 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182
[2021-01-07 01:24:59,642 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21441 states.
[2021-01-07 01:25:02,567 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21441 to 21441.
[2021-01-07 01:25:02,567 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21441 states.
[2021-01-07 01:25:02,604 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21441 states to 21441 states and 29991 transitions.
[2021-01-07 01:25:02,605 INFO  L78                 Accepts]: Start accepts. Automaton has 21441 states and 29991 transitions. Word has length 90
[2021-01-07 01:25:02,605 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-01-07 01:25:02,605 INFO  L481      AbstractCegarLoop]: Abstraction has 21441 states and 29991 transitions.
[2021-01-07 01:25:02,605 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 14 states.
[2021-01-07 01:25:02,605 INFO  L276                IsEmpty]: Start isEmpty. Operand 21441 states and 29991 transitions.
[2021-01-07 01:25:02,619 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2021-01-07 01:25:02,619 INFO  L414         BasicCegarLoop]: Found error trace
[2021-01-07 01:25:02,620 INFO  L422         BasicCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-01-07 01:25:02,835 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2021-01-07 01:25:02,836 INFO  L429      AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-07 01:25:02,836 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-01-07 01:25:02,837 INFO  L82        PathProgramCache]: Analyzing trace with hash 1459165845, now seen corresponding path program 2 times
[2021-01-07 01:25:02,837 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-07 01:25:02,837 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102763940]
[2021-01-07 01:25:02,838 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-07 01:25:02,943 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-07 01:25:03,119 INFO  L134       CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-01-07 01:25:03,119 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102763940]
[2021-01-07 01:25:03,120 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177900374]
[2021-01-07 01:25:03,120 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2021-01-07 01:25:05,406 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2021-01-07 01:25:05,406 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2021-01-07 01:25:05,423 INFO  L263         TraceCheckSpWp]: Trace formula consists of 2275 conjuncts, 9 conjunts are in the unsatisfiable core
[2021-01-07 01:25:05,426 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2021-01-07 01:25:05,707 INFO  L134       CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-01-07 01:25:05,707 INFO  L219   FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2021-01-07 01:25:05,707 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16
[2021-01-07 01:25:05,707 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386349347]
[2021-01-07 01:25:05,708 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 16 states
[2021-01-07 01:25:05,708 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-07 01:25:05,709 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2021-01-07 01:25:05,709 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240
[2021-01-07 01:25:05,709 INFO  L87              Difference]: Start difference. First operand 21441 states and 29991 transitions. Second operand 16 states.
[2021-01-07 01:25:08,877 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-07 01:25:08,877 INFO  L93              Difference]: Finished difference Result 42977 states and 60180 transitions.
[2021-01-07 01:25:08,878 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-01-07 01:25:08,878 INFO  L78                 Accepts]: Start accepts. Automaton has 16 states. Word has length 91
[2021-01-07 01:25:08,878 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-07 01:25:08,906 INFO  L225             Difference]: With dead ends: 42977
[2021-01-07 01:25:08,906 INFO  L226             Difference]: Without dead ends: 21545
[2021-01-07 01:25:08,927 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240
[2021-01-07 01:25:08,942 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21545 states.
[2021-01-07 01:25:11,907 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21545 to 21545.
[2021-01-07 01:25:11,907 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21545 states.
[2021-01-07 01:25:11,944 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21545 states to 21545 states and 30095 transitions.
[2021-01-07 01:25:11,944 INFO  L78                 Accepts]: Start accepts. Automaton has 21545 states and 30095 transitions. Word has length 91
[2021-01-07 01:25:11,945 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-01-07 01:25:11,945 INFO  L481      AbstractCegarLoop]: Abstraction has 21545 states and 30095 transitions.
[2021-01-07 01:25:11,945 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 16 states.
[2021-01-07 01:25:11,945 INFO  L276                IsEmpty]: Start isEmpty. Operand 21545 states and 30095 transitions.
[2021-01-07 01:25:11,961 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 93
[2021-01-07 01:25:11,961 INFO  L414         BasicCegarLoop]: Found error trace
[2021-01-07 01:25:11,961 INFO  L422         BasicCegarLoop]: trace histogram [7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-01-07 01:25:12,175 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2021-01-07 01:25:12,176 INFO  L429      AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-07 01:25:12,177 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-01-07 01:25:12,177 INFO  L82        PathProgramCache]: Analyzing trace with hash 705259788, now seen corresponding path program 3 times
[2021-01-07 01:25:12,177 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-07 01:25:12,178 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239482029]
[2021-01-07 01:25:12,178 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-07 01:25:12,303 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-07 01:25:12,513 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-01-07 01:25:12,513 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239482029]
[2021-01-07 01:25:12,514 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865602457]
[2021-01-07 01:25:12,514 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2021-01-07 01:25:15,065 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2021-01-07 01:25:15,065 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2021-01-07 01:25:15,080 INFO  L263         TraceCheckSpWp]: Trace formula consists of 2239 conjuncts, 4 conjunts are in the unsatisfiable core
[2021-01-07 01:25:15,083 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2021-01-07 01:25:15,224 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2021-01-07 01:25:15,225 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2021-01-07 01:25:15,225 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13
[2021-01-07 01:25:15,225 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534503242]
[2021-01-07 01:25:15,226 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-01-07 01:25:15,226 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-07 01:25:15,226 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-01-07 01:25:15,226 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156
[2021-01-07 01:25:15,227 INFO  L87              Difference]: Start difference. First operand 21545 states and 30095 transitions. Second operand 5 states.
[2021-01-07 01:25:26,295 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-07 01:25:26,296 INFO  L93              Difference]: Finished difference Result 65017 states and 91159 transitions.
[2021-01-07 01:25:26,296 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2021-01-07 01:25:26,297 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 92
[2021-01-07 01:25:26,297 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-07 01:25:26,376 INFO  L225             Difference]: With dead ends: 65017
[2021-01-07 01:25:26,376 INFO  L226             Difference]: Without dead ends: 53972
[2021-01-07 01:25:26,395 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156
[2021-01-07 01:25:26,435 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 53972 states.
[2021-01-07 01:25:32,611 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 53972 to 43437.
[2021-01-07 01:25:32,611 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 43437 states.
[2021-01-07 01:25:32,710 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 43437 states to 43437 states and 60777 transitions.
[2021-01-07 01:25:32,711 INFO  L78                 Accepts]: Start accepts. Automaton has 43437 states and 60777 transitions. Word has length 92
[2021-01-07 01:25:32,711 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-01-07 01:25:32,711 INFO  L481      AbstractCegarLoop]: Abstraction has 43437 states and 60777 transitions.
[2021-01-07 01:25:32,711 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2021-01-07 01:25:32,711 INFO  L276                IsEmpty]: Start isEmpty. Operand 43437 states and 60777 transitions.
[2021-01-07 01:25:32,727 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 95
[2021-01-07 01:25:32,727 INFO  L414         BasicCegarLoop]: Found error trace
[2021-01-07 01:25:32,727 INFO  L422         BasicCegarLoop]: trace histogram [7, 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]
[2021-01-07 01:25:32,942 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2021-01-07 01:25:32,942 INFO  L429      AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-07 01:25:32,943 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-01-07 01:25:32,943 INFO  L82        PathProgramCache]: Analyzing trace with hash -1679071605, now seen corresponding path program 1 times
[2021-01-07 01:25:32,943 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-07 01:25:32,943 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607568194]
[2021-01-07 01:25:32,944 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-07 01:25:33,053 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-07 01:25:33,162 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2021-01-07 01:25:33,163 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607568194]
[2021-01-07 01:25:33,163 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-01-07 01:25:33,163 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-01-07 01:25:33,163 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888919766]
[2021-01-07 01:25:33,164 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-01-07 01:25:33,164 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-07 01:25:33,165 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-01-07 01:25:33,165 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-01-07 01:25:33,165 INFO  L87              Difference]: Start difference. First operand 43437 states and 60777 transitions. Second operand 4 states.
[2021-01-07 01:25:47,495 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-07 01:25:47,496 INFO  L93              Difference]: Finished difference Result 128841 states and 180320 transitions.
[2021-01-07 01:25:47,497 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2021-01-07 01:25:47,497 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 94
[2021-01-07 01:25:47,497 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-07 01:25:47,652 INFO  L225             Difference]: With dead ends: 128841
[2021-01-07 01:25:47,652 INFO  L226             Difference]: Without dead ends: 95904
[2021-01-07 01:25:47,704 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:25:47,786 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 95904 states.
[2021-01-07 01:25:54,496 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 95904 to 44373.
[2021-01-07 01:25:54,497 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 44373 states.
[2021-01-07 01:25:54,667 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 44373 states to 44373 states and 62103 transitions.
[2021-01-07 01:25:54,668 INFO  L78                 Accepts]: Start accepts. Automaton has 44373 states and 62103 transitions. Word has length 94
[2021-01-07 01:25:54,668 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-01-07 01:25:54,668 INFO  L481      AbstractCegarLoop]: Abstraction has 44373 states and 62103 transitions.
[2021-01-07 01:25:54,668 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2021-01-07 01:25:54,668 INFO  L276                IsEmpty]: Start isEmpty. Operand 44373 states and 62103 transitions.
[2021-01-07 01:25:54,679 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2021-01-07 01:25:54,679 INFO  L414         BasicCegarLoop]: Found error trace
[2021-01-07 01:25:54,679 INFO  L422         BasicCegarLoop]: trace histogram [7, 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]
[2021-01-07 01:25:54,680 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2021-01-07 01:25:54,680 INFO  L429      AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-07 01:25:54,680 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-01-07 01:25:54,680 INFO  L82        PathProgramCache]: Analyzing trace with hash 337113572, now seen corresponding path program 1 times
[2021-01-07 01:25:54,680 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-07 01:25:54,680 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609194250]
[2021-01-07 01:25:54,681 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-07 01:25:54,781 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-07 01:25:54,998 INFO  L134       CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2021-01-07 01:25:54,999 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609194250]
[2021-01-07 01:25:54,999 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904151365]
[2021-01-07 01:25:54,999 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2021-01-07 01:25:55,876 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-07 01:25:55,883 INFO  L263         TraceCheckSpWp]: Trace formula consists of 2290 conjuncts, 10 conjunts are in the unsatisfiable core
[2021-01-07 01:25:55,890 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2021-01-07 01:25:56,240 INFO  L134       CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2021-01-07 01:25:56,240 INFO  L219   FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2021-01-07 01:25:56,241 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18
[2021-01-07 01:25:56,241 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41877442]
[2021-01-07 01:25:56,241 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 18 states
[2021-01-07 01:25:56,241 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-07 01:25:56,242 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2021-01-07 01:25:56,242 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306
[2021-01-07 01:25:56,242 INFO  L87              Difference]: Start difference. First operand 44373 states and 62103 transitions. Second operand 18 states.