/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-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 01:41:25,927 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 01:41:25,930 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 01:41:25,964 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 01:41:25,964 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 01:41:25,966 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 01:41:25,967 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 01:41:25,970 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 01:41:25,972 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 01:41:25,973 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 01:41:25,974 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 01:41:25,975 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 01:41:25,976 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 01:41:25,977 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 01:41:25,978 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 01:41:25,980 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 01:41:25,981 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 01:41:25,982 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 01:41:25,984 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 01:41:25,989 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 01:41:25,991 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 01:41:25,995 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 01:41:25,997 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 01:41:26,013 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 01:41:26,019 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 01:41:26,019 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 01:41:26,019 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 01:41:26,022 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 01:41:26,023 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 01:41:26,024 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 01:41:26,024 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 01:41:26,028 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 01:41:26,029 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 01:41:26,030 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 01:41:26,032 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 01:41:26,033 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 01:41:26,033 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 01:41:26,034 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 01:41:26,034 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 01:41:26,038 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 01:41:26,039 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 01:41:26,041 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:41:26,091 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 01:41:26,091 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 01:41:26,094 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 01:41:26,094 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 01:41:26,094 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 01:41:26,095 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 01:41:26,095 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 01:41:26,096 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 01:41:26,097 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-07 01:41:26,097 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 01:41:26,097 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-07 01:41:26,097 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-07 01:41:26,097 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 01:41:26,098 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-07 01:41:26,098 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 01:41:26,099 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 01:41:26,099 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 01:41:26,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 01:41:26,099 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 01:41:26,100 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 01:41:26,100 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-07 01:41:26,100 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 01:41:26,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 01:41:26,100 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-07 01:41:26,101 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 01:41:26,101 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:41:26,490 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 01:41:26,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 01:41:26,530 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 01:41:26,532 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 01:41:26,532 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 01:41:26,533 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i [2021-01-07 01:41:26,628 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e4db0f9b3/b2215e02a97f4481b951900806220050/FLAG2e23a1736 [2021-01-07 01:41:27,744 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 01:41:27,744 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i [2021-01-07 01:41:27,805 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e4db0f9b3/b2215e02a97f4481b951900806220050/FLAG2e23a1736 [2021-01-07 01:41:28,181 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e4db0f9b3/b2215e02a97f4481b951900806220050 [2021-01-07 01:41:28,185 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 01:41:28,188 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 01:41:28,190 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 01:41:28,190 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 01:41:28,194 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 01:41:28,195 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 01:41:28" (1/1) ... [2021-01-07 01:41:28,197 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21f54d1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:41:28, skipping insertion in model container [2021-01-07 01:41:28,197 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 01:41:28" (1/1) ... [2021-01-07 01:41:28,208 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 01:41:28,327 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~p~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~p~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[207],StructAccessExpression[IdentifierExpression[~skb,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~__ret_warn_on~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~err~0,] left hand side expression in assignment: lhs: VariableLHS[~rbuff~0,] left hand side expression in assignment: lhs: VariableLHS[~xbuff~0,] left hand side expression in assignment: lhs: VariableLHS[~cbuff~0,] left hand side expression in assignment: lhs: VariableLHS[~slcomp~0,] left hand side expression in assignment: lhs: VariableLHS[~len~0,] left hand side expression in assignment: lhs: VariableLHS[~len~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~rbuff~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~xbuff~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~cbuff~0,] left hand side expression in assignment: lhs: VariableLHS[~slcomp~0,] left hand side expression in assignment: lhs: VariableLHS[~err~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[156],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[160],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[108],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[128],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~__x~0,] left hand side expression in assignment: lhs: VariableLHS[~__ptr~0,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___0~0,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___1~0,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___2~0,] left hand side expression in assignment: lhs: VariableLHS[~rbuff~0,] left hand side expression in assignment: lhs: VariableLHS[~__x___0~0,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___3~0,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___4~0,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___5~0,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___6~0,] left hand side expression in assignment: lhs: VariableLHS[~xbuff~0,] left hand side expression in assignment: lhs: VariableLHS[~__x___1~0,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___7~0,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___8~0,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___9~0,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___10~0,] left hand side expression in assignment: lhs: VariableLHS[~cbuff~0,] left hand side expression in assignment: lhs: VariableLHS[~__x___2~0,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___11~0,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___12~0,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___13~0,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___14~0,] left hand side expression in assignment: lhs: VariableLHS[~slcomp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[164],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[168],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~0,] left hand side expression in assignment: lhs: VariableLHS[~__x~1,] left hand side expression in assignment: lhs: VariableLHS[~__ptr~1,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___0~1,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___1~1,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___2~1,] left hand side expression in assignment: lhs: VariableLHS[~__x___0~1,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___3~1,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___4~1,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___5~1,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___6~1,] left hand side expression in assignment: lhs: VariableLHS[~__x___1~1,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___7~1,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___8~1,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___9~1,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___10~1,] left hand side expression in assignment: lhs: VariableLHS[~__x___2~1,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___11~1,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___12~1,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___13~1,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___14~1,] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: lhs: VariableLHS[~dev~0,] left hand side expression in assignment: lhs: VariableLHS[~len~1,] left hand side expression in assignment: lhs: VariableLHS[~len~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~xbuff~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~rbuff~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~cbuff~1,] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: lhs: VariableLHS[~__x~2,] left hand side expression in assignment: lhs: VariableLHS[~__ptr~2,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___0~2,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___1~2,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___2~2,] left hand side expression in assignment: lhs: VariableLHS[~xbuff~1,] left hand side expression in assignment: lhs: VariableLHS[~__x___0~2,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___3~2,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___4~2,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___5~2,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___6~2,] left hand side expression in assignment: lhs: VariableLHS[~rbuff~1,] left hand side expression in assignment: lhs: VariableLHS[~__x___1~2,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___7~2,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___8~2,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___9~2,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___10~2,] left hand side expression in assignment: lhs: VariableLHS[~cbuff~1,] left hand side expression in assignment: lhs: VariableLHS[~__len~0,] left hand side expression in assignment: lhs: VariableLHS[~__ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[128],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[254],StructAccessExpression[IdentifierExpression[~dev~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[120],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~__len___0~0,] left hand side expression in assignment: lhs: VariableLHS[~__ret___0~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[108],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[286],StructAccessExpression[IdentifierExpression[~dev~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[156],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[444],StructAccessExpression[IdentifierExpression[~dev~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[160],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: lhs: VariableLHS[~dev~1,] left hand side expression in assignment: lhs: VariableLHS[~count~0,] left hand side expression in assignment: lhs: VariableLHS[~c~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[286],StructAccessExpression[IdentifierExpression[~dev~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~count~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[180],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[180],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[#t~mem171,] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[214],StructAccessExpression[IdentifierExpression[~dev~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skb~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[246],StructAccessExpression[IdentifierExpression[~dev~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~skb~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~__len~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: lhs: VariableLHS[~__ret~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[134],StructAccessExpression[IdentifierExpression[~skb~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[198],StructAccessExpression[IdentifierExpression[~dev~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem191,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[254],StructAccessExpression[IdentifierExpression[#t~mem191,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~p~3,] left hand side expression in assignment: lhs: VariableLHS[~len,] left hand side expression in assignment: lhs: VariableLHS[~count~1,] left hand side expression in assignment: lhs: VariableLHS[~count~1,] left hand side expression in assignment: lhs: VariableLHS[~actual~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem216,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[908],StructAccessExpression[IdentifierExpression[#t~mem216,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[128],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[120],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~sl~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem224,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[206],StructAccessExpression[IdentifierExpression[#t~mem224,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~actual~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[128],StructAccessExpression[IdentifierExpression[~sl~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[120],StructAccessExpression[IdentifierExpression[~sl~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~sl~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[128],StructAccessExpression[IdentifierExpression[~sl~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~sl~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[222],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] left hand side expression in assignment: lhs: VariableLHS[~sl~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[108],StructAccessExpression[IdentifierExpression[~sl~3,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[128],StructAccessExpression[IdentifierExpression[~sl~3,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~24,] left hand side expression in assignment: lhs: VariableLHS[~sl~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~4,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[172],StructAccessExpression[IdentifierExpression[~sl~4,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~25,] left hand side expression in assignment: lhs: VariableLHS[~sl~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] left hand side expression in assignment: lhs: VariableLHS[~devstats~0,] left hand side expression in assignment: lhs: VariableLHS[~c_rx_dropped~0,] left hand side expression in assignment: lhs: VariableLHS[~c_rx_fifo_errors~0,] left hand side expression in assignment: lhs: VariableLHS[~c_tx_fifo_errors~0,] left hand side expression in assignment: lhs: VariableLHS[~c_collisions~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~26,] left hand side expression in assignment: lhs: VariableLHS[~sl~6,] left hand side expression in assignment: lhs: VariableLHS[~comp~0,] left hand side expression in assignment: lhs: VariableLHS[~c_rx_fifo_errors~0,] left hand side expression in assignment: lhs: VariableLHS[~c_rx_dropped~0,] left hand side expression in assignment: lhs: VariableLHS[~c_tx_fifo_errors~0,] left hand side expression in assignment: lhs: VariableLHS[~c_collisions~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[112],StructAccessExpression[IdentifierExpression[~stats,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[144],StructAccessExpression[IdentifierExpression[~stats,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~stats,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats,],base],StructAccessExpression[IdentifierExpression[~stats,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~stats,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~stats,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~stats,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~stats,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~stats,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~stats,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~stats,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~stats,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~27,] left hand side expression in assignment: lhs: VariableLHS[~sl~7,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[444],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[448],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[916],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~28,] left hand side expression in assignment: lhs: VariableLHS[~sl~8,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~slip_devs~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~slip_devs~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~0,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~0,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~0,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[406],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1104],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[450],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[489],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[828],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[430],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~sl~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp~29,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: lhs: VariableLHS[~fp,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~10,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem301,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[230],StructAccessExpression[IdentifierExpression[#t~mem301,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~cp,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: lhs: VariableLHS[~cp,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] left hand side expression in assignment: lhs: VariableLHS[~cp,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~count,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~dev~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~30,] left hand side expression in assignment: lhs: VariableLHS[~sl~10,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~dev~3,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~dev~3,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~31,] left hand side expression in assignment: lhs: VariableLHS[~sl~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~11,] left hand side expression in assignment: lhs: VariableLHS[~dev~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~slip_devs~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~slip_devs~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~2,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~2,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~2,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]]] left hand side expression in assignment: lhs: VariableLHS[~dev~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[112],StructAccessExpression[IdentifierExpression[~dev~3,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~5,] left hand side expression in assignment: lhs: VariableLHS[~sl~11,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~11,],base],StructAccessExpression[IdentifierExpression[~sl~11,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~11,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~sl~11,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~11,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[180],StructAccessExpression[IdentifierExpression[~sl~11,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~11,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[356],StructAccessExpression[IdentifierExpression[~sl~11,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~11,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[348],StructAccessExpression[IdentifierExpression[~sl~11,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~11,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[232],StructAccessExpression[IdentifierExpression[~sl~11,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~11,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[224],StructAccessExpression[IdentifierExpression[~sl~11,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~slip_devs~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~slip_devs~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~2,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~2,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~2,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~32,] left hand side expression in assignment: lhs: VariableLHS[~sl~12,] left hand side expression in assignment: lhs: VariableLHS[~err~2,] left hand side expression in assignment: lhs: VariableLHS[~err~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~12,] left hand side expression in assignment: lhs: VariableLHS[~sl~12,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~12,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~sl~12,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tty,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1095],StructAccessExpression[IdentifierExpression[~tty,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~12,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[182],StructAccessExpression[IdentifierExpression[~sl~12,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~6,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~12,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[186],StructAccessExpression[IdentifierExpression[~sl~12,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~3,] left hand side expression in assignment: lhs: VariableLHS[~err~2,] left hand side expression in assignment: lhs: VariableLHS[~err~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~12,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[332],StructAccessExpression[IdentifierExpression[~sl~12,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~12,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[208],StructAccessExpression[IdentifierExpression[~sl~12,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tty,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[543],StructAccessExpression[IdentifierExpression[~tty,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~12,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~sl~12,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tty,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1095],StructAccessExpression[IdentifierExpression[~tty,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~sl~13,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tty,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1095],StructAccessExpression[IdentifierExpression[~tty,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~13,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~sl~13,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~13,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[182],StructAccessExpression[IdentifierExpression[~sl~13,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ptr~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~33,] left hand side expression in assignment: lhs: VariableLHS[~ptr~0,] left hand side expression in assignment: address: IdentifierExpression[~tmp~33,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~13,] left hand side expression in assignment: lhs: VariableLHS[~s,] left hand side expression in assignment: lhs: VariableLHS[~c~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~7,] left hand side expression in assignment: lhs: VariableLHS[~ptr~0,] left hand side expression in assignment: address: IdentifierExpression[~tmp___1~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~4,] left hand side expression in assignment: lhs: VariableLHS[~ptr~0,] left hand side expression in assignment: address: IdentifierExpression[~tmp___2~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~2,] left hand side expression in assignment: lhs: VariableLHS[~ptr~0,] left hand side expression in assignment: address: IdentifierExpression[~tmp___3~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~1,] left hand side expression in assignment: lhs: VariableLHS[~ptr~0,] left hand side expression in assignment: address: IdentifierExpression[~tmp___4~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~ptr~0,] left hand side expression in assignment: address: IdentifierExpression[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~len,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~ptr~0,] left hand side expression in assignment: address: IdentifierExpression[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~34,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~14,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[108],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~8,] left hand side expression in assignment: lhs: VariableLHS[~s,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~5,] left hand side expression in assignment: lhs: VariableLHS[~s,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[108],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem369,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem369,],offset],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~tmp___3~3,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~tmp___3~3,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~tmp___3~3,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem370,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[286],StructAccessExpression[IdentifierExpression[#t~mem370,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ptr~1,] left hand side expression in assignment: lhs: VariableLHS[~v~0,] left hand side expression in assignment: lhs: VariableLHS[~bits~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~35,] left hand side expression in assignment: lhs: VariableLHS[~ptr~1,] left hand side expression in assignment: address: IdentifierExpression[~tmp~35,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~v~0,] left hand side expression in assignment: lhs: VariableLHS[~bits~0,] left hand side expression in assignment: lhs: VariableLHS[~bits~0,] left hand side expression in assignment: lhs: VariableLHS[~c~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~15,] left hand side expression in assignment: lhs: VariableLHS[~ptr~1,] left hand side expression in assignment: address: IdentifierExpression[~tmp___0~15,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~c~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~9,] left hand side expression in assignment: lhs: VariableLHS[~ptr~1,] left hand side expression in assignment: address: IdentifierExpression[~tmp___1~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~6,] left hand side expression in assignment: lhs: VariableLHS[~ptr~1,] left hand side expression in assignment: address: IdentifierExpression[~tmp___2~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~36,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~16,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[108],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[168],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[164],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[164],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[168],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[168],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~c~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~10,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[108],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem389,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem389,],offset],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~tmp___1~10,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~tmp___1~10,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~tmp___1~10,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem390,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[286],StructAccessExpression[IdentifierExpression[#t~mem390,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~sl~14,] left hand side expression in assignment: lhs: VariableLHS[~p~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~17,] left hand side expression in assignment: lhs: VariableLHS[~tmp~37,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~11,] left hand side expression in assignment: lhs: VariableLHS[~__pu_val~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~37,] left hand side expression in assignment: lhs: VariableLHS[~tmp~37,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~14,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[180],StructAccessExpression[IdentifierExpression[~sl~14,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem405,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[448],StructAccessExpression[IdentifierExpression[#t~mem405,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~37,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~14,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[191],StructAccessExpression[IdentifierExpression[~sl~14,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~__pu_val___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~37,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~14,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[190],StructAccessExpression[IdentifierExpression[~sl~14,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~__pu_val___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp~38,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp~39,] left hand side expression in assignment: lhs: VariableLHS[~sl~15,] left hand side expression in assignment: lhs: VariableLHS[~p~5,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~15,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[191],StructAccessExpression[IdentifierExpression[~sl~15,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~15,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[332],StructAccessExpression[IdentifierExpression[~sl~15,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~p~5,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~15,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[190],StructAccessExpression[IdentifierExpression[~sl~15,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~p~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~19,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~12,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~15,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[181],StructAccessExpression[IdentifierExpression[~sl~15,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~15,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[181],StructAccessExpression[IdentifierExpression[~sl~15,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~p~5,] left hand side expression in assignment: lhs: VariableLHS[~slip_maxdev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~40,] left hand side expression in assignment: lhs: VariableLHS[~slip_devs~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~status~0,] left hand side expression in assignment: lhs: VariableLHS[~timeout~0,] left hand side expression in assignment: lhs: VariableLHS[~busy~0,] left hand side expression in assignment: lhs: VariableLHS[~busy~0,] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: lhs: VariableLHS[~dev~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~41,] left hand side expression in assignment: lhs: VariableLHS[~sl~16,] left hand side expression in assignment: lhs: VariableLHS[~busy~0,] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: lhs: VariableLHS[~dev~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~slip_devs~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~slip_devs~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~4,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~4,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~4,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~20,] left hand side expression in assignment: lhs: VariableLHS[~sl~16,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~4,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1104],StructAccessExpression[IdentifierExpression[~dev~4,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: lhs: VariableLHS[~slip_devs~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: lhs: VariableLHS[~sl~17,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~21,] left hand side expression in assignment: lhs: VariableLHS[~s~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~42,] left hand side expression in assignment: lhs: VariableLHS[~sl~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp~43,] left hand side expression in assignment: lhs: VariableLHS[~tmp~44,] left hand side expression in assignment: lhs: VariableLHS[~sl_ldisc_group1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~45,] left hand side expression in assignment: lhs: VariableLHS[~sl_netdev_ops_group1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_list_1~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ldv_timer_list_1~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~ldv_timer_list_1~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_state_1~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ldv_timer_list_1~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~ldv_timer_list_1~0,GLOBAL],offset]]]] 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_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_list_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_state_1~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_state_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~46,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~22,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~13,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg0~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg7~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg13~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~3,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg10~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~1,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg9~0,] 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___6~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~1,] 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_retval_1~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[~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_retval_0~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[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~tmp___9~0,] 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_3~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_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~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_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~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_3~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_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~47,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~48,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~49,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~23,] left hand side expression in assignment: lhs: VariableLHS[~tmp~50,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~24,] left hand side expression in assignment: lhs: VariableLHS[~tmp~51,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~52,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~53,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~54,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp~55,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp~56,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp~57,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp~58,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp~59,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp~60,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp~61,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp~62,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp~63,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp~64,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~17,] [2021-01-07 01:41:29,784 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-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i[216887,216900] [2021-01-07 01:41:29,805 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 01:41:29,831 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~p~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~p~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[207],StructAccessExpression[IdentifierExpression[~skb,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~__ret_warn_on~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~err~0,] left hand side expression in assignment: lhs: VariableLHS[~rbuff~0,] left hand side expression in assignment: lhs: VariableLHS[~xbuff~0,] left hand side expression in assignment: lhs: VariableLHS[~cbuff~0,] left hand side expression in assignment: lhs: VariableLHS[~slcomp~0,] left hand side expression in assignment: lhs: VariableLHS[~len~0,] left hand side expression in assignment: lhs: VariableLHS[~len~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~rbuff~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~xbuff~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~cbuff~0,] left hand side expression in assignment: lhs: VariableLHS[~slcomp~0,] left hand side expression in assignment: lhs: VariableLHS[~err~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[156],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[160],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[108],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[128],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~__x~0,] left hand side expression in assignment: lhs: VariableLHS[~__ptr~0,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___0~0,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___1~0,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___2~0,] left hand side expression in assignment: lhs: VariableLHS[~rbuff~0,] left hand side expression in assignment: lhs: VariableLHS[~__x___0~0,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___3~0,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___4~0,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___5~0,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___6~0,] left hand side expression in assignment: lhs: VariableLHS[~xbuff~0,] left hand side expression in assignment: lhs: VariableLHS[~__x___1~0,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___7~0,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___8~0,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___9~0,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___10~0,] left hand side expression in assignment: lhs: VariableLHS[~cbuff~0,] left hand side expression in assignment: lhs: VariableLHS[~__x___2~0,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___11~0,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___12~0,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___13~0,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___14~0,] left hand side expression in assignment: lhs: VariableLHS[~slcomp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[164],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[168],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~0,] left hand side expression in assignment: lhs: VariableLHS[~__x~1,] left hand side expression in assignment: lhs: VariableLHS[~__ptr~1,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___0~1,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___1~1,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___2~1,] left hand side expression in assignment: lhs: VariableLHS[~__x___0~1,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___3~1,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___4~1,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___5~1,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___6~1,] left hand side expression in assignment: lhs: VariableLHS[~__x___1~1,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___7~1,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___8~1,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___9~1,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___10~1,] left hand side expression in assignment: lhs: VariableLHS[~__x___2~1,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___11~1,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___12~1,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___13~1,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___14~1,] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: lhs: VariableLHS[~dev~0,] left hand side expression in assignment: lhs: VariableLHS[~len~1,] left hand side expression in assignment: lhs: VariableLHS[~len~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~xbuff~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~rbuff~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~cbuff~1,] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: lhs: VariableLHS[~__x~2,] left hand side expression in assignment: lhs: VariableLHS[~__ptr~2,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___0~2,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___1~2,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___2~2,] left hand side expression in assignment: lhs: VariableLHS[~xbuff~1,] left hand side expression in assignment: lhs: VariableLHS[~__x___0~2,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___3~2,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___4~2,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___5~2,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___6~2,] left hand side expression in assignment: lhs: VariableLHS[~rbuff~1,] left hand side expression in assignment: lhs: VariableLHS[~__x___1~2,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___7~2,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___8~2,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___9~2,] left hand side expression in assignment: lhs: VariableLHS[~__ptr___10~2,] left hand side expression in assignment: lhs: VariableLHS[~cbuff~1,] left hand side expression in assignment: lhs: VariableLHS[~__len~0,] left hand side expression in assignment: lhs: VariableLHS[~__ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[128],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[254],StructAccessExpression[IdentifierExpression[~dev~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[120],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~__len___0~0,] left hand side expression in assignment: lhs: VariableLHS[~__ret___0~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[108],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[286],StructAccessExpression[IdentifierExpression[~dev~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[156],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[444],StructAccessExpression[IdentifierExpression[~dev~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[160],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: lhs: VariableLHS[~dev~1,] left hand side expression in assignment: lhs: VariableLHS[~count~0,] left hand side expression in assignment: lhs: VariableLHS[~c~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[286],StructAccessExpression[IdentifierExpression[~dev~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~count~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[180],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[180],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[#t~mem171,] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[214],StructAccessExpression[IdentifierExpression[~dev~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skb~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[246],StructAccessExpression[IdentifierExpression[~dev~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~skb~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~__len~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: lhs: VariableLHS[~__ret~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[134],StructAccessExpression[IdentifierExpression[~skb~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[198],StructAccessExpression[IdentifierExpression[~dev~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem191,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[254],StructAccessExpression[IdentifierExpression[#t~mem191,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~#p~3,] left hand side expression in assignment: lhs: VariableLHS[~len,] left hand side expression in assignment: lhs: VariableLHS[~count~1,] left hand side expression in assignment: lhs: VariableLHS[~count~1,] left hand side expression in assignment: lhs: VariableLHS[~actual~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem219,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[908],StructAccessExpression[IdentifierExpression[#t~mem219,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[128],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[120],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~sl~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem227,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[206],StructAccessExpression[IdentifierExpression[#t~mem227,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~actual~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[128],StructAccessExpression[IdentifierExpression[~sl~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[120],StructAccessExpression[IdentifierExpression[~sl~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~sl~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[128],StructAccessExpression[IdentifierExpression[~sl~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~sl~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[222],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] left hand side expression in assignment: lhs: VariableLHS[~sl~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[108],StructAccessExpression[IdentifierExpression[~sl~3,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[128],StructAccessExpression[IdentifierExpression[~sl~3,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~24,] left hand side expression in assignment: lhs: VariableLHS[~sl~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~4,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[172],StructAccessExpression[IdentifierExpression[~sl~4,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~25,] left hand side expression in assignment: lhs: VariableLHS[~sl~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] left hand side expression in assignment: lhs: VariableLHS[~devstats~0,] left hand side expression in assignment: lhs: VariableLHS[~c_rx_dropped~0,] left hand side expression in assignment: lhs: VariableLHS[~c_rx_fifo_errors~0,] left hand side expression in assignment: lhs: VariableLHS[~c_tx_fifo_errors~0,] left hand side expression in assignment: lhs: VariableLHS[~c_collisions~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~26,] left hand side expression in assignment: lhs: VariableLHS[~sl~6,] left hand side expression in assignment: lhs: VariableLHS[~comp~0,] left hand side expression in assignment: lhs: VariableLHS[~c_rx_fifo_errors~0,] left hand side expression in assignment: lhs: VariableLHS[~c_rx_dropped~0,] left hand side expression in assignment: lhs: VariableLHS[~c_tx_fifo_errors~0,] left hand side expression in assignment: lhs: VariableLHS[~c_collisions~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[112],StructAccessExpression[IdentifierExpression[~stats,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[144],StructAccessExpression[IdentifierExpression[~stats,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~stats,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats,],base],StructAccessExpression[IdentifierExpression[~stats,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~stats,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~stats,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~stats,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~stats,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~stats,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~stats,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~stats,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~stats,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~stats,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~27,] left hand side expression in assignment: lhs: VariableLHS[~sl~7,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[444],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[448],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[916],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~28,] left hand side expression in assignment: lhs: VariableLHS[~sl~8,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~slip_devs~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~slip_devs~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~0,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~0,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~0,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[406],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1104],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[450],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[489],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[828],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[430],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~sl~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp~29,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: lhs: VariableLHS[~fp,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~10,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem304,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[230],StructAccessExpression[IdentifierExpression[#t~mem304,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~cp,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: lhs: VariableLHS[~cp,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] left hand side expression in assignment: lhs: VariableLHS[~cp,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~count,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~dev~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~30,] left hand side expression in assignment: lhs: VariableLHS[~sl~10,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~dev~3,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~dev~3,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~31,] left hand side expression in assignment: lhs: VariableLHS[~sl~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~11,] left hand side expression in assignment: lhs: VariableLHS[~dev~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~slip_devs~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~slip_devs~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~2,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~2,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~2,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]]] left hand side expression in assignment: lhs: VariableLHS[~dev~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[112],StructAccessExpression[IdentifierExpression[~dev~3,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~5,] left hand side expression in assignment: lhs: VariableLHS[~sl~11,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~11,],base],StructAccessExpression[IdentifierExpression[~sl~11,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~11,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~sl~11,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~11,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[180],StructAccessExpression[IdentifierExpression[~sl~11,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~11,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[356],StructAccessExpression[IdentifierExpression[~sl~11,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~11,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[348],StructAccessExpression[IdentifierExpression[~sl~11,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~11,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[232],StructAccessExpression[IdentifierExpression[~sl~11,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~11,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[224],StructAccessExpression[IdentifierExpression[~sl~11,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~slip_devs~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~slip_devs~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~2,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~2,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~2,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~32,] left hand side expression in assignment: lhs: VariableLHS[~sl~12,] left hand side expression in assignment: lhs: VariableLHS[~err~2,] left hand side expression in assignment: lhs: VariableLHS[~err~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~12,] left hand side expression in assignment: lhs: VariableLHS[~sl~12,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~12,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~sl~12,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tty,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1095],StructAccessExpression[IdentifierExpression[~tty,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~12,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[182],StructAccessExpression[IdentifierExpression[~sl~12,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~6,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~12,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[186],StructAccessExpression[IdentifierExpression[~sl~12,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~3,] left hand side expression in assignment: lhs: VariableLHS[~err~2,] left hand side expression in assignment: lhs: VariableLHS[~err~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~12,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[332],StructAccessExpression[IdentifierExpression[~sl~12,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~12,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[208],StructAccessExpression[IdentifierExpression[~sl~12,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tty,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[543],StructAccessExpression[IdentifierExpression[~tty,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~12,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~sl~12,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tty,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1095],StructAccessExpression[IdentifierExpression[~tty,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~sl~13,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tty,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1095],StructAccessExpression[IdentifierExpression[~tty,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~13,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~sl~13,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~13,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[182],StructAccessExpression[IdentifierExpression[~sl~13,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ptr~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~33,] left hand side expression in assignment: lhs: VariableLHS[~ptr~0,] left hand side expression in assignment: address: IdentifierExpression[~tmp~33,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~13,] left hand side expression in assignment: lhs: VariableLHS[~s,] left hand side expression in assignment: lhs: VariableLHS[~c~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~7,] left hand side expression in assignment: lhs: VariableLHS[~ptr~0,] left hand side expression in assignment: address: IdentifierExpression[~tmp___1~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~4,] left hand side expression in assignment: lhs: VariableLHS[~ptr~0,] left hand side expression in assignment: address: IdentifierExpression[~tmp___2~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~2,] left hand side expression in assignment: lhs: VariableLHS[~ptr~0,] left hand side expression in assignment: address: IdentifierExpression[~tmp___3~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~1,] left hand side expression in assignment: lhs: VariableLHS[~ptr~0,] left hand side expression in assignment: address: IdentifierExpression[~tmp___4~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~ptr~0,] left hand side expression in assignment: address: IdentifierExpression[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~len,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~ptr~0,] left hand side expression in assignment: address: IdentifierExpression[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~34,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~14,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[108],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~8,] left hand side expression in assignment: lhs: VariableLHS[~s,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~5,] left hand side expression in assignment: lhs: VariableLHS[~s,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[108],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem372,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem372,],offset],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~tmp___3~3,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~tmp___3~3,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~tmp___3~3,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem373,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[286],StructAccessExpression[IdentifierExpression[#t~mem373,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ptr~1,] left hand side expression in assignment: lhs: VariableLHS[~v~0,] left hand side expression in assignment: lhs: VariableLHS[~bits~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~35,] left hand side expression in assignment: lhs: VariableLHS[~ptr~1,] left hand side expression in assignment: address: IdentifierExpression[~tmp~35,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~v~0,] left hand side expression in assignment: lhs: VariableLHS[~bits~0,] left hand side expression in assignment: lhs: VariableLHS[~bits~0,] left hand side expression in assignment: lhs: VariableLHS[~c~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~15,] left hand side expression in assignment: lhs: VariableLHS[~ptr~1,] left hand side expression in assignment: address: IdentifierExpression[~tmp___0~15,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~c~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~9,] left hand side expression in assignment: lhs: VariableLHS[~ptr~1,] left hand side expression in assignment: address: IdentifierExpression[~tmp___1~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~6,] left hand side expression in assignment: lhs: VariableLHS[~ptr~1,] left hand side expression in assignment: address: IdentifierExpression[~tmp___2~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~36,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~16,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[108],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[168],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[164],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[164],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[168],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[168],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~c~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~10,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[108],StructAccessExpression[IdentifierExpression[~sl,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem392,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[#t~mem392,],offset],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~tmp___1~10,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~tmp___1~10,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~tmp___1~10,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem393,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[286],StructAccessExpression[IdentifierExpression[#t~mem393,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~sl~14,] left hand side expression in assignment: lhs: VariableLHS[~p~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~17,] left hand side expression in assignment: lhs: VariableLHS[~tmp~37,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~11,] left hand side expression in assignment: lhs: VariableLHS[~__pu_val~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~37,] left hand side expression in assignment: lhs: VariableLHS[~tmp~37,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~14,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[180],StructAccessExpression[IdentifierExpression[~sl~14,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem408,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[448],StructAccessExpression[IdentifierExpression[#t~mem408,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~37,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~14,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[191],StructAccessExpression[IdentifierExpression[~sl~14,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~__pu_val___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~37,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~14,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[190],StructAccessExpression[IdentifierExpression[~sl~14,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~__pu_val___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp~38,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp~39,] left hand side expression in assignment: lhs: VariableLHS[~sl~15,] left hand side expression in assignment: lhs: VariableLHS[~p~5,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~15,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[191],StructAccessExpression[IdentifierExpression[~sl~15,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~15,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[332],StructAccessExpression[IdentifierExpression[~sl~15,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~p~5,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~15,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[190],StructAccessExpression[IdentifierExpression[~sl~15,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~p~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~19,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~12,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~15,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[181],StructAccessExpression[IdentifierExpression[~sl~15,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sl~15,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[181],StructAccessExpression[IdentifierExpression[~sl~15,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~p~5,] left hand side expression in assignment: lhs: VariableLHS[~slip_maxdev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~40,] left hand side expression in assignment: lhs: VariableLHS[~slip_devs~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~status~0,] left hand side expression in assignment: lhs: VariableLHS[~timeout~0,] left hand side expression in assignment: lhs: VariableLHS[~busy~0,] left hand side expression in assignment: lhs: VariableLHS[~busy~0,] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: lhs: VariableLHS[~dev~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~41,] left hand side expression in assignment: lhs: VariableLHS[~sl~16,] left hand side expression in assignment: lhs: VariableLHS[~busy~0,] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: lhs: VariableLHS[~dev~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~slip_devs~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~slip_devs~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~4,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~4,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~4,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~20,] left hand side expression in assignment: lhs: VariableLHS[~sl~16,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~4,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1104],StructAccessExpression[IdentifierExpression[~dev~4,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: lhs: VariableLHS[~slip_devs~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: lhs: VariableLHS[~sl~17,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~21,] left hand side expression in assignment: address: IdentifierExpression[~#s~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~42,] left hand side expression in assignment: lhs: VariableLHS[~sl~18,] left hand side expression in assignment: lhs: VariableLHS[~tmp~43,] left hand side expression in assignment: lhs: VariableLHS[~tmp~44,] left hand side expression in assignment: lhs: VariableLHS[~sl_ldisc_group1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~45,] left hand side expression in assignment: lhs: VariableLHS[~sl_netdev_ops_group1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_list_1~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ldv_timer_list_1~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~ldv_timer_list_1~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_state_1~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ldv_timer_list_1~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~ldv_timer_list_1~0,GLOBAL],offset]]]] 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_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_list_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_timer_state_1~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_state_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~46,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~22,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~13,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg0~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg7~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg13~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~3,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg10~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~1,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg9~0,] 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___6~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~1,] 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_retval_1~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[~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_retval_0~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[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~tmp___9~0,] 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_3~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_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~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_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~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_3~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_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~47,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~48,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~49,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~23,] left hand side expression in assignment: lhs: VariableLHS[~tmp~50,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~24,] left hand side expression in assignment: lhs: VariableLHS[~tmp~51,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~52,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~53,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~54,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp~55,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp~56,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp~57,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp~58,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp~59,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp~60,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp~61,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp~62,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp~63,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp~64,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~17,] [2021-01-07 01:41:30,348 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-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i[216887,216900] [2021-01-07 01:41:30,367 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 01:41:30,741 INFO L208 MainTranslator]: Completed translation [2021-01-07 01:41:30,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:41:30 WrapperNode [2021-01-07 01:41:30,742 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 01:41:30,743 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 01:41:30,744 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 01:41:30,744 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 01:41:30,752 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:41:30" (1/1) ... [2021-01-07 01:41:30,854 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:41:30" (1/1) ... [2021-01-07 01:41:31,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 01:41:31,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 01:41:31,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 01:41:31,226 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 01:41:31,236 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:41:30" (1/1) ... [2021-01-07 01:41:31,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:41:30" (1/1) ... [2021-01-07 01:41:31,392 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:41:30" (1/1) ... [2021-01-07 01:41:31,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:41:30" (1/1) ... [2021-01-07 01:41:31,614 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:41:30" (1/1) ... [2021-01-07 01:41:31,765 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:41:30" (1/1) ... [2021-01-07 01:41:31,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:41:30" (1/1) ... [2021-01-07 01:41:31,868 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 01:41:31,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 01:41:31,870 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 01:41:31,870 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 01:41:31,872 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:41: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:41:31,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-01-07 01:41:31,996 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2021-01-07 01:41:31,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-01-07 01:41:31,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-01-07 01:41:31,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 01:41:31,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 01:41:31,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 01:41:31,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 01:41:31,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 01:41:31,997 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-01-07 01:41:31,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 01:41:31,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 01:41:31,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-01-07 01:41:31,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 01:41:31,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-01-07 01:41:31,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 01:41:31,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 01:41:41,849 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 01:41:41,850 INFO L299 CfgBuilder]: Removed 1734 assume(true) statements. [2021-01-07 01:41:41,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 01:41:41 BoogieIcfgContainer [2021-01-07 01:41:41,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 01:41:41,856 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 01:41:41,856 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 01:41:41,860 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 01:41:41,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 01:41:28" (1/3) ... [2021-01-07 01:41:41,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a07e17b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 01:41:41, skipping insertion in model container [2021-01-07 01:41:41,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:41:30" (2/3) ... [2021-01-07 01:41:41,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a07e17b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 01:41:41, skipping insertion in model container [2021-01-07 01:41:41,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 01:41:41" (3/3) ... [2021-01-07 01:41:41,863 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i [2021-01-07 01:41:41,870 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 01:41:41,879 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-07 01:41:41,898 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-07 01:41:41,933 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 01:41:41,934 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-07 01:41:41,934 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 01:41:41,934 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 01:41:41,934 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 01:41:41,934 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 01:41:41,934 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 01:41:41,935 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 01:41:41,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states. [2021-01-07 01:41:41,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-07 01:41:41,995 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:41:41,996 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:41:41,997 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:41:42,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:41:42,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1932152604, now seen corresponding path program 1 times [2021-01-07 01:41:42,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:41:42,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720360796] [2021-01-07 01:41:42,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:41:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:41:42,515 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:41:42,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720360796] [2021-01-07 01:41:42,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:41:42,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 01:41:42,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457052223] [2021-01-07 01:41:42,522 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-07 01:41:42,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:41:42,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-07 01:41:42,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 01:41:42,539 INFO L87 Difference]: Start difference. First operand 1850 states. Second operand 2 states. [2021-01-07 01:41:42,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:41:42,688 INFO L93 Difference]: Finished difference Result 3696 states and 5533 transitions. [2021-01-07 01:41:42,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-07 01:41:42,690 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 65 [2021-01-07 01:41:42,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:41:42,717 INFO L225 Difference]: With dead ends: 3696 [2021-01-07 01:41:42,717 INFO L226 Difference]: Without dead ends: 1815 [2021-01-07 01:41:42,726 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 01:41:42,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2021-01-07 01:41:42,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1815. [2021-01-07 01:41:42,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1815 states. [2021-01-07 01:41:42,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1815 states and 2681 transitions. [2021-01-07 01:41:42,851 INFO L78 Accepts]: Start accepts. Automaton has 1815 states and 2681 transitions. Word has length 65 [2021-01-07 01:41:42,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:41:42,851 INFO L481 AbstractCegarLoop]: Abstraction has 1815 states and 2681 transitions. [2021-01-07 01:41:42,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-07 01:41:42,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2681 transitions. [2021-01-07 01:41:42,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-07 01:41:42,855 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:41:42,856 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:41:42,856 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 01:41:42,856 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:41:42,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:41:42,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1985140444, now seen corresponding path program 1 times [2021-01-07 01:41:42,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:41:42,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314338970] [2021-01-07 01:41:42,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:41:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:41:43,099 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:41:43,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314338970] [2021-01-07 01:41:43,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:41:43,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:41:43,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438614512] [2021-01-07 01:41:43,103 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:41:43,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:41:43,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:41:43,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:41:43,105 INFO L87 Difference]: Start difference. First operand 1815 states and 2681 transitions. Second operand 3 states. [2021-01-07 01:41:43,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:41:43,301 INFO L93 Difference]: Finished difference Result 4434 states and 6546 transitions. [2021-01-07 01:41:43,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:41:43,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2021-01-07 01:41:43,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:41:43,317 INFO L225 Difference]: With dead ends: 4434 [2021-01-07 01:41:43,317 INFO L226 Difference]: Without dead ends: 2671 [2021-01-07 01:41:43,321 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:41:43,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2671 states. [2021-01-07 01:41:43,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2671 to 2671. [2021-01-07 01:41:43,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2671 states. [2021-01-07 01:41:43,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2671 states to 2671 states and 3925 transitions. [2021-01-07 01:41:43,402 INFO L78 Accepts]: Start accepts. Automaton has 2671 states and 3925 transitions. Word has length 65 [2021-01-07 01:41:43,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:41:43,403 INFO L481 AbstractCegarLoop]: Abstraction has 2671 states and 3925 transitions. [2021-01-07 01:41:43,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:41:43,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2671 states and 3925 transitions. [2021-01-07 01:41:43,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-01-07 01:41:43,409 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:41:43,409 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:41:43,409 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 01:41:43,410 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:41:43,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:41:43,411 INFO L82 PathProgramCache]: Analyzing trace with hash -769802664, now seen corresponding path program 1 times [2021-01-07 01:41:43,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:41:43,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248334503] [2021-01-07 01:41:43,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:41:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:41:43,748 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:41:43,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248334503] [2021-01-07 01:41:43,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:41:43,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 01:41:43,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554193765] [2021-01-07 01:41:43,750 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:41:43,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:41:43,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:41:43,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:41:43,756 INFO L87 Difference]: Start difference. First operand 2671 states and 3925 transitions. Second operand 3 states. [2021-01-07 01:41:43,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:41:43,974 INFO L93 Difference]: Finished difference Result 5290 states and 7789 transitions. [2021-01-07 01:41:43,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:41:43,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2021-01-07 01:41:43,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:41:43,991 INFO L225 Difference]: With dead ends: 5290 [2021-01-07 01:41:43,992 INFO L226 Difference]: Without dead ends: 2671 [2021-01-07 01:41:43,997 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:41:44,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2671 states. [2021-01-07 01:41:44,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2671 to 2671. [2021-01-07 01:41:44,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2671 states. [2021-01-07 01:41:44,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2671 states to 2671 states and 3923 transitions. [2021-01-07 01:41:44,104 INFO L78 Accepts]: Start accepts. Automaton has 2671 states and 3923 transitions. Word has length 93 [2021-01-07 01:41:44,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:41:44,107 INFO L481 AbstractCegarLoop]: Abstraction has 2671 states and 3923 transitions. [2021-01-07 01:41:44,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:41:44,107 INFO L276 IsEmpty]: Start isEmpty. Operand 2671 states and 3923 transitions. [2021-01-07 01:41:44,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-01-07 01:41:44,113 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:41:44,113 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:41:44,113 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 01:41:44,113 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:41:44,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:41:44,115 INFO L82 PathProgramCache]: Analyzing trace with hash -110271142, now seen corresponding path program 1 times [2021-01-07 01:41:44,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:41:44,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611395403] [2021-01-07 01:41:44,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:41:44,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:41:44,342 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:41:44,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611395403] [2021-01-07 01:41:44,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:41:44,344 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 01:41:44,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310744043] [2021-01-07 01:41:44,346 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:41:44,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:41:44,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:41:44,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:41:44,348 INFO L87 Difference]: Start difference. First operand 2671 states and 3923 transitions. Second operand 4 states. [2021-01-07 01:41:44,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:41:44,573 INFO L93 Difference]: Finished difference Result 5294 states and 7789 transitions. [2021-01-07 01:41:44,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 01:41:44,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2021-01-07 01:41:44,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:41:44,589 INFO L225 Difference]: With dead ends: 5294 [2021-01-07 01:41:44,590 INFO L226 Difference]: Without dead ends: 2671 [2021-01-07 01:41:44,595 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:41:44,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2671 states. [2021-01-07 01:41:44,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2671 to 2671. [2021-01-07 01:41:44,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2671 states. [2021-01-07 01:41:44,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2671 states to 2671 states and 3921 transitions. [2021-01-07 01:41:44,694 INFO L78 Accepts]: Start accepts. Automaton has 2671 states and 3921 transitions. Word has length 93 [2021-01-07 01:41:44,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:41:44,697 INFO L481 AbstractCegarLoop]: Abstraction has 2671 states and 3921 transitions. [2021-01-07 01:41:44,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:41:44,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2671 states and 3921 transitions. [2021-01-07 01:41:44,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-07 01:41:44,707 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:41:44,707 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:41:44,708 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-07 01:41:44,708 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:41:44,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:41:44,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1831449043, now seen corresponding path program 1 times [2021-01-07 01:41:44,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:41:44,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769369150] [2021-01-07 01:41:44,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:41:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:41:44,964 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:41:44,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769369150] [2021-01-07 01:41:44,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:41:44,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 01:41:44,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146195626] [2021-01-07 01:41:44,971 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:41:44,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:41:44,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:41:44,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:41:44,972 INFO L87 Difference]: Start difference. First operand 2671 states and 3921 transitions. Second operand 4 states. [2021-01-07 01:41:45,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:41:45,279 INFO L93 Difference]: Finished difference Result 5292 states and 7783 transitions. [2021-01-07 01:41:45,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 01:41:45,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2021-01-07 01:41:45,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:41:45,310 INFO L225 Difference]: With dead ends: 5292 [2021-01-07 01:41:45,310 INFO L226 Difference]: Without dead ends: 5290 [2021-01-07 01:41:45,313 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:41:45,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5290 states. [2021-01-07 01:41:45,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5290 to 2673. [2021-01-07 01:41:45,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2673 states. [2021-01-07 01:41:45,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 3923 transitions. [2021-01-07 01:41:45,501 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 3923 transitions. Word has length 96 [2021-01-07 01:41:45,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:41:45,502 INFO L481 AbstractCegarLoop]: Abstraction has 2673 states and 3923 transitions. [2021-01-07 01:41:45,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:41:45,503 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 3923 transitions. [2021-01-07 01:41:45,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-01-07 01:41:45,509 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:41:45,509 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, 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:41:45,509 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-07 01:41:45,509 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:41:45,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:41:45,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1107657714, now seen corresponding path program 1 times [2021-01-07 01:41:45,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:41:45,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568065876] [2021-01-07 01:41:45,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:41:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:41:45,858 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:41:45,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568065876] [2021-01-07 01:41:45,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:41:45,859 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:41:45,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520027884] [2021-01-07 01:41:45,859 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:41:45,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:41:45,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:41:45,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:41:45,860 INFO L87 Difference]: Start difference. First operand 2673 states and 3923 transitions. Second operand 4 states. [2021-01-07 01:41:46,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:41:46,270 INFO L93 Difference]: Finished difference Result 7915 states and 11647 transitions. [2021-01-07 01:41:46,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 01:41:46,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2021-01-07 01:41:46,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:41:46,298 INFO L225 Difference]: With dead ends: 7915 [2021-01-07 01:41:46,298 INFO L226 Difference]: Without dead ends: 5294 [2021-01-07 01:41:46,304 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:41:46,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5294 states. [2021-01-07 01:41:46,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5294 to 2674. [2021-01-07 01:41:46,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2021-01-07 01:41:46,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 3924 transitions. [2021-01-07 01:41:46,469 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 3924 transitions. Word has length 103 [2021-01-07 01:41:46,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:41:46,470 INFO L481 AbstractCegarLoop]: Abstraction has 2674 states and 3924 transitions. [2021-01-07 01:41:46,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:41:46,470 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 3924 transitions. [2021-01-07 01:41:46,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-07 01:41:46,476 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:41:46,476 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, 1, 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:41:46,476 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-07 01:41:46,476 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:41:46,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:41:46,479 INFO L82 PathProgramCache]: Analyzing trace with hash 777867501, now seen corresponding path program 1 times [2021-01-07 01:41:46,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:41:46,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092507164] [2021-01-07 01:41:46,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:41:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:41:46,649 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:41:46,650 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092507164] [2021-01-07 01:41:46,650 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:41:46,650 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:41:46,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728032077] [2021-01-07 01:41:46,651 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:41:46,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:41:46,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:41:46,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:41:46,652 INFO L87 Difference]: Start difference. First operand 2674 states and 3924 transitions. Second operand 3 states. [2021-01-07 01:41:46,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:41:46,816 INFO L93 Difference]: Finished difference Result 5297 states and 7789 transitions. [2021-01-07 01:41:46,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:41:46,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2021-01-07 01:41:46,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:41:46,831 INFO L225 Difference]: With dead ends: 5297 [2021-01-07 01:41:46,831 INFO L226 Difference]: Without dead ends: 2675 [2021-01-07 01:41:46,836 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:41:46,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2675 states. [2021-01-07 01:41:46,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2675 to 2675. [2021-01-07 01:41:46,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2675 states. [2021-01-07 01:41:47,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2675 states to 2675 states and 3925 transitions. [2021-01-07 01:41:47,001 INFO L78 Accepts]: Start accepts. Automaton has 2675 states and 3925 transitions. Word has length 105 [2021-01-07 01:41:47,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:41:47,002 INFO L481 AbstractCegarLoop]: Abstraction has 2675 states and 3925 transitions. [2021-01-07 01:41:47,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:41:47,002 INFO L276 IsEmpty]: Start isEmpty. Operand 2675 states and 3925 transitions. [2021-01-07 01:41:47,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-07 01:41:47,009 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:41:47,009 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, 1, 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:41:47,010 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-07 01:41:47,010 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:41:47,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:41:47,011 INFO L82 PathProgramCache]: Analyzing trace with hash 720609199, now seen corresponding path program 1 times [2021-01-07 01:41:47,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:41:47,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814173325] [2021-01-07 01:41:47,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:41:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:41:47,226 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:41:47,226 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814173325] [2021-01-07 01:41:47,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:41:47,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 01:41:47,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415816510] [2021-01-07 01:41:47,228 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 01:41:47,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:41:47,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 01:41:47,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:41:47,229 INFO L87 Difference]: Start difference. First operand 2675 states and 3925 transitions. Second operand 5 states. [2021-01-07 01:41:48,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:41:48,064 INFO L93 Difference]: Finished difference Result 10203 states and 15020 transitions. [2021-01-07 01:41:48,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 01:41:48,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2021-01-07 01:41:48,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:41:48,118 INFO L225 Difference]: With dead ends: 10203 [2021-01-07 01:41:48,118 INFO L226 Difference]: Without dead ends: 10201 [2021-01-07 01:41:48,123 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-07 01:41:48,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10201 states. [2021-01-07 01:41:48,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10201 to 2676. [2021-01-07 01:41:48,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2676 states. [2021-01-07 01:41:48,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2676 states to 2676 states and 3926 transitions. [2021-01-07 01:41:48,439 INFO L78 Accepts]: Start accepts. Automaton has 2676 states and 3926 transitions. Word has length 105 [2021-01-07 01:41:48,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:41:48,440 INFO L481 AbstractCegarLoop]: Abstraction has 2676 states and 3926 transitions. [2021-01-07 01:41:48,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 01:41:48,440 INFO L276 IsEmpty]: Start isEmpty. Operand 2676 states and 3926 transitions. [2021-01-07 01:41:48,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-01-07 01:41:48,450 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:41:48,450 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:48,450 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-07 01:41:48,450 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:41:48,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:41:48,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1688227031, now seen corresponding path program 1 times [2021-01-07 01:41:48,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:41:48,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804549711] [2021-01-07 01:41:48,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:41:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:41:48,643 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:41:48,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804549711] [2021-01-07 01:41:48,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:41:48,644 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:41:48,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792626593] [2021-01-07 01:41:48,645 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:41:48,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:41:48,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:41:48,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:41:48,646 INFO L87 Difference]: Start difference. First operand 2676 states and 3926 transitions. Second operand 3 states. [2021-01-07 01:41:49,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:41:49,183 INFO L93 Difference]: Finished difference Result 6149 states and 9024 transitions. [2021-01-07 01:41:49,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:41:49,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2021-01-07 01:41:49,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:41:49,195 INFO L225 Difference]: With dead ends: 6149 [2021-01-07 01:41:49,195 INFO L226 Difference]: Without dead ends: 3525 [2021-01-07 01:41:49,201 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:41:49,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3525 states. [2021-01-07 01:41:49,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3525 to 2676. [2021-01-07 01:41:49,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2676 states. [2021-01-07 01:41:49,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2676 states to 2676 states and 3925 transitions. [2021-01-07 01:41:49,449 INFO L78 Accepts]: Start accepts. Automaton has 2676 states and 3925 transitions. Word has length 119 [2021-01-07 01:41:49,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:41:49,450 INFO L481 AbstractCegarLoop]: Abstraction has 2676 states and 3925 transitions. [2021-01-07 01:41:49,450 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:41:49,450 INFO L276 IsEmpty]: Start isEmpty. Operand 2676 states and 3925 transitions. [2021-01-07 01:41:49,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-01-07 01:41:49,457 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:41:49,458 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:49,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-07 01:41:49,458 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:41:49,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:41:49,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1936681841, now seen corresponding path program 1 times [2021-01-07 01:41:49,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:41:49,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986536755] [2021-01-07 01:41:49,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:41:49,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:41:49,708 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:41:49,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986536755] [2021-01-07 01:41:49,711 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:41:49,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:41:49,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758621649] [2021-01-07 01:41:49,712 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:41:49,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:41:49,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:41:49,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:41:49,713 INFO L87 Difference]: Start difference. First operand 2676 states and 3925 transitions. Second operand 4 states. [2021-01-07 01:41:50,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:41:50,373 INFO L93 Difference]: Finished difference Result 7923 states and 11652 transitions. [2021-01-07 01:41:50,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 01:41:50,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2021-01-07 01:41:50,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:41:50,386 INFO L225 Difference]: With dead ends: 7923 [2021-01-07 01:41:50,386 INFO L226 Difference]: Without dead ends: 5299 [2021-01-07 01:41:50,393 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:41:50,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5299 states. [2021-01-07 01:41:50,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5299 to 2680. [2021-01-07 01:41:50,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2680 states. [2021-01-07 01:41:50,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2680 states to 2680 states and 3930 transitions. [2021-01-07 01:41:50,747 INFO L78 Accepts]: Start accepts. Automaton has 2680 states and 3930 transitions. Word has length 121 [2021-01-07 01:41:50,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:41:50,747 INFO L481 AbstractCegarLoop]: Abstraction has 2680 states and 3930 transitions. [2021-01-07 01:41:50,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:41:50,747 INFO L276 IsEmpty]: Start isEmpty. Operand 2680 states and 3930 transitions. [2021-01-07 01:41:50,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-01-07 01:41:50,754 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:41:50,755 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:50,755 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-07 01:41:50,755 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:41:50,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:41:50,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1013252547, now seen corresponding path program 1 times [2021-01-07 01:41:50,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:41:50,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153769193] [2021-01-07 01:41:50,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:41:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:41:50,938 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-07 01:41:50,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153769193] [2021-01-07 01:41:50,938 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:41:50,938 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:41:50,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239959645] [2021-01-07 01:41:50,939 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:41:50,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:41:50,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:41:50,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:41:50,941 INFO L87 Difference]: Start difference. First operand 2680 states and 3930 transitions. Second operand 3 states. [2021-01-07 01:41:51,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:41:51,478 INFO L93 Difference]: Finished difference Result 5335 states and 7826 transitions. [2021-01-07 01:41:51,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:41:51,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2021-01-07 01:41:51,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:41:51,486 INFO L225 Difference]: With dead ends: 5335 [2021-01-07 01:41:51,486 INFO L226 Difference]: Without dead ends: 2707 [2021-01-07 01:41:51,491 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:41:51,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2707 states. [2021-01-07 01:41:51,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2707 to 2680. [2021-01-07 01:41:51,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2680 states. [2021-01-07 01:41:51,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2680 states to 2680 states and 3849 transitions. [2021-01-07 01:41:51,748 INFO L78 Accepts]: Start accepts. Automaton has 2680 states and 3849 transitions. Word has length 124 [2021-01-07 01:41:51,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:41:51,748 INFO L481 AbstractCegarLoop]: Abstraction has 2680 states and 3849 transitions. [2021-01-07 01:41:51,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:41:51,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2680 states and 3849 transitions. [2021-01-07 01:41:51,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-07 01:41:51,756 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:41:51,757 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:51,757 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-07 01:41:51,757 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:41:51,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:41:51,758 INFO L82 PathProgramCache]: Analyzing trace with hash -904395513, now seen corresponding path program 1 times [2021-01-07 01:41:51,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:41:51,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208704216] [2021-01-07 01:41:51,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:41:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:41:52,000 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-07 01:41:52,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208704216] [2021-01-07 01:41:52,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211273440] [2021-01-07 01:41:52,001 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:41:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:41:52,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 1514 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-07 01:41:52,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:41:53,045 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-07 01:41:53,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:41:53,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-01-07 01:41:53,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052644461] [2021-01-07 01:41:53,047 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 01:41:53,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:41:53,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 01:41:53,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2021-01-07 01:41:53,048 INFO L87 Difference]: Start difference. First operand 2680 states and 3849 transitions. Second operand 7 states. [2021-01-07 01:41:54,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:41:54,507 INFO L93 Difference]: Finished difference Result 10550 states and 15194 transitions. [2021-01-07 01:41:54,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 01:41:54,508 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 127 [2021-01-07 01:41:54,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:41:54,531 INFO L225 Difference]: With dead ends: 10550 [2021-01-07 01:41:54,531 INFO L226 Difference]: Without dead ends: 7922 [2021-01-07 01:41:54,539 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2021-01-07 01:41:54,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7922 states. [2021-01-07 01:41:54,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7922 to 2683. [2021-01-07 01:41:54,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2683 states. [2021-01-07 01:41:54,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2683 states to 2683 states and 3853 transitions. [2021-01-07 01:41:54,923 INFO L78 Accepts]: Start accepts. Automaton has 2683 states and 3853 transitions. Word has length 127 [2021-01-07 01:41:54,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:41:54,924 INFO L481 AbstractCegarLoop]: Abstraction has 2683 states and 3853 transitions. [2021-01-07 01:41:54,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 01:41:54,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2683 states and 3853 transitions. [2021-01-07 01:41:54,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-01-07 01:41:54,932 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:41:54,933 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:41:55,147 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-01-07 01:41:55,148 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:41:55,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:41:55,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1953231925, now seen corresponding path program 2 times [2021-01-07 01:41:55,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:41:55,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142677303] [2021-01-07 01:41:55,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:41:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:41:55,504 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-07 01:41:55,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142677303] [2021-01-07 01:41:55,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357700247] [2021-01-07 01:41:55,505 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:41:56,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-01-07 01:41:56,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 01:41:56,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 1282 conjuncts, 19 conjunts are in the unsatisfiable core [2021-01-07 01:41:56,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:41:57,092 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-07 01:41:57,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 01:41:57,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2021-01-07 01:41:57,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982086709] [2021-01-07 01:41:57,093 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:41:57,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:41:57,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:41:57,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-07 01:41:57,095 INFO L87 Difference]: Start difference. First operand 2683 states and 3853 transitions. Second operand 3 states. [2021-01-07 01:41:57,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:41:57,424 INFO L93 Difference]: Finished difference Result 5341 states and 7685 transitions. [2021-01-07 01:41:57,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:41:57,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2021-01-07 01:41:57,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:41:57,432 INFO L225 Difference]: With dead ends: 5341 [2021-01-07 01:41:57,432 INFO L226 Difference]: Without dead ends: 2690 [2021-01-07 01:41:57,438 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-07 01:41:57,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2690 states. [2021-01-07 01:41:57,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 2690. [2021-01-07 01:41:57,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2690 states. [2021-01-07 01:41:57,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2690 states to 2690 states and 3860 transitions. [2021-01-07 01:41:57,699 INFO L78 Accepts]: Start accepts. Automaton has 2690 states and 3860 transitions. Word has length 130 [2021-01-07 01:41:57,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:41:57,699 INFO L481 AbstractCegarLoop]: Abstraction has 2690 states and 3860 transitions. [2021-01-07 01:41:57,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:41:57,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2690 states and 3860 transitions. [2021-01-07 01:41:57,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-01-07 01:41:57,709 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:41:57,709 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:57,923 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-01-07 01:41:57,924 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:41:57,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:41:57,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1008714198, now seen corresponding path program 1 times [2021-01-07 01:41:57,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:41:57,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517141455] [2021-01-07 01:41:57,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:41:58,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:41:58,262 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-07 01:41:58,263 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517141455] [2021-01-07 01:41:58,263 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799526503] [2021-01-07 01:41:58,263 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 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:41:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:41:59,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 1564 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 01:41:59,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:41:59,243 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-07 01:41:59,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:41:59,244 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-01-07 01:41:59,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945544498] [2021-01-07 01:41:59,247 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 01:41:59,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:41:59,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 01:41:59,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2021-01-07 01:41:59,248 INFO L87 Difference]: Start difference. First operand 2690 states and 3860 transitions. Second operand 9 states. [2021-01-07 01:42:00,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:00,743 INFO L93 Difference]: Finished difference Result 13183 states and 18985 transitions. [2021-01-07 01:42:00,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 01:42:00,744 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2021-01-07 01:42:00,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:00,774 INFO L225 Difference]: With dead ends: 13183 [2021-01-07 01:42:00,774 INFO L226 Difference]: Without dead ends: 10552 [2021-01-07 01:42:00,783 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2021-01-07 01:42:00,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10552 states. [2021-01-07 01:42:01,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10552 to 2693. [2021-01-07 01:42:01,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2693 states. [2021-01-07 01:42:01,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2693 states to 2693 states and 3864 transitions. [2021-01-07 01:42:01,106 INFO L78 Accepts]: Start accepts. Automaton has 2693 states and 3864 transitions. Word has length 137 [2021-01-07 01:42:01,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:01,107 INFO L481 AbstractCegarLoop]: Abstraction has 2693 states and 3864 transitions. [2021-01-07 01:42:01,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 01:42:01,107 INFO L276 IsEmpty]: Start isEmpty. Operand 2693 states and 3864 transitions. [2021-01-07 01:42:01,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-01-07 01:42:01,114 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:01,114 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:01,329 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-01-07 01:42:01,330 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:01,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:01,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1349774551, now seen corresponding path program 1 times [2021-01-07 01:42:01,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:01,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37173545] [2021-01-07 01:42:01,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:01,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:01,695 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-07 01:42:01,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37173545] [2021-01-07 01:42:01,696 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:01,696 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 01:42:01,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318818323] [2021-01-07 01:42:01,697 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 01:42:01,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:01,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 01:42:01,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-07 01:42:01,698 INFO L87 Difference]: Start difference. First operand 2693 states and 3864 transitions. Second operand 7 states. [2021-01-07 01:42:03,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:03,644 INFO L93 Difference]: Finished difference Result 14965 states and 21484 transitions. [2021-01-07 01:42:03,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-07 01:42:03,645 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 139 [2021-01-07 01:42:03,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:03,675 INFO L225 Difference]: With dead ends: 14965 [2021-01-07 01:42:03,675 INFO L226 Difference]: Without dead ends: 12317 [2021-01-07 01:42:03,686 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-01-07 01:42:03,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12317 states. [2021-01-07 01:42:04,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12317 to 2693. [2021-01-07 01:42:04,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2693 states. [2021-01-07 01:42:04,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2693 states to 2693 states and 3862 transitions. [2021-01-07 01:42:04,077 INFO L78 Accepts]: Start accepts. Automaton has 2693 states and 3862 transitions. Word has length 139 [2021-01-07 01:42:04,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:04,078 INFO L481 AbstractCegarLoop]: Abstraction has 2693 states and 3862 transitions. [2021-01-07 01:42:04,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 01:42:04,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2693 states and 3862 transitions. [2021-01-07 01:42:04,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-01-07 01:42:04,083 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:04,084 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:04,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-07 01:42:04,084 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:04,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:04,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1329965773, now seen corresponding path program 1 times [2021-01-07 01:42:04,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:04,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206741328] [2021-01-07 01:42:04,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:04,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:04,380 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-07 01:42:04,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206741328] [2021-01-07 01:42:04,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:04,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 01:42:04,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685012639] [2021-01-07 01:42:04,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:42:04,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:04,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:42:04,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:42:04,383 INFO L87 Difference]: Start difference. First operand 2693 states and 3862 transitions. Second operand 4 states. [2021-01-07 01:42:05,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:05,265 INFO L93 Difference]: Finished difference Result 10238 states and 14739 transitions. [2021-01-07 01:42:05,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 01:42:05,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2021-01-07 01:42:05,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:05,279 INFO L225 Difference]: With dead ends: 10238 [2021-01-07 01:42:05,279 INFO L226 Difference]: Without dead ends: 7604 [2021-01-07 01:42:05,287 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 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:42:05,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7604 states. [2021-01-07 01:42:05,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7604 to 2695. [2021-01-07 01:42:05,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2695 states. [2021-01-07 01:42:05,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2695 states to 2695 states and 3864 transitions. [2021-01-07 01:42:05,667 INFO L78 Accepts]: Start accepts. Automaton has 2695 states and 3864 transitions. Word has length 141 [2021-01-07 01:42:05,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:05,667 INFO L481 AbstractCegarLoop]: Abstraction has 2695 states and 3864 transitions. [2021-01-07 01:42:05,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:42:05,668 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 3864 transitions. [2021-01-07 01:42:05,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-01-07 01:42:05,673 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:05,673 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:05,674 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-07 01:42:05,674 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:05,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:05,674 INFO L82 PathProgramCache]: Analyzing trace with hash 169983332, now seen corresponding path program 1 times [2021-01-07 01:42:05,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:05,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504132884] [2021-01-07 01:42:05,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:05,819 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-07 01:42:05,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504132884] [2021-01-07 01:42:05,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:05,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:42:05,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284891315] [2021-01-07 01:42:05,820 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:42:05,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:05,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:42:05,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:42:05,821 INFO L87 Difference]: Start difference. First operand 2695 states and 3864 transitions. Second operand 3 states. [2021-01-07 01:42:06,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:06,460 INFO L93 Difference]: Finished difference Result 7800 states and 11222 transitions. [2021-01-07 01:42:06,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:42:06,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2021-01-07 01:42:06,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:06,466 INFO L225 Difference]: With dead ends: 7800 [2021-01-07 01:42:06,467 INFO L226 Difference]: Without dead ends: 5164 [2021-01-07 01:42:06,471 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:42:06,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5164 states. [2021-01-07 01:42:06,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5164 to 2698. [2021-01-07 01:42:06,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2698 states. [2021-01-07 01:42:06,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2698 states to 2698 states and 3868 transitions. [2021-01-07 01:42:06,964 INFO L78 Accepts]: Start accepts. Automaton has 2698 states and 3868 transitions. Word has length 143 [2021-01-07 01:42:06,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:06,965 INFO L481 AbstractCegarLoop]: Abstraction has 2698 states and 3868 transitions. [2021-01-07 01:42:06,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:42:06,965 INFO L276 IsEmpty]: Start isEmpty. Operand 2698 states and 3868 transitions. [2021-01-07 01:42:06,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-01-07 01:42:06,971 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:06,971 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:06,971 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-07 01:42:06,972 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:06,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:06,972 INFO L82 PathProgramCache]: Analyzing trace with hash 110510635, now seen corresponding path program 1 times [2021-01-07 01:42:06,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:06,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027173779] [2021-01-07 01:42:06,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:07,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:07,237 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-07 01:42:07,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027173779] [2021-01-07 01:42:07,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:07,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 01:42:07,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140908153] [2021-01-07 01:42:07,239 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 01:42:07,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:07,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 01:42:07,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:42:07,240 INFO L87 Difference]: Start difference. First operand 2698 states and 3868 transitions. Second operand 5 states. [2021-01-07 01:42:09,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:09,363 INFO L93 Difference]: Finished difference Result 17958 states and 25893 transitions. [2021-01-07 01:42:09,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 01:42:09,364 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2021-01-07 01:42:09,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:09,388 INFO L225 Difference]: With dead ends: 17958 [2021-01-07 01:42:09,388 INFO L226 Difference]: Without dead ends: 15319 [2021-01-07 01:42:09,397 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-07 01:42:09,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15319 states. [2021-01-07 01:42:09,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15319 to 2701. [2021-01-07 01:42:09,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2701 states. [2021-01-07 01:42:09,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2701 states and 3871 transitions. [2021-01-07 01:42:09,950 INFO L78 Accepts]: Start accepts. Automaton has 2701 states and 3871 transitions. Word has length 147 [2021-01-07 01:42:09,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:09,951 INFO L481 AbstractCegarLoop]: Abstraction has 2701 states and 3871 transitions. [2021-01-07 01:42:09,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 01:42:09,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2701 states and 3871 transitions. [2021-01-07 01:42:09,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-01-07 01:42:09,956 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:09,956 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:09,957 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-07 01:42:09,957 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:09,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:09,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1933754033, now seen corresponding path program 1 times [2021-01-07 01:42:09,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:09,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910790887] [2021-01-07 01:42:09,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:10,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:10,871 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-07 01:42:10,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910790887] [2021-01-07 01:42:10,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140151483] [2021-01-07 01:42:10,872 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:42:11,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:11,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 1764 conjuncts, 9 conjunts are in the unsatisfiable core [2021-01-07 01:42:11,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:42:11,775 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-07 01:42:11,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 01:42:11,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2021-01-07 01:42:11,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081475725] [2021-01-07 01:42:11,776 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 01:42:11,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:11,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 01:42:11,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-07 01:42:11,777 INFO L87 Difference]: Start difference. First operand 2701 states and 3871 transitions. Second operand 5 states. [2021-01-07 01:42:12,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:12,731 INFO L93 Difference]: Finished difference Result 7982 states and 11472 transitions. [2021-01-07 01:42:12,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 01:42:12,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 149 [2021-01-07 01:42:12,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:12,738 INFO L225 Difference]: With dead ends: 7982 [2021-01-07 01:42:12,738 INFO L226 Difference]: Without dead ends: 5330 [2021-01-07 01:42:12,742 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-01-07 01:42:12,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5330 states. [2021-01-07 01:42:13,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5330 to 2701. [2021-01-07 01:42:13,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2701 states. [2021-01-07 01:42:13,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2701 states and 3869 transitions. [2021-01-07 01:42:13,440 INFO L78 Accepts]: Start accepts. Automaton has 2701 states and 3869 transitions. Word has length 149 [2021-01-07 01:42:13,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:13,441 INFO L481 AbstractCegarLoop]: Abstraction has 2701 states and 3869 transitions. [2021-01-07 01:42:13,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 01:42:13,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2701 states and 3869 transitions. [2021-01-07 01:42:13,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-01-07 01:42:13,449 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:13,449 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:13,662 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:42:13,662 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:13,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:13,664 INFO L82 PathProgramCache]: Analyzing trace with hash 667402642, now seen corresponding path program 1 times [2021-01-07 01:42:13,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:13,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996040717] [2021-01-07 01:42:13,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:14,107 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-07 01:42:14,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996040717] [2021-01-07 01:42:14,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224881222] [2021-01-07 01:42:14,108 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 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:42:16,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:16,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 1756 conjuncts, 15 conjunts are in the unsatisfiable core [2021-01-07 01:42:16,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:42:16,380 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-07 01:42:16,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:42:16,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-01-07 01:42:16,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825425095] [2021-01-07 01:42:16,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 01:42:16,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:16,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 01:42:16,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-07 01:42:16,382 INFO L87 Difference]: Start difference. First operand 2701 states and 3869 transitions. Second operand 6 states. [2021-01-07 01:42:16,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:16,900 INFO L93 Difference]: Finished difference Result 5376 states and 7716 transitions. [2021-01-07 01:42:16,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 01:42:16,901 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2021-01-07 01:42:16,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:16,903 INFO L225 Difference]: With dead ends: 5376 [2021-01-07 01:42:16,904 INFO L226 Difference]: Without dead ends: 2708 [2021-01-07 01:42:16,907 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-01-07 01:42:16,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2708 states. [2021-01-07 01:42:17,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2708 to 2708. [2021-01-07 01:42:17,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2708 states. [2021-01-07 01:42:17,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2708 states to 2708 states and 3876 transitions. [2021-01-07 01:42:17,428 INFO L78 Accepts]: Start accepts. Automaton has 2708 states and 3876 transitions. Word has length 149 [2021-01-07 01:42:17,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:17,429 INFO L481 AbstractCegarLoop]: Abstraction has 2708 states and 3876 transitions. [2021-01-07 01:42:17,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 01:42:17,429 INFO L276 IsEmpty]: Start isEmpty. Operand 2708 states and 3876 transitions. [2021-01-07 01:42:17,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-01-07 01:42:17,435 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:17,436 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:17,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:42:17,650 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:17,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:17,651 INFO L82 PathProgramCache]: Analyzing trace with hash 2141562749, now seen corresponding path program 2 times [2021-01-07 01:42:17,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:17,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632815645] [2021-01-07 01:42:17,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:18,117 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-01-07 01:42:18,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632815645] [2021-01-07 01:42:18,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637063715] [2021-01-07 01:42:18,117 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 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:42:28,676 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 01:42:28,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 01:42:28,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 1798 conjuncts, 159 conjunts are in the unsatisfiable core [2021-01-07 01:42:28,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:42:28,811 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 01:42:28,812 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 01:42:28,815 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:28,816 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 01:42:28,816 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-01-07 01:42:28,931 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:28,932 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2021-01-07 01:42:28,935 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:28,942 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 01:42:28,950 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:28,951 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 01:42:28,951 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2021-01-07 01:42:29,104 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:29,104 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 50 [2021-01-07 01:42:29,108 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 01:42:29,147 INFO L625 ElimStorePlain]: treesize reduction 28, result has 45.1 percent of original size [2021-01-07 01:42:29,150 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 01:42:29,150 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:23 [2021-01-07 01:42:29,372 INFO L348 Elim1Store]: treesize reduction 40, result has 55.6 percent of original size [2021-01-07 01:42:29,372 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 61 [2021-01-07 01:42:29,383 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 01:42:29,444 INFO L625 ElimStorePlain]: treesize reduction 34, result has 50.0 percent of original size [2021-01-07 01:42:29,448 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 01:42:29,448 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:34 [2021-01-07 01:42:29,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:29,709 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:29,709 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 45 [2021-01-07 01:42:29,714 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:29,715 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:29,718 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 01:42:29,733 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:29,735 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 01:42:29,735 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:22 [2021-01-07 01:42:29,908 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 01:42:29,909 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 01:42:29,925 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:29,926 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 01:42:29,926 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2021-01-07 01:42:30,055 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_771|, |v_#memory_$Pointer$.base_771|], 4=[|v_#memory_int_732|]} [2021-01-07 01:42:30,064 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 01:42:30,064 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 01:42:30,107 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:30,116 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 01:42:30,117 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 01:42:30,154 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:30,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:30,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:30,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:30,167 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2021-01-07 01:42:30,169 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 01:42:30,201 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:30,202 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 01:42:30,203 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:87, output treesize:64 [2021-01-07 01:42:30,298 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_774|, |v_#memory_$Pointer$.offset_774|], 6=[|v_#memory_int_733|]} [2021-01-07 01:42:30,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:30,310 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-01-07 01:42:30,311 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 01:42:30,359 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:30,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:30,368 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-01-07 01:42:30,370 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 01:42:30,409 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:30,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:30,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:30,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:30,423 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-01-07 01:42:30,426 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 01:42:30,461 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:30,462 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 01:42:30,463 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:115, output treesize:73 [2021-01-07 01:42:30,584 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_775|, |v_#memory_$Pointer$.base_775|, |v_#memory_$Pointer$.base_772|, |v_#memory_$Pointer$.offset_772|], 18=[|v_#memory_int_734|]} [2021-01-07 01:42:30,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:30,606 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-01-07 01:42:30,608 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 01:42:30,720 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-01-07 01:42:30,720 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:30,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:30,736 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-01-07 01:42:30,737 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 01:42:30,888 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-01-07 01:42:30,888 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:30,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:30,901 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-01-07 01:42:30,903 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 01:42:30,969 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:30,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:30,977 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-01-07 01:42:30,978 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-07 01:42:31,039 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:31,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:31,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:31,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:31,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:31,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:31,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:31,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:31,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:31,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:31,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:31,063 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2021-01-07 01:42:31,065 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-01-07 01:42:31,115 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:31,116 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 01:42:31,117 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:163, output treesize:102 [2021-01-07 01:42:31,267 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:31,269 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:31,272 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:31,274 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,274 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,275 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,277 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,278 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,279 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,281 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,284 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,285 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,285 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,287 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,288 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,289 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,291 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,292 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 01:42:31,294 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,294 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,296 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,297 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 01:42:31,299 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,300 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 01:42:31,304 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,305 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 01:42:31,311 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,311 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,313 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,314 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 01:42:31,320 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,321 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 01:42:31,329 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,330 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 01:42:31,340 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:31,341 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,342 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,342 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,343 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,345 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,345 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,347 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,348 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 01:42:31,351 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:31,352 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,352 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,354 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,357 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 01:42:31,359 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:31,360 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,361 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 01:42:31,368 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:31,370 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,371 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 01:42:31,379 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:31,385 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,385 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,389 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,390 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 01:42:31,392 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:31,394 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,396 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 01:42:31,402 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:31,404 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,408 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 01:42:31,415 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:31,417 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,417 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,418 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,420 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,421 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,422 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,424 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,429 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 01:42:31,431 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,431 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,432 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,434 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 01:42:31,435 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,436 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 01:42:31,441 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,442 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 01:42:31,447 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,447 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,448 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,449 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 01:42:31,452 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,453 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 01:42:31,461 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,462 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 01:42:31,466 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:31,467 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,468 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,468 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,469 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,471 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,472 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,474 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,475 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 01:42:31,476 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:31,477 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,478 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,479 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,481 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 01:42:31,482 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,483 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 01:42:31,489 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,490 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 01:42:31,495 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:31,496 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,496 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,497 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,498 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 01:42:31,500 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,501 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 01:42:31,505 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,507 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 01:42:31,511 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 18 disjuncts [2021-01-07 01:42:31,521 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:31,522 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:31,523 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,524 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,525 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,527 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,528 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,529 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,530 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 01:42:31,531 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,533 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 01:42:31,536 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,538 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 01:42:31,542 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:31,543 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,543 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,544 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,545 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 01:42:31,546 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:31,547 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,548 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 01:42:31,552 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:31,553 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,554 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 01:42:31,559 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,559 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,560 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,561 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 01:42:31,563 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,564 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 01:42:31,571 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,572 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 01:42:31,576 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:31,577 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,578 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,579 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,581 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 01:42:31,582 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,583 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 01:42:31,587 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,588 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 01:42:31,592 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 19 disjuncts [2021-01-07 01:42:31,597 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:31,598 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,600 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,601 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 01:42:31,605 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,606 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 01:42:31,613 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,614 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 01:42:31,618 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:31,619 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,620 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 01:42:31,624 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 19 disjuncts [2021-01-07 01:42:31,648 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:31,650 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,652 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,652 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 01:42:31,656 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,657 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 01:42:31,664 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,665 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 01:42:31,669 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:31,670 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,671 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 01:42:31,674 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 20 disjuncts [2021-01-07 01:42:31,702 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:31,703 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:31,704 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,705 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,706 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,708 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,708 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,709 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,710 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 01:42:31,711 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,713 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 01:42:31,715 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,716 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 01:42:31,720 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:31,721 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,721 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,722 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,723 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 01:42:31,725 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:31,726 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,727 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 01:42:31,733 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:31,734 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,735 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 01:42:31,739 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,740 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,741 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,742 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 01:42:31,743 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,744 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 01:42:31,748 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,749 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 01:42:31,753 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:31,754 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,754 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,755 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,756 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 01:42:31,758 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,759 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 01:42:31,763 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,764 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 01:42:31,767 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 19 disjuncts [2021-01-07 01:42:31,772 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:31,774 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,775 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,776 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 01:42:31,780 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,781 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 01:42:31,785 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,786 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 01:42:31,790 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:31,791 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,792 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 01:42:31,795 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 20 disjuncts [2021-01-07 01:42:31,820 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:31,822 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,824 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,825 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 01:42:31,828 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,830 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 01:42:31,833 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,834 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 01:42:31,838 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:31,839 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 01:42:31,840 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 01:42:31,843 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 19 disjuncts [2021-01-07 01:42:31,878 INFO L443 ElimStorePlain]: Different costs {4=[|v_#memory_int_729|], 6=[|v_#memory_$Pointer$.offset_776|, |v_#memory_$Pointer$.base_776|, |v_#memory_$Pointer$.base_773|, |v_#memory_$Pointer$.offset_773|], 28=[|v_#memory_int_735|]} [2021-01-07 01:42:31,888 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 01:42:31,894 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 01:42:31,901 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 01:42:31,911 INFO L547 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 01:42:31,922 INFO L547 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 01:42:31,930 INFO L547 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 01:42:31,937 INFO L547 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 01:42:31,945 INFO L547 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 01:42:35,175 WARN L197 SmtUtils]: Spent 3.23 s on a formula simplification. DAG size of input: 172 DAG size of output: 103 [2021-01-07 01:42:35,182 INFO L625 ElimStorePlain]: treesize reduction 2999, result has 11.2 percent of original size [2021-01-07 01:42:35,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:35,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:35,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:35,195 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 289 treesize of output 234 [2021-01-07 01:42:35,198 INFO L547 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-01-07 01:42:35,588 WARN L197 SmtUtils]: Spent 389.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2021-01-07 01:42:35,588 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:35,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:35,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:35,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:35,596 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 252 treesize of output 191 [2021-01-07 01:42:35,599 INFO L547 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-01-07 01:42:35,860 WARN L197 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-01-07 01:42:35,861 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:35,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:35,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:35,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:35,898 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 51 [2021-01-07 01:42:35,899 INFO L547 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-01-07 01:42:36,084 WARN L197 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-01-07 01:42:36,084 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:36,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:36,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:36,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:36,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:36,111 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 51 [2021-01-07 01:42:36,113 INFO L547 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-01-07 01:42:36,249 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-01-07 01:42:36,250 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:36,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:36,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:36,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:36,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:36,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:36,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:36,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:36,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:36,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:36,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:36,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:36,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:36,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:36,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:36,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:36,278 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 18 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 119 [2021-01-07 01:42:36,283 INFO L547 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-01-07 01:42:36,353 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:36,361 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 01:42:36,361 INFO L244 ElimStorePlain]: Needed 14 recursive calls to eliminate 8 variables, input treesize:3315, output treesize:152 [2021-01-07 01:42:36,707 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_int_730|], 28=[|v_#memory_$Pointer$.offset_777|, |v_#memory_$Pointer$.base_777|], 30=[|v_#memory_int_736|]} [2021-01-07 01:42:36,718 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 01:42:37,083 WARN L197 SmtUtils]: Spent 363.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2021-01-07 01:42:37,084 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:37,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,148 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 75 [2021-01-07 01:42:37,150 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 01:42:37,381 WARN L197 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2021-01-07 01:42:37,382 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:37,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,409 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 75 [2021-01-07 01:42:37,411 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 01:42:37,546 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2021-01-07 01:42:37,547 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:37,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,583 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 18 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 96 [2021-01-07 01:42:37,586 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-07 01:42:37,677 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:37,680 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 01:42:37,681 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:256, output treesize:168 [2021-01-07 01:42:37,877 INFO L443 ElimStorePlain]: Different costs {30=[|v_#memory_int_737|], 42=[|v_#memory_$Pointer$.offset_778|, |v_#memory_$Pointer$.base_778|]} [2021-01-07 01:42:37,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:37,915 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 70 [2021-01-07 01:42:37,917 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 01:42:38,078 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-01-07 01:42:38,078 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:38,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,112 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 71 [2021-01-07 01:42:38,115 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 01:42:38,248 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-01-07 01:42:38,248 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:38,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,271 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 71 [2021-01-07 01:42:38,274 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 01:42:38,367 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:38,371 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 01:42:38,371 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:219, output treesize:168 [2021-01-07 01:42:38,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,490 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 71 [2021-01-07 01:42:38,492 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 01:42:38,677 WARN L197 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2021-01-07 01:42:38,678 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:38,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,715 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 71 [2021-01-07 01:42:38,717 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 01:42:38,840 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2021-01-07 01:42:38,841 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:38,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:38,976 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2021-01-07 01:42:38,977 INFO L348 Elim1Store]: treesize reduction 34, result has 71.7 percent of original size [2021-01-07 01:42:38,978 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 155 [2021-01-07 01:42:38,983 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 01:42:39,196 WARN L197 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 95 [2021-01-07 01:42:39,197 INFO L625 ElimStorePlain]: treesize reduction 108, result has 62.9 percent of original size [2021-01-07 01:42:39,200 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-01-07 01:42:39,200 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:225, output treesize:183 [2021-01-07 01:42:41,460 WARN L197 SmtUtils]: Spent 1.16 s on a formula simplification that was a NOOP. DAG size: 98 [2021-01-07 01:42:41,506 INFO L443 ElimStorePlain]: Different costs {42=[|v_#memory_$Pointer$.offset_780|, |v_#memory_$Pointer$.base_780|], 72=[|v_#memory_int_739|]} [2021-01-07 01:42:41,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:41,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:41,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:41,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:41,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:41,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:41,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:41,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:41,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:41,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:41,593 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 71 [2021-01-07 01:42:41,595 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 01:42:41,879 WARN L197 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-01-07 01:42:41,879 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:41,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:41,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:41,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:41,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:41,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:41,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:41,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:41,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:41,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:41,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:41,918 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 71 [2021-01-07 01:42:41,921 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 01:42:42,087 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-01-07 01:42:42,087 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:42,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:42,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:42,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:42,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:42,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:42,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:42,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:42,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:42,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:42,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:42,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:42,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:42,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:42,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:42,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:42,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:42,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:42,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:42,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:42,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:42,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:42,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:42,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:42,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:42,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:42,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:42,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:42,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:42,233 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:42,234 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 30 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 8 case distinctions, treesize of input 86 treesize of output 254 [2021-01-07 01:42:42,246 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 01:42:42,533 WARN L197 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 114 [2021-01-07 01:42:42,534 INFO L625 ElimStorePlain]: treesize reduction 184, result has 53.8 percent of original size [2021-01-07 01:42:42,541 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 01:42:42,541 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:246, output treesize:189 [2021-01-07 01:42:44,003 INFO L443 ElimStorePlain]: Different costs {42=[|v_#memory_$Pointer$.offset_781|, |v_#memory_$Pointer$.base_781|], 72=[|v_#memory_int_740|]} [2021-01-07 01:42:44,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,068 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 71 [2021-01-07 01:42:44,070 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 01:42:44,353 WARN L197 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-01-07 01:42:44,354 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:44,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,401 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 71 [2021-01-07 01:42:44,403 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 01:42:44,579 WARN L197 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-01-07 01:42:44,580 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:44,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:44,645 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 38 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 108 [2021-01-07 01:42:44,649 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 01:42:44,748 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:44,751 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 01:42:44,752 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:248, output treesize:207 [2021-01-07 01:42:47,061 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-01-07 01:42:47,120 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:47,122 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:47,125 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 01:42:47,128 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:47,131 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 17 disjuncts [2021-01-07 01:42:47,139 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 01:42:47,140 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 19 disjuncts [2021-01-07 01:42:47,149 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:47,150 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 01:42:47,152 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 19 disjuncts [2021-01-07 01:42:47,160 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:47,161 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 01:42:47,162 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 20 disjuncts [2021-01-07 01:42:47,174 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 01:42:47,177 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 01:42:47,178 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 19 disjuncts [2021-01-07 01:42:47,186 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 20 disjuncts [2021-01-07 01:42:47,206 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 23 disjuncts [2021-01-07 01:42:47,295 INFO L443 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|], 40=[|v_#memory_$Pointer$.offset_782|, |v_#memory_$Pointer$.base_782|], 91=[|v_#memory_int_741|]} [2021-01-07 01:42:47,303 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 01:42:47,312 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 01:42:47,753 WARN L197 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 124 [2021-01-07 01:42:47,753 INFO L625 ElimStorePlain]: treesize reduction 537, result has 44.1 percent of original size [2021-01-07 01:42:47,761 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 01:42:47,891 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2021-01-07 01:42:47,891 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:47,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:47,936 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:47,937 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 6 case distinctions, treesize of input 367 treesize of output 297 [2021-01-07 01:42:47,947 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2021-01-07 01:42:47,949 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2021-01-07 01:42:47,951 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2021-01-07 01:42:47,954 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2021-01-07 01:42:47,956 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2021-01-07 01:42:47,963 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2021-01-07 01:42:47,969 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2021-01-07 01:42:47,972 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2021-01-07 01:42:47,978 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2021-01-07 01:42:47,984 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2021-01-07 01:42:47,986 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2021-01-07 01:42:47,988 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2021-01-07 01:42:47,994 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2021-01-07 01:42:48,001 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2021-01-07 01:42:48,003 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2021-01-07 01:42:48,009 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2021-01-07 01:42:48,015 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2021-01-07 01:42:48,018 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2021-01-07 01:42:48,020 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2021-01-07 01:42:48,022 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 01:42:48,028 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2021-01-07 01:42:48,033 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2021-01-07 01:42:48,036 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2021-01-07 01:42:48,041 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2021-01-07 01:42:48,047 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2021-01-07 01:42:48,050 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2021-01-07 01:42:48,052 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2021-01-07 01:42:48,058 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2021-01-07 01:42:48,065 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2021-01-07 01:42:48,067 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2021-01-07 01:42:48,073 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2021-01-07 01:42:48,085 INFO L547 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 01:42:48,177 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:48,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,235 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:48,236 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 243 treesize of output 188 [2021-01-07 01:42:48,245 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2021-01-07 01:42:48,247 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2021-01-07 01:42:48,249 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-07 01:42:48,255 INFO L547 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 01:42:48,316 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:48,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 01:42:48,372 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 38 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 44 [2021-01-07 01:42:48,377 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-01-07 01:42:48,388 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 01:42:48,391 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 01:42:48,392 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:959, output treesize:3 [2021-01-07 01:42:48,726 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-01-07 01:42:48,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 01:42:48,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [5] total 35 [2021-01-07 01:42:48,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339225206] [2021-01-07 01:42:48,727 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-01-07 01:42:48,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:48,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-01-07 01:42:48,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1091, Unknown=3, NotChecked=0, Total=1190 [2021-01-07 01:42:48,728 INFO L87 Difference]: Start difference. First operand 2708 states and 3876 transitions. Second operand 32 states. [2021-01-07 01:44:42,872 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2021-01-07 01:44:52,564 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-01-07 01:45:02,388 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-01-07 01:45:11,450 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-01-07 01:45:13,156 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-01-07 01:45:14,670 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-01-07 01:45:16,087 WARN L197 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-01-07 01:45:19,712 WARN L197 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2021-01-07 01:45:21,587 WARN L197 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2021-01-07 01:45:23,265 WARN L197 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 142