/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--rfc1201.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 15:03:05,918 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 15:03:05,921 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 15:03:05,959 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 15:03:05,960 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 15:03:05,962 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 15:03:05,964 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 15:03:05,967 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 15:03:05,983 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 15:03:05,985 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 15:03:05,986 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 15:03:05,988 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 15:03:05,988 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 15:03:05,990 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 15:03:05,991 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 15:03:05,993 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 15:03:05,994 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 15:03:05,996 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 15:03:05,998 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 15:03:06,001 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 15:03:06,003 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 15:03:06,005 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 15:03:06,006 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 15:03:06,008 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 15:03:06,011 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 15:03:06,012 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 15:03:06,012 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 15:03:06,014 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 15:03:06,014 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 15:03:06,016 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 15:03:06,016 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 15:03:06,018 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 15:03:06,019 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 15:03:06,020 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 15:03:06,021 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 15:03:06,022 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 15:03:06,023 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 15:03:06,023 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 15:03:06,024 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 15:03:06,025 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 15:03:06,026 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 15:03:06,030 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 15:03:06,059 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 15:03:06,059 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 15:03:06,061 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 15:03:06,062 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 15:03:06,062 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 15:03:06,062 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 15:03:06,063 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 15:03:06,063 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 15:03:06,063 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 15:03:06,064 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 15:03:06,064 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 15:03:06,064 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 15:03:06,064 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 15:03:06,065 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 15:03:06,065 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 15:03:06,065 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 15:03:06,065 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 15:03:06,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 15:03:06,066 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 15:03:06,066 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 15:03:06,066 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 15:03:06,067 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 15:03:06,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 15:03:06,067 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 15:03:06,068 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 15:03:06,068 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 15:03:06,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 15:03:06,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 15:03:06,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 15:03:06,549 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 15:03:06,550 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 15:03:06,551 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--rfc1201.ko-entry_point.cil.out.i [2020-12-23 15:03:06,660 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/52745f7b1/9548a12b108c4667a379308abd692bda/FLAG7a2923de4 [2020-12-23 15:03:07,766 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 15:03:07,767 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--rfc1201.ko-entry_point.cil.out.i [2020-12-23 15:03:07,816 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/52745f7b1/9548a12b108c4667a379308abd692bda/FLAG7a2923de4 [2020-12-23 15:03:08,220 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/52745f7b1/9548a12b108c4667a379308abd692bda [2020-12-23 15:03:08,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 15:03:08,233 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 15:03:08,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 15:03:08,239 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 15:03:08,244 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 15:03:08,245 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 03:03:08" (1/1) ... [2020-12-23 15:03:08,247 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15b69d9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:03:08, skipping insertion in model container [2020-12-23 15:03:08,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 03:03:08" (1/1) ... [2020-12-23 15:03:08,258 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 15:03:08,386 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[214],StructAccessExpression[IdentifierExpression[~skb,],offset]]]] 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[~tmp~3,] [2020-12-23 15:03:09,287 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--rfc1201.ko-entry_point.cil.out.i[149470,149483] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~arc_proto_map~0,GLOBAL],[IntegerLiteral[236]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~arc_proto_map~0,GLOBAL],[IntegerLiteral[250]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~arc_proto_map~0,GLOBAL],[IntegerLiteral[214]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~arc_proto_map~0,GLOBAL],[IntegerLiteral[213]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~arc_proto_map~0,GLOBAL],[IntegerLiteral[196]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~arc_proto_map~0,GLOBAL],[IntegerLiteral[212]]] left hand side expression in assignment: lhs: VariableLHS[~arc_bcast_proto~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~pkt~0,] left hand side expression in assignment: lhs: VariableLHS[~soft~0,] left hand side expression in assignment: lhs: VariableLHS[~hdr_size~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[129],StructAccessExpression[IdentifierExpression[~skb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[129],StructAccessExpression[IdentifierExpression[~skb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[292],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[356],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~lp~0,] left hand side expression in assignment: lhs: VariableLHS[~pkt~1,] left hand side expression in assignment: lhs: VariableLHS[~soft~1,] left hand side expression in assignment: lhs: VariableLHS[~saddr~0,] left hand side expression in assignment: lhs: VariableLHS[~in~0,] left hand side expression in assignment: lhs: VariableLHS[~ofs~0,] left hand side expression in assignment: lhs: VariableLHS[~ofs~0,] left hand side expression in assignment: lhs: VariableLHS[~length,] left hand side expression in assignment: lhs: VariableLHS[~ofs~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~lp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[438],StructAccessExpression[IdentifierExpression[~lp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[292],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[380],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~in~0,],base],StructAccessExpression[IdentifierExpression[~in~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~in~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~in~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skb~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[308],StructAccessExpression[IdentifierExpression[~dev,],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[~pkt~1,] left hand side expression in assignment: lhs: VariableLHS[~soft~1,] left hand side expression in assignment: lhs: VariableLHS[~__len~0,] left hand side expression in assignment: lhs: VariableLHS[~__ret~0,] left hand side expression in assignment: lhs: VariableLHS[~__ret~0,] left hand side expression in assignment: lhs: VariableLHS[~arp~0,] left hand side expression in assignment: lhs: VariableLHS[~cptr~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[356],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~cptr~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[292],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[356],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] 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[~in~0,],base],StructAccessExpression[IdentifierExpression[~in~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[292],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[380],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~in~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11],StructAccessExpression[IdentifierExpression[~in~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~in~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[10],StructAccessExpression[IdentifierExpression[~in~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[292],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[380],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~in~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~in~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~in~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11],StructAccessExpression[IdentifierExpression[~in~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~in~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[10],StructAccessExpression[IdentifierExpression[~in~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~lp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[438],StructAccessExpression[IdentifierExpression[~lp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[292],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[340],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skb~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~in~0,],base],StructAccessExpression[IdentifierExpression[~in~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~lp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[438],StructAccessExpression[IdentifierExpression[~lp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[308],StructAccessExpression[IdentifierExpression[~dev,],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[~pkt~1,] left hand side expression in assignment: lhs: VariableLHS[~soft~1,] 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: lhs: VariableLHS[~__ret___0~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~soft~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~soft~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~packetnum~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[292],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[380],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~in~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[10],StructAccessExpression[IdentifierExpression[~in~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[292],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[364],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~lp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[438],StructAccessExpression[IdentifierExpression[~lp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~in~0,],base],StructAccessExpression[IdentifierExpression[~in~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[292],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[380],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~in~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11],StructAccessExpression[IdentifierExpression[~in~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~in~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[10],StructAccessExpression[IdentifierExpression[~in~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~pkt~1,] left hand side expression in assignment: lhs: VariableLHS[~soft~1,] left hand side expression in assignment: lhs: VariableLHS[~skb~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~in~0,],base],StructAccessExpression[IdentifierExpression[~in~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~in~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11],StructAccessExpression[IdentifierExpression[~in~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~in~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[10],StructAccessExpression[IdentifierExpression[~in~0,],offset]]]] 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: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~lp~1,] left hand side expression in assignment: lhs: VariableLHS[~hdr_size~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~pkt~2,] left hand side expression in assignment: lhs: VariableLHS[~soft~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~soft~2,],base],StructAccessExpression[IdentifierExpression[~soft~2,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~soft~2,],base],StructAccessExpression[IdentifierExpression[~soft~2,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~soft~2,],base],StructAccessExpression[IdentifierExpression[~soft~2,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~soft~2,],base],StructAccessExpression[IdentifierExpression[~soft~2,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~soft~2,],base],StructAccessExpression[IdentifierExpression[~soft~2,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~soft~2,],base],StructAccessExpression[IdentifierExpression[~soft~2,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[300],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[388],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pkt~2,],base],StructAccessExpression[IdentifierExpression[~pkt~2,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~lp~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[436],StructAccessExpression[IdentifierExpression[~lp~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~soft~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~soft~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~soft~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~soft~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pkt~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~pkt~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pkt~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~pkt~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~lp~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~hard,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~hard,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ofs~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~hard,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~hard,],offset]]]] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~excsoft~0,],proto] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~excsoft~0,],split_flag] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~excsoft~0,],sequence] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~hard,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~hard,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ofs~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~hard,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~hard,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ofs~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~hard,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~hard,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~lp~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[276],StructAccessExpression[IdentifierExpression[~lp~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~lp~3,] left hand side expression in assignment: lhs: VariableLHS[~maxsegsize~0,] left hand side expression in assignment: lhs: VariableLHS[~length,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pkt,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[5],StructAccessExpression[IdentifierExpression[~pkt,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~out~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~out~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~out~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~out~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[26],StructAccessExpression[IdentifierExpression[~out~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~out~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[30],StructAccessExpression[IdentifierExpression[~out~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~out~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~out~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: lhs: VariableLHS[~lp~4,] left hand side expression in assignment: lhs: VariableLHS[~out~1,] left hand side expression in assignment: lhs: VariableLHS[~hard~0,] left hand side expression in assignment: lhs: VariableLHS[~soft~3,] left hand side expression in assignment: lhs: VariableLHS[~maxsegsize~1,] left hand side expression in assignment: lhs: VariableLHS[~newsoft~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~newsoft~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~newsoft~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~newsoft~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~newsoft~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~newsoft~0,],base],StructAccessExpression[IdentifierExpression[~newsoft~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~newsoft~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~newsoft~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~seglen~0,] left hand side expression in assignment: lhs: VariableLHS[~seglen~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~out~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[26],StructAccessExpression[IdentifierExpression[~out~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~out~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~out~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~rfc1201_proto_group0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: VariableLHS[~rfc1201_proto_group1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg6~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg4~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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_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_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tmp~11,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[224],StructAccessExpression[IdentifierExpression[~tmp~11,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tmp~11,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[232],StructAccessExpression[IdentifierExpression[~tmp~11,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~set,] left hand side expression in assignment: lhs: VariableLHS[~last_index~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~set_impl~0,GLOBAL],[IdentifierExpression[~last_index~0,GLOBAL]]] left hand side expression in assignment: lhs: VariableLHS[~last_index~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~deleted_index~0,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~deleted_index~0,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~set_impl~0,GLOBAL],[BinaryExpression[ARITHMINUS,IdentifierExpression[~i~1,],IntegerLiteral[1]]]] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~last_index~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~2,] left hand side expression in assignment: lhs: VariableLHS[~skb~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~3,] left hand side expression in assignment: lhs: VariableLHS[~skb~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~6,] [2020-12-23 15:03:09,689 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 15:03:09,709 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[214],StructAccessExpression[IdentifierExpression[~skb,],offset]]]] 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[~tmp~3,] [2020-12-23 15:03:09,891 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--rfc1201.ko-entry_point.cil.out.i[149470,149483] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#arc_proto_map~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1888],StructAccessExpression[IdentifierExpression[~#arc_proto_map~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#arc_proto_map~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2000],StructAccessExpression[IdentifierExpression[~#arc_proto_map~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#arc_proto_map~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1712],StructAccessExpression[IdentifierExpression[~#arc_proto_map~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#arc_proto_map~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1704],StructAccessExpression[IdentifierExpression[~#arc_proto_map~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#arc_proto_map~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1568],StructAccessExpression[IdentifierExpression[~#arc_proto_map~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#arc_proto_map~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1696],StructAccessExpression[IdentifierExpression[~#arc_proto_map~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~arc_bcast_proto~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~pkt~0,] left hand side expression in assignment: lhs: VariableLHS[~soft~0,] left hand side expression in assignment: lhs: VariableLHS[~hdr_size~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[129],StructAccessExpression[IdentifierExpression[~skb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[129],StructAccessExpression[IdentifierExpression[~skb,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[292],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[356],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~lp~0,] left hand side expression in assignment: lhs: VariableLHS[~pkt~1,] left hand side expression in assignment: lhs: VariableLHS[~soft~1,] left hand side expression in assignment: lhs: VariableLHS[~saddr~0,] left hand side expression in assignment: lhs: VariableLHS[~in~0,] left hand side expression in assignment: lhs: VariableLHS[~ofs~0,] left hand side expression in assignment: lhs: VariableLHS[~ofs~0,] left hand side expression in assignment: lhs: VariableLHS[~length,] left hand side expression in assignment: lhs: VariableLHS[~ofs~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~lp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[438],StructAccessExpression[IdentifierExpression[~lp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[292],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[380],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~in~0,],base],StructAccessExpression[IdentifierExpression[~in~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~in~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~in~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skb~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[308],StructAccessExpression[IdentifierExpression[~dev,],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[~pkt~1,] left hand side expression in assignment: lhs: VariableLHS[~soft~1,] left hand side expression in assignment: lhs: VariableLHS[~__len~0,] left hand side expression in assignment: lhs: VariableLHS[~__ret~0,] left hand side expression in assignment: lhs: VariableLHS[~__ret~0,] left hand side expression in assignment: lhs: VariableLHS[~arp~0,] left hand side expression in assignment: lhs: VariableLHS[~cptr~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[356],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~cptr~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[292],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[356],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] 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[~in~0,],base],StructAccessExpression[IdentifierExpression[~in~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[292],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[380],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~in~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11],StructAccessExpression[IdentifierExpression[~in~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~in~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[10],StructAccessExpression[IdentifierExpression[~in~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[292],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[380],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~in~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~in~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~in~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11],StructAccessExpression[IdentifierExpression[~in~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~in~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[10],StructAccessExpression[IdentifierExpression[~in~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~lp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[438],StructAccessExpression[IdentifierExpression[~lp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[292],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[340],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skb~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~in~0,],base],StructAccessExpression[IdentifierExpression[~in~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~lp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[438],StructAccessExpression[IdentifierExpression[~lp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[308],StructAccessExpression[IdentifierExpression[~dev,],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[~pkt~1,] left hand side expression in assignment: lhs: VariableLHS[~soft~1,] 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: lhs: VariableLHS[~__ret___0~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~soft~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~soft~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~packetnum~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[292],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[380],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~in~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[10],StructAccessExpression[IdentifierExpression[~in~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[292],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[364],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~lp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[438],StructAccessExpression[IdentifierExpression[~lp~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~in~0,],base],StructAccessExpression[IdentifierExpression[~in~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[292],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[380],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~in~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11],StructAccessExpression[IdentifierExpression[~in~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~in~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[10],StructAccessExpression[IdentifierExpression[~in~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~pkt~1,] left hand side expression in assignment: lhs: VariableLHS[~soft~1,] left hand side expression in assignment: lhs: VariableLHS[~skb~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~in~0,],base],StructAccessExpression[IdentifierExpression[~in~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~in~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11],StructAccessExpression[IdentifierExpression[~in~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~in~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[10],StructAccessExpression[IdentifierExpression[~in~0,],offset]]]] 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: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~lp~1,] left hand side expression in assignment: lhs: VariableLHS[~hdr_size~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~pkt~2,] left hand side expression in assignment: lhs: VariableLHS[~soft~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~soft~2,],base],StructAccessExpression[IdentifierExpression[~soft~2,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~soft~2,],base],StructAccessExpression[IdentifierExpression[~soft~2,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~soft~2,],base],StructAccessExpression[IdentifierExpression[~soft~2,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~soft~2,],base],StructAccessExpression[IdentifierExpression[~soft~2,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~soft~2,],base],StructAccessExpression[IdentifierExpression[~soft~2,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~soft~2,],base],StructAccessExpression[IdentifierExpression[~soft~2,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[300],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[388],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pkt~2,],base],StructAccessExpression[IdentifierExpression[~pkt~2,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~lp~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[436],StructAccessExpression[IdentifierExpression[~lp~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~soft~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~soft~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~soft~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~soft~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pkt~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~pkt~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pkt~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~pkt~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~lp~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~hard,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~hard,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ofs~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~hard,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~hard,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#excsoft~0,],base],StructAccessExpression[IdentifierExpression[~#excsoft~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#excsoft~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~#excsoft~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#excsoft~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~#excsoft~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~hard,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~hard,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ofs~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~hard,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~hard,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ofs~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~hard,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~hard,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~lp~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[276],StructAccessExpression[IdentifierExpression[~lp~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~lp~3,] left hand side expression in assignment: lhs: VariableLHS[~maxsegsize~0,] left hand side expression in assignment: lhs: VariableLHS[~length,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pkt,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[5],StructAccessExpression[IdentifierExpression[~pkt,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~out~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~out~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~out~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~out~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[26],StructAccessExpression[IdentifierExpression[~out~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~out~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[30],StructAccessExpression[IdentifierExpression[~out~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~out~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~out~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: lhs: VariableLHS[~lp~4,] left hand side expression in assignment: lhs: VariableLHS[~out~1,] left hand side expression in assignment: lhs: VariableLHS[~hard~0,] left hand side expression in assignment: lhs: VariableLHS[~soft~3,] left hand side expression in assignment: lhs: VariableLHS[~maxsegsize~1,] left hand side expression in assignment: lhs: VariableLHS[~newsoft~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~newsoft~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~newsoft~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~newsoft~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~newsoft~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~newsoft~0,],base],StructAccessExpression[IdentifierExpression[~newsoft~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~newsoft~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~newsoft~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~seglen~0,] left hand side expression in assignment: lhs: VariableLHS[~seglen~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~out~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[26],StructAccessExpression[IdentifierExpression[~out~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~out~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~out~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~rfc1201_proto_group0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: VariableLHS[~rfc1201_proto_group1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg6~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg4~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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_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_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tmp~11,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[224],StructAccessExpression[IdentifierExpression[~tmp~11,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tmp~11,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[232],StructAccessExpression[IdentifierExpression[~tmp~11,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~set,] left hand side expression in assignment: lhs: VariableLHS[~last_index~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#set_impl~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#set_impl~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~last_index~0,GLOBAL]]]]] left hand side expression in assignment: lhs: VariableLHS[~last_index~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~deleted_index~0,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~deleted_index~0,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#set_impl~0,GLOBAL],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#set_impl~0,GLOBAL],offset],BinaryExpression[ARITHMUL,IntegerLiteral[8],BinaryExpression[ARITHMINUS,IdentifierExpression[~i~1,],IntegerLiteral[1]]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~last_index~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~2,] left hand side expression in assignment: lhs: VariableLHS[~skb~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~3,] left hand side expression in assignment: lhs: VariableLHS[~skb~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~6,] [2020-12-23 15:03:10,063 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 15:03:10,231 INFO L208 MainTranslator]: Completed translation [2020-12-23 15:03:10,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:03:10 WrapperNode [2020-12-23 15:03:10,233 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 15:03:10,235 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 15:03:10,235 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 15:03:10,235 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 15:03:10,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:03:10" (1/1) ... [2020-12-23 15:03:10,325 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:03:10" (1/1) ... [2020-12-23 15:03:10,474 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 15:03:10,478 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 15:03:10,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 15:03:10,479 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 15:03:10,490 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:03:10" (1/1) ... [2020-12-23 15:03:10,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:03:10" (1/1) ... [2020-12-23 15:03:10,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:03:10" (1/1) ... [2020-12-23 15:03:10,519 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:03:10" (1/1) ... [2020-12-23 15:03:10,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:03:10" (1/1) ... [2020-12-23 15:03:10,630 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:03:10" (1/1) ... [2020-12-23 15:03:10,641 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:03:10" (1/1) ... [2020-12-23 15:03:10,660 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 15:03:10,661 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 15:03:10,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 15:03:10,727 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 15:03:10,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:03:10" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 15:03:10,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2020-12-23 15:03:10,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 15:03:10,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 15:03:10,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2020-12-23 15:03:10,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2020-12-23 15:03:10,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 15:03:10,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 15:03:10,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 15:03:10,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-23 15:03:10,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 15:03:10,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 15:03:10,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 15:03:10,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2020-12-23 15:03:10,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 15:03:10,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 15:03:13,314 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 15:03:13,315 INFO L299 CfgBuilder]: Removed 198 assume(true) statements. [2020-12-23 15:03:13,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 03:03:13 BoogieIcfgContainer [2020-12-23 15:03:13,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 15:03:13,319 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 15:03:13,320 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 15:03:13,323 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 15:03:13,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 03:03:08" (1/3) ... [2020-12-23 15:03:13,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@433ffb1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 03:03:13, skipping insertion in model container [2020-12-23 15:03:13,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 03:03:10" (2/3) ... [2020-12-23 15:03:13,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@433ffb1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 03:03:13, skipping insertion in model container [2020-12-23 15:03:13,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 03:03:13" (3/3) ... [2020-12-23 15:03:13,327 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--rfc1201.ko-entry_point.cil.out.i [2020-12-23 15:03:13,334 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 15:03:13,340 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 15:03:13,363 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 15:03:13,395 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 15:03:13,395 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 15:03:13,396 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 15:03:13,396 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 15:03:13,396 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 15:03:13,396 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 15:03:13,396 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 15:03:13,397 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 15:03:13,421 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states. [2020-12-23 15:03:13,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-23 15:03:13,429 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:03:13,430 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:03:13,430 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:03:13,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:03:13,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1448866139, now seen corresponding path program 1 times [2020-12-23 15:03:13,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:03:13,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284274605] [2020-12-23 15:03:13,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:03:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:03:13,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 15:03:13,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284274605] [2020-12-23 15:03:13,881 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:03:13,881 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:03:13,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15972967] [2020-12-23 15:03:13,887 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:03:13,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:03:13,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:03:13,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:03:13,907 INFO L87 Difference]: Start difference. First operand 296 states. Second operand 3 states. [2020-12-23 15:03:13,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:03:13,994 INFO L93 Difference]: Finished difference Result 588 states and 899 transitions. [2020-12-23 15:03:13,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:03:13,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-12-23 15:03:13,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:03:14,017 INFO L225 Difference]: With dead ends: 588 [2020-12-23 15:03:14,018 INFO L226 Difference]: Without dead ends: 290 [2020-12-23 15:03:14,022 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:03:14,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2020-12-23 15:03:14,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2020-12-23 15:03:14,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2020-12-23 15:03:14,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 420 transitions. [2020-12-23 15:03:14,089 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 420 transitions. Word has length 18 [2020-12-23 15:03:14,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:03:14,090 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 420 transitions. [2020-12-23 15:03:14,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:03:14,090 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 420 transitions. [2020-12-23 15:03:14,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-23 15:03:14,091 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:03:14,092 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:03:14,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 15:03:14,092 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:03:14,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:03:14,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1211009814, now seen corresponding path program 1 times [2020-12-23 15:03:14,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:03:14,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683456629] [2020-12-23 15:03:14,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:03:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:03:14,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 15:03:14,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683456629] [2020-12-23 15:03:14,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:03:14,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:03:14,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295389614] [2020-12-23 15:03:14,305 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:03:14,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:03:14,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:03:14,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:03:14,307 INFO L87 Difference]: Start difference. First operand 290 states and 420 transitions. Second operand 3 states. [2020-12-23 15:03:14,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:03:14,496 INFO L93 Difference]: Finished difference Result 828 states and 1211 transitions. [2020-12-23 15:03:14,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:03:14,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-12-23 15:03:14,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:03:14,519 INFO L225 Difference]: With dead ends: 828 [2020-12-23 15:03:14,520 INFO L226 Difference]: Without dead ends: 549 [2020-12-23 15:03:14,523 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:03:14,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-12-23 15:03:14,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 549. [2020-12-23 15:03:14,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2020-12-23 15:03:14,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 801 transitions. [2020-12-23 15:03:14,647 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 801 transitions. Word has length 19 [2020-12-23 15:03:14,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:03:14,648 INFO L481 AbstractCegarLoop]: Abstraction has 549 states and 801 transitions. [2020-12-23 15:03:14,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:03:14,648 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 801 transitions. [2020-12-23 15:03:14,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-23 15:03:14,652 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:03:14,653 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] [2020-12-23 15:03:14,653 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 15:03:14,653 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:03:14,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:03:14,654 INFO L82 PathProgramCache]: Analyzing trace with hash 72115822, now seen corresponding path program 1 times [2020-12-23 15:03:14,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:03:14,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283555472] [2020-12-23 15:03:14,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:03:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:03:14,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 15:03:14,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283555472] [2020-12-23 15:03:14,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:03:14,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 15:03:14,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575757283] [2020-12-23 15:03:14,904 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 15:03:14,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:03:14,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 15:03:14,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 15:03:14,917 INFO L87 Difference]: Start difference. First operand 549 states and 801 transitions. Second operand 4 states. [2020-12-23 15:03:15,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:03:15,059 INFO L93 Difference]: Finished difference Result 1086 states and 1587 transitions. [2020-12-23 15:03:15,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 15:03:15,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-12-23 15:03:15,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:03:15,066 INFO L225 Difference]: With dead ends: 1086 [2020-12-23 15:03:15,067 INFO L226 Difference]: Without dead ends: 548 [2020-12-23 15:03:15,070 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:03:15,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-12-23 15:03:15,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2020-12-23 15:03:15,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2020-12-23 15:03:15,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 797 transitions. [2020-12-23 15:03:15,113 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 797 transitions. Word has length 24 [2020-12-23 15:03:15,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:03:15,113 INFO L481 AbstractCegarLoop]: Abstraction has 548 states and 797 transitions. [2020-12-23 15:03:15,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 15:03:15,113 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 797 transitions. [2020-12-23 15:03:15,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-23 15:03:15,117 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:03:15,117 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:03:15,117 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 15:03:15,117 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:03:15,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:03:15,118 INFO L82 PathProgramCache]: Analyzing trace with hash -479932233, now seen corresponding path program 1 times [2020-12-23 15:03:15,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:03:15,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667080230] [2020-12-23 15:03:15,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:03:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:03:15,346 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-23 15:03:15,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667080230] [2020-12-23 15:03:15,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:03:15,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 15:03:15,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286436953] [2020-12-23 15:03:15,352 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 15:03:15,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:03:15,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 15:03:15,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:03:15,355 INFO L87 Difference]: Start difference. First operand 548 states and 797 transitions. Second operand 5 states. [2020-12-23 15:03:15,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:03:15,561 INFO L93 Difference]: Finished difference Result 1620 states and 2364 transitions. [2020-12-23 15:03:15,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 15:03:15,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2020-12-23 15:03:15,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:03:15,569 INFO L225 Difference]: With dead ends: 1620 [2020-12-23 15:03:15,570 INFO L226 Difference]: Without dead ends: 1079 [2020-12-23 15:03:15,572 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 15:03:15,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2020-12-23 15:03:15,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1063. [2020-12-23 15:03:15,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1063 states. [2020-12-23 15:03:15,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1551 transitions. [2020-12-23 15:03:15,630 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1551 transitions. Word has length 35 [2020-12-23 15:03:15,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:03:15,631 INFO L481 AbstractCegarLoop]: Abstraction has 1063 states and 1551 transitions. [2020-12-23 15:03:15,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 15:03:15,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1551 transitions. [2020-12-23 15:03:15,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-23 15:03:15,648 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:03:15,649 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:03:15,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 15:03:15,650 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:03:15,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:03:15,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1842743390, now seen corresponding path program 1 times [2020-12-23 15:03:15,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:03:15,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972787437] [2020-12-23 15:03:15,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:03:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:03:15,809 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-23 15:03:15,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972787437] [2020-12-23 15:03:15,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:03:15,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:03:15,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072940345] [2020-12-23 15:03:15,811 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:03:15,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:03:15,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:03:15,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:03:15,816 INFO L87 Difference]: Start difference. First operand 1063 states and 1551 transitions. Second operand 3 states. [2020-12-23 15:03:15,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:03:15,908 INFO L93 Difference]: Finished difference Result 1660 states and 2417 transitions. [2020-12-23 15:03:15,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:03:15,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-12-23 15:03:15,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:03:15,912 INFO L225 Difference]: With dead ends: 1660 [2020-12-23 15:03:15,913 INFO L226 Difference]: Without dead ends: 608 [2020-12-23 15:03:15,915 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:03:15,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2020-12-23 15:03:15,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 594. [2020-12-23 15:03:15,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2020-12-23 15:03:15,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 861 transitions. [2020-12-23 15:03:15,945 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 861 transitions. Word has length 66 [2020-12-23 15:03:15,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:03:15,946 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 861 transitions. [2020-12-23 15:03:15,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:03:15,947 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 861 transitions. [2020-12-23 15:03:15,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-23 15:03:15,949 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:03:15,949 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:03:15,949 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 15:03:15,950 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:03:15,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:03:15,953 INFO L82 PathProgramCache]: Analyzing trace with hash -892127492, now seen corresponding path program 2 times [2020-12-23 15:03:15,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:03:15,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347504242] [2020-12-23 15:03:15,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:03:16,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:03:16,155 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 15:03:16,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347504242] [2020-12-23 15:03:16,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:03:16,157 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 15:03:16,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117955707] [2020-12-23 15:03:16,158 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 15:03:16,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:03:16,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 15:03:16,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 15:03:16,160 INFO L87 Difference]: Start difference. First operand 594 states and 861 transitions. Second operand 4 states. [2020-12-23 15:03:16,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:03:16,354 INFO L93 Difference]: Finished difference Result 2562 states and 3741 transitions. [2020-12-23 15:03:16,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 15:03:16,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2020-12-23 15:03:16,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:03:16,372 INFO L225 Difference]: With dead ends: 2562 [2020-12-23 15:03:16,373 INFO L226 Difference]: Without dead ends: 1992 [2020-12-23 15:03:16,375 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:03:16,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2020-12-23 15:03:16,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 602. [2020-12-23 15:03:16,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2020-12-23 15:03:16,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 869 transitions. [2020-12-23 15:03:16,423 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 869 transitions. Word has length 66 [2020-12-23 15:03:16,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:03:16,428 INFO L481 AbstractCegarLoop]: Abstraction has 602 states and 869 transitions. [2020-12-23 15:03:16,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 15:03:16,429 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 869 transitions. [2020-12-23 15:03:16,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-12-23 15:03:16,440 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:03:16,441 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:03:16,441 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 15:03:16,441 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:03:16,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:03:16,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1161719077, now seen corresponding path program 1 times [2020-12-23 15:03:16,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:03:16,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162492078] [2020-12-23 15:03:16,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:03:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:03:16,724 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 15:03:16,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162492078] [2020-12-23 15:03:16,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:03:16,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 15:03:16,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181683195] [2020-12-23 15:03:16,727 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 15:03:16,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:03:16,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 15:03:16,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-12-23 15:03:16,728 INFO L87 Difference]: Start difference. First operand 602 states and 869 transitions. Second operand 9 states. [2020-12-23 15:03:17,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:03:17,541 INFO L93 Difference]: Finished difference Result 3274 states and 4773 transitions. [2020-12-23 15:03:17,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-23 15:03:17,542 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2020-12-23 15:03:17,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:03:17,557 INFO L225 Difference]: With dead ends: 3274 [2020-12-23 15:03:17,557 INFO L226 Difference]: Without dead ends: 2696 [2020-12-23 15:03:17,563 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2020-12-23 15:03:17,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2696 states. [2020-12-23 15:03:17,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2696 to 610. [2020-12-23 15:03:17,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2020-12-23 15:03:17,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 877 transitions. [2020-12-23 15:03:17,624 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 877 transitions. Word has length 69 [2020-12-23 15:03:17,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:03:17,625 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 877 transitions. [2020-12-23 15:03:17,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 15:03:17,625 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 877 transitions. [2020-12-23 15:03:17,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-12-23 15:03:17,627 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:03:17,627 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:03:17,627 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 15:03:17,627 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:03:17,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:03:17,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1273317856, now seen corresponding path program 1 times [2020-12-23 15:03:17,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:03:17,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841841966] [2020-12-23 15:03:17,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:03:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:03:18,268 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 15:03:18,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841841966] [2020-12-23 15:03:18,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:03:18,269 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-23 15:03:18,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447448552] [2020-12-23 15:03:18,269 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-23 15:03:18,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:03:18,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-23 15:03:18,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-12-23 15:03:18,271 INFO L87 Difference]: Start difference. First operand 610 states and 877 transitions. Second operand 11 states. [2020-12-23 15:03:20,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:03:20,602 INFO L93 Difference]: Finished difference Result 2812 states and 4074 transitions. [2020-12-23 15:03:20,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-23 15:03:20,604 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2020-12-23 15:03:20,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:03:20,619 INFO L225 Difference]: With dead ends: 2812 [2020-12-23 15:03:20,619 INFO L226 Difference]: Without dead ends: 2226 [2020-12-23 15:03:20,622 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=212, Invalid=490, Unknown=0, NotChecked=0, Total=702 [2020-12-23 15:03:20,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2226 states. [2020-12-23 15:03:20,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2226 to 638. [2020-12-23 15:03:20,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2020-12-23 15:03:20,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 905 transitions. [2020-12-23 15:03:20,743 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 905 transitions. Word has length 71 [2020-12-23 15:03:20,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:03:20,744 INFO L481 AbstractCegarLoop]: Abstraction has 638 states and 905 transitions. [2020-12-23 15:03:20,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-23 15:03:20,744 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 905 transitions. [2020-12-23 15:03:20,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-23 15:03:20,746 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:03:20,747 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:03:20,747 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 15:03:20,747 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:03:20,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:03:20,748 INFO L82 PathProgramCache]: Analyzing trace with hash -207364913, now seen corresponding path program 1 times [2020-12-23 15:03:20,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:03:20,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172335303] [2020-12-23 15:03:20,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:03:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:03:20,915 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 15:03:20,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172335303] [2020-12-23 15:03:20,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:03:20,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:03:20,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099121024] [2020-12-23 15:03:20,917 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:03:20,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:03:20,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:03:20,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:03:20,918 INFO L87 Difference]: Start difference. First operand 638 states and 905 transitions. Second operand 3 states. [2020-12-23 15:03:21,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:03:21,113 INFO L93 Difference]: Finished difference Result 1536 states and 2187 transitions. [2020-12-23 15:03:21,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:03:21,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2020-12-23 15:03:21,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:03:21,122 INFO L225 Difference]: With dead ends: 1536 [2020-12-23 15:03:21,123 INFO L226 Difference]: Without dead ends: 1222 [2020-12-23 15:03:21,124 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:03:21,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2020-12-23 15:03:21,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 642. [2020-12-23 15:03:21,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2020-12-23 15:03:21,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 909 transitions. [2020-12-23 15:03:21,223 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 909 transitions. Word has length 77 [2020-12-23 15:03:21,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:03:21,225 INFO L481 AbstractCegarLoop]: Abstraction has 642 states and 909 transitions. [2020-12-23 15:03:21,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:03:21,225 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 909 transitions. [2020-12-23 15:03:21,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-12-23 15:03:21,229 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:03:21,230 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:03:21,230 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 15:03:21,230 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:03:21,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:03:21,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1597670354, now seen corresponding path program 1 times [2020-12-23 15:03:21,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:03:21,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049278939] [2020-12-23 15:03:21,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:03:21,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:03:21,401 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 15:03:21,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049278939] [2020-12-23 15:03:21,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:03:21,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 15:03:21,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919356384] [2020-12-23 15:03:21,402 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 15:03:21,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:03:21,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 15:03:21,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 15:03:21,404 INFO L87 Difference]: Start difference. First operand 642 states and 909 transitions. Second operand 4 states. [2020-12-23 15:03:21,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:03:21,763 INFO L93 Difference]: Finished difference Result 1538 states and 2184 transitions. [2020-12-23 15:03:21,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 15:03:21,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2020-12-23 15:03:21,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:03:21,770 INFO L225 Difference]: With dead ends: 1538 [2020-12-23 15:03:21,770 INFO L226 Difference]: Without dead ends: 920 [2020-12-23 15:03:21,772 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 15:03:21,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2020-12-23 15:03:21,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 636. [2020-12-23 15:03:21,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2020-12-23 15:03:21,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 897 transitions. [2020-12-23 15:03:21,854 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 897 transitions. Word has length 79 [2020-12-23 15:03:21,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:03:21,855 INFO L481 AbstractCegarLoop]: Abstraction has 636 states and 897 transitions. [2020-12-23 15:03:21,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 15:03:21,855 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 897 transitions. [2020-12-23 15:03:21,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-23 15:03:21,857 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:03:21,857 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:03:21,857 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 15:03:21,857 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:03:21,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:03:21,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1802324330, now seen corresponding path program 1 times [2020-12-23 15:03:21,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:03:21,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973395115] [2020-12-23 15:03:21,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:03:21,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:03:22,079 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 15:03:22,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973395115] [2020-12-23 15:03:22,080 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:03:22,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 15:03:22,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177069689] [2020-12-23 15:03:22,081 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 15:03:22,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:03:22,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 15:03:22,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:03:22,084 INFO L87 Difference]: Start difference. First operand 636 states and 897 transitions. Second operand 3 states. [2020-12-23 15:03:22,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:03:22,210 INFO L93 Difference]: Finished difference Result 1519 states and 2148 transitions. [2020-12-23 15:03:22,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 15:03:22,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2020-12-23 15:03:22,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:03:22,216 INFO L225 Difference]: With dead ends: 1519 [2020-12-23 15:03:22,216 INFO L226 Difference]: Without dead ends: 907 [2020-12-23 15:03:22,218 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 15:03:22,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2020-12-23 15:03:22,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 630. [2020-12-23 15:03:22,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2020-12-23 15:03:22,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 885 transitions. [2020-12-23 15:03:22,294 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 885 transitions. Word has length 84 [2020-12-23 15:03:22,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:03:22,295 INFO L481 AbstractCegarLoop]: Abstraction has 630 states and 885 transitions. [2020-12-23 15:03:22,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 15:03:22,295 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 885 transitions. [2020-12-23 15:03:22,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-23 15:03:22,296 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:03:22,297 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:03:22,297 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 15:03:22,297 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:03:22,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:03:22,298 INFO L82 PathProgramCache]: Analyzing trace with hash 457259670, now seen corresponding path program 1 times [2020-12-23 15:03:22,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:03:22,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313622271] [2020-12-23 15:03:22,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:03:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:03:22,567 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 15:03:22,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313622271] [2020-12-23 15:03:22,569 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:03:22,569 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 15:03:22,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106858109] [2020-12-23 15:03:22,570 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 15:03:22,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:03:22,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 15:03:22,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 15:03:22,571 INFO L87 Difference]: Start difference. First operand 630 states and 885 transitions. Second operand 4 states. [2020-12-23 15:03:22,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:03:22,816 INFO L93 Difference]: Finished difference Result 1515 states and 2138 transitions. [2020-12-23 15:03:22,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 15:03:22,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2020-12-23 15:03:22,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:03:22,823 INFO L225 Difference]: With dead ends: 1515 [2020-12-23 15:03:22,823 INFO L226 Difference]: Without dead ends: 909 [2020-12-23 15:03:22,825 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:03:22,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2020-12-23 15:03:22,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 632. [2020-12-23 15:03:22,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2020-12-23 15:03:22,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 887 transitions. [2020-12-23 15:03:22,936 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 887 transitions. Word has length 84 [2020-12-23 15:03:22,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:03:22,937 INFO L481 AbstractCegarLoop]: Abstraction has 632 states and 887 transitions. [2020-12-23 15:03:22,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 15:03:22,937 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 887 transitions. [2020-12-23 15:03:22,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-12-23 15:03:22,939 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:03:22,939 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:03:22,939 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 15:03:22,940 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:03:22,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:03:22,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1486510631, now seen corresponding path program 1 times [2020-12-23 15:03:22,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:03:22,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935649251] [2020-12-23 15:03:22,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:03:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:03:23,108 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 15:03:23,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935649251] [2020-12-23 15:03:23,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882282237] [2020-12-23 15:03:23,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:03:23,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:03:23,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 15:03:23,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:03:24,001 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 15:03:24,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:03:24,001 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-12-23 15:03:24,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954844034] [2020-12-23 15:03:24,002 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 15:03:24,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:03:24,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 15:03:24,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-23 15:03:24,004 INFO L87 Difference]: Start difference. First operand 632 states and 887 transitions. Second operand 7 states. [2020-12-23 15:03:24,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:03:24,670 INFO L93 Difference]: Finished difference Result 2109 states and 2962 transitions. [2020-12-23 15:03:24,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 15:03:24,671 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2020-12-23 15:03:24,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:03:24,680 INFO L225 Difference]: With dead ends: 2109 [2020-12-23 15:03:24,681 INFO L226 Difference]: Without dead ends: 1501 [2020-12-23 15:03:24,683 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-12-23 15:03:24,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2020-12-23 15:03:24,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 642. [2020-12-23 15:03:24,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2020-12-23 15:03:24,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 901 transitions. [2020-12-23 15:03:24,868 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 901 transitions. Word has length 85 [2020-12-23 15:03:24,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:03:24,868 INFO L481 AbstractCegarLoop]: Abstraction has 642 states and 901 transitions. [2020-12-23 15:03:24,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 15:03:24,869 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 901 transitions. [2020-12-23 15:03:24,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-12-23 15:03:24,870 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:03:24,871 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:03:25,086 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-12-23 15:03:25,087 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:03:25,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:03:25,088 INFO L82 PathProgramCache]: Analyzing trace with hash 97810424, now seen corresponding path program 1 times [2020-12-23 15:03:25,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:03:25,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821818028] [2020-12-23 15:03:25,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:03:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:03:25,443 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-23 15:03:25,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821818028] [2020-12-23 15:03:25,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740806812] [2020-12-23 15:03:25,444 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 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 [2020-12-23 15:03:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:03:26,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 949 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-23 15:03:26,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:03:26,867 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-23 15:03:26,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:03:26,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2020-12-23 15:03:26,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274842383] [2020-12-23 15:03:26,869 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 15:03:26,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:03:26,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 15:03:26,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-12-23 15:03:26,870 INFO L87 Difference]: Start difference. First operand 642 states and 901 transitions. Second operand 8 states. [2020-12-23 15:03:27,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:03:27,221 INFO L93 Difference]: Finished difference Result 1539 states and 2170 transitions. [2020-12-23 15:03:27,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 15:03:27,222 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 86 [2020-12-23 15:03:27,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:03:27,228 INFO L225 Difference]: With dead ends: 1539 [2020-12-23 15:03:27,228 INFO L226 Difference]: Without dead ends: 921 [2020-12-23 15:03:27,230 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-12-23 15:03:27,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2020-12-23 15:03:27,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 644. [2020-12-23 15:03:27,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2020-12-23 15:03:27,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 903 transitions. [2020-12-23 15:03:27,405 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 903 transitions. Word has length 86 [2020-12-23 15:03:27,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:03:27,405 INFO L481 AbstractCegarLoop]: Abstraction has 644 states and 903 transitions. [2020-12-23 15:03:27,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 15:03:27,405 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 903 transitions. [2020-12-23 15:03:27,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-12-23 15:03:27,408 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:03:27,408 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:03:27,609 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-12-23 15:03:27,610 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:03:27,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:03:27,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1365505865, now seen corresponding path program 2 times [2020-12-23 15:03:27,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:03:27,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698512101] [2020-12-23 15:03:27,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:03:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:03:28,163 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-23 15:03:28,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698512101] [2020-12-23 15:03:28,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 15:03:28,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 15:03:28,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644792593] [2020-12-23 15:03:28,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 15:03:28,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:03:28,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 15:03:28,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 15:03:28,165 INFO L87 Difference]: Start difference. First operand 644 states and 903 transitions. Second operand 5 states. [2020-12-23 15:03:29,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:03:29,705 INFO L93 Difference]: Finished difference Result 1428 states and 2029 transitions. [2020-12-23 15:03:29,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 15:03:29,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2020-12-23 15:03:29,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:03:29,711 INFO L225 Difference]: With dead ends: 1428 [2020-12-23 15:03:29,711 INFO L226 Difference]: Without dead ends: 808 [2020-12-23 15:03:29,713 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-23 15:03:29,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2020-12-23 15:03:29,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 652. [2020-12-23 15:03:29,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2020-12-23 15:03:29,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 915 transitions. [2020-12-23 15:03:29,806 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 915 transitions. Word has length 87 [2020-12-23 15:03:29,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:03:29,806 INFO L481 AbstractCegarLoop]: Abstraction has 652 states and 915 transitions. [2020-12-23 15:03:29,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 15:03:29,806 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 915 transitions. [2020-12-23 15:03:29,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-12-23 15:03:29,808 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:03:29,808 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:03:29,809 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 15:03:29,809 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:03:29,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:03:29,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1349987147, now seen corresponding path program 1 times [2020-12-23 15:03:29,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:03:29,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756411372] [2020-12-23 15:03:29,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:03:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:03:30,185 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-23 15:03:30,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756411372] [2020-12-23 15:03:30,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762515161] [2020-12-23 15:03:30,186 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 [2020-12-23 15:03:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:03:31,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-23 15:03:31,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:03:31,944 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-23 15:03:31,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:03:31,945 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2020-12-23 15:03:31,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572141110] [2020-12-23 15:03:31,946 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 15:03:31,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:03:31,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 15:03:31,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-12-23 15:03:31,947 INFO L87 Difference]: Start difference. First operand 652 states and 915 transitions. Second operand 10 states. [2020-12-23 15:03:32,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:03:32,534 INFO L93 Difference]: Finished difference Result 1559 states and 2198 transitions. [2020-12-23 15:03:32,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 15:03:32,535 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2020-12-23 15:03:32,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:03:32,540 INFO L225 Difference]: With dead ends: 1559 [2020-12-23 15:03:32,541 INFO L226 Difference]: Without dead ends: 931 [2020-12-23 15:03:32,543 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-12-23 15:03:32,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2020-12-23 15:03:32,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 654. [2020-12-23 15:03:32,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2020-12-23 15:03:32,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 917 transitions. [2020-12-23 15:03:32,636 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 917 transitions. Word has length 87 [2020-12-23 15:03:32,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:03:32,636 INFO L481 AbstractCegarLoop]: Abstraction has 654 states and 917 transitions. [2020-12-23 15:03:32,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 15:03:32,636 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 917 transitions. [2020-12-23 15:03:32,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-23 15:03:32,638 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:03:32,638 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:03:32,853 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-12-23 15:03:32,854 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:03:32,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:03:32,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1528278614, now seen corresponding path program 2 times [2020-12-23 15:03:32,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:03:32,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406651637] [2020-12-23 15:03:32,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:03:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:03:33,248 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-23 15:03:33,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406651637] [2020-12-23 15:03:33,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610655531] [2020-12-23 15:03:33,249 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 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 [2020-12-23 15:03:34,780 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 15:03:34,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 15:03:34,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 1000 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-23 15:03:34,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 15:03:34,990 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-23 15:03:34,991 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 15:03:34,992 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2020-12-23 15:03:34,995 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886795289] [2020-12-23 15:03:34,996 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 15:03:34,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 15:03:34,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 15:03:34,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-12-23 15:03:34,997 INFO L87 Difference]: Start difference. First operand 654 states and 917 transitions. Second operand 12 states. [2020-12-23 15:03:35,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 15:03:35,655 INFO L93 Difference]: Finished difference Result 1563 states and 2202 transitions. [2020-12-23 15:03:35,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 15:03:35,656 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 88 [2020-12-23 15:03:35,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 15:03:35,661 INFO L225 Difference]: With dead ends: 1563 [2020-12-23 15:03:35,661 INFO L226 Difference]: Without dead ends: 933 [2020-12-23 15:03:35,663 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2020-12-23 15:03:35,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2020-12-23 15:03:35,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 656. [2020-12-23 15:03:35,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2020-12-23 15:03:35,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 919 transitions. [2020-12-23 15:03:35,755 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 919 transitions. Word has length 88 [2020-12-23 15:03:35,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 15:03:35,755 INFO L481 AbstractCegarLoop]: Abstraction has 656 states and 919 transitions. [2020-12-23 15:03:35,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-23 15:03:35,755 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 919 transitions. [2020-12-23 15:03:35,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-12-23 15:03:35,757 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 15:03:35,758 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 15:03:35,972 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 15:03:35,973 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 15:03:35,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 15:03:35,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1534620501, now seen corresponding path program 3 times [2020-12-23 15:03:35,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 15:03:35,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130955152] [2020-12-23 15:03:35,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 15:03:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 15:03:36,385 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-23 15:03:36,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130955152] [2020-12-23 15:03:36,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965161475] [2020-12-23 15:03:36,386 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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