/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-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--atm--atmtcp.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 01:45:21,726 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 01:45:21,729 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 01:45:21,776 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 01:45:21,777 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 01:45:21,779 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 01:45:21,781 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 01:45:21,784 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 01:45:21,787 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 01:45:21,788 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 01:45:21,789 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 01:45:21,791 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 01:45:21,792 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 01:45:21,793 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 01:45:21,795 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 01:45:21,796 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 01:45:21,798 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 01:45:21,802 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 01:45:21,805 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 01:45:21,810 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 01:45:21,813 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 01:45:21,819 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 01:45:21,837 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 01:45:21,838 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 01:45:21,843 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 01:45:21,846 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 01:45:21,847 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 01:45:21,851 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 01:45:21,852 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 01:45:21,853 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 01:45:21,853 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 01:45:21,858 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 01:45:21,861 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 01:45:21,864 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 01:45:21,865 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 01:45:21,866 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 01:45:21,867 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 01:45:21,867 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 01:45:21,871 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 01:45:21,872 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 01:45:21,877 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 01:45:21,879 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-07 01:45:21,931 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 01:45:21,931 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 01:45:21,936 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 01:45:21,936 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 01:45:21,936 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 01:45:21,937 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 01:45:21,937 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 01:45:21,937 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 01:45:21,937 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-07 01:45:21,938 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 01:45:21,939 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-07 01:45:21,939 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-07 01:45:21,939 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 01:45:21,940 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-07 01:45:21,940 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 01:45:21,940 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 01:45:21,940 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 01:45:21,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 01:45:21,941 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 01:45:21,941 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 01:45:21,941 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-07 01:45:21,942 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 01:45:21,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 01:45:21,942 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-07 01:45:21,942 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 01:45:21,942 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-07 01:45:22,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 01:45:22,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 01:45:22,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 01:45:22,403 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 01:45:22,404 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 01:45:22,405 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--atm--atmtcp.ko-entry_point.cil.out.i [2021-01-07 01:45:22,495 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/0d971ce6d/46c4ad1c50ad4ddc9010fd6d78fac392/FLAGc32d2c270 [2021-01-07 01:45:23,681 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 01:45:23,682 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--atm--atmtcp.ko-entry_point.cil.out.i [2021-01-07 01:45:23,737 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/0d971ce6d/46c4ad1c50ad4ddc9010fd6d78fac392/FLAGc32d2c270 [2021-01-07 01:45:24,036 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/0d971ce6d/46c4ad1c50ad4ddc9010fd6d78fac392 [2021-01-07 01:45:24,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 01:45:24,042 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 01:45:24,044 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 01:45:24,044 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 01:45:24,048 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 01:45:24,049 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 01:45:24" (1/1) ... [2021-01-07 01:45:24,051 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4898fdb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:45:24, skipping insertion in model container [2021-01-07 01:45:24,051 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 01:45:24" (1/1) ... [2021-01-07 01:45:24,060 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 01:45:24,183 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: address: IdentifierExpression[~res,] left hand side expression in assignment: address: IdentifierExpression[~res,] left hand side expression in assignment: address: IdentifierExpression[~res,] left hand side expression in assignment: address: IdentifierExpression[~res,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] 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~3,] left hand side expression in assignment: lhs: VariableLHS[~p~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~p~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: lhs: VariableLHS[~sz~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~n,] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~skb,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_________p1~0,] left hand side expression in assignment: lhs: VariableLHS[~________p1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~wait~0,],flags] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~wait~0,],private] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~wait~0,],func] left hand side expression in assignment: lhs: StructLHS[StructLHS[VariableLHS[~wait~0,],task_list],next] left hand side expression in assignment: lhs: StructLHS[StructLHS[VariableLHS[~wait~0,],task_list],prev] left hand side expression in assignment: lhs: VariableLHS[~error~0,] left hand side expression in assignment: lhs: VariableLHS[~out_vcc~0,] left hand side expression in assignment: lhs: VariableLHS[~skb~0,] left hand side expression in assignment: lhs: VariableLHS[~out_vcc~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: VariableLHS[~new_msg~0,] left hand side expression in assignment: address: IdentifierExpression[~new_msg~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_msg~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~new_msg~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_msg~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~new_msg~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_msg~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~new_msg~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~old_test~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: lhs: VariableLHS[~out_vcc~0,] left hand side expression in assignment: lhs: VariableLHS[~error~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tmp___3~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11729],StructAccessExpression[IdentifierExpression[~tmp___3~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~__ret~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] 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[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tmp___9~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11729],StructAccessExpression[IdentifierExpression[~tmp___9~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~__ret___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___11~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___12~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___13~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___14~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___15~0,] left hand side expression in assignment: lhs: VariableLHS[~vcc~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~vcc~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1232],StructAccessExpression[IdentifierExpression[~vcc~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~vcc~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1234],StructAccessExpression[IdentifierExpression[~vcc~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~vcc~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1262],StructAccessExpression[IdentifierExpression[~vcc~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tmp~15,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[914],StructAccessExpression[IdentifierExpression[~tmp~15,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: lhs: VariableLHS[~vpi~0,] left hand side expression in assignment: lhs: VariableLHS[~vci~0,] left hand side expression in assignment: lhs: StructLHS[StructLHS[VariableLHS[~msg~0,],addr],sap_family] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: StructLHS[StructLHS[VariableLHS[~msg~0,],hdr],vpi] left hand side expression in assignment: lhs: StructLHS[StructLHS[StructLHS[VariableLHS[~msg~0,],addr],sap_addr],vpi] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: StructLHS[StructLHS[VariableLHS[~msg~0,],hdr],vci] left hand side expression in assignment: lhs: StructLHS[StructLHS[StructLHS[VariableLHS[~msg~0,],addr],sap_addr],vci] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~msg~0,],type] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~msg~0,],qos] left hand side expression in assignment: lhs: VariableLHS[~error~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] left hand side expression in assignment: lhs: StructLHS[StructLHS[VariableLHS[~msg~1,],addr],sap_family] left hand side expression in assignment: lhs: StructLHS[StructLHS[StructLHS[VariableLHS[~msg~1,],addr],sap_addr],vpi] left hand side expression in assignment: lhs: StructLHS[StructLHS[StructLHS[VariableLHS[~msg~1,],addr],sap_addr],vci] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~ci~0,],vpi_bits] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~ci~0,],vci_bits] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~head~0,] left hand side expression in assignment: lhs: VariableLHS[~____ptr~0,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: lhs: VariableLHS[~s~0,] left hand side expression in assignment: lhs: VariableLHS[~vcc~1,] left hand side expression in assignment: lhs: VariableLHS[~____ptr___0~0,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: lhs: VariableLHS[~s~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[90],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~out_vcc~1,] left hand side expression in assignment: lhs: VariableLHS[~dev_data~0,] left hand side expression in assignment: lhs: VariableLHS[~out_vcc~1,] left hand side expression in assignment: lhs: VariableLHS[~size~0,] left hand side expression in assignment: lhs: VariableLHS[~new_skb~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~hdr~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~hdr~0,],base],StructAccessExpression[IdentifierExpression[~hdr~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~5,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~hdr~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~hdr~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~hdr~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~hdr~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] left hand side expression in assignment: lhs: VariableLHS[~dev_data~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] left hand side expression in assignment: lhs: VariableLHS[~atmtcp_dev~0,] left hand side expression in assignment: lhs: VariableLHS[~dev_data~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev_data~2,],base],StructAccessExpression[IdentifierExpression[~dev_data~2,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~atmtcp_dev~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~atmtcp_dev~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~vcc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1435],StructAccessExpression[IdentifierExpression[~vcc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~head~1,] left hand side expression in assignment: lhs: VariableLHS[~____ptr~1,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~s~1,] left hand side expression in assignment: lhs: VariableLHS[~vcc~2,] left hand side expression in assignment: lhs: VariableLHS[~____ptr___0~1,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___0~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~10,] left hand side expression in assignment: lhs: VariableLHS[~s~1,] left hand side expression in assignment: lhs: VariableLHS[~result~0,] left hand side expression in assignment: lhs: VariableLHS[~dev~0,] left hand side expression in assignment: lhs: VariableLHS[~hdr~1,] left hand side expression in assignment: lhs: VariableLHS[~result~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~11,] left hand side expression in assignment: lhs: VariableLHS[~out_vcc~2,] left hand side expression in assignment: lhs: VariableLHS[~result~0,] left hand side expression in assignment: lhs: VariableLHS[~new_skb~1,] left hand side expression in assignment: lhs: VariableLHS[~result~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~dev_data~3,] left hand side expression in assignment: lhs: VariableLHS[~dev~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[90],StructAccessExpression[IdentifierExpression[~dev~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[91],StructAccessExpression[IdentifierExpression[~dev~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~dev~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem425,],base],StructAccessExpression[IdentifierExpression[#t~mem425,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem426,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem426,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~result,] left hand side expression in assignment: lhs: VariableLHS[~dev~2,] left hand side expression in assignment: lhs: VariableLHS[~dev~2,] left hand side expression in assignment: lhs: VariableLHS[~error~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem432,],base],StructAccessExpression[IdentifierExpression[#t~mem432,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~vcc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1254],StructAccessExpression[IdentifierExpression[~vcc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~vcc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1435],StructAccessExpression[IdentifierExpression[~vcc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~vcc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1451],StructAccessExpression[IdentifierExpression[~vcc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~24,] left hand side expression in assignment: lhs: VariableLHS[~dev~3,] left hand side expression in assignment: lhs: VariableLHS[~dev_data~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev_data~4,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~dev_data~4,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~25,] left hand side expression in assignment: lhs: VariableLHS[~vcc~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~7,] left hand side expression in assignment: lhs: VariableLHS[~err~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sock,],base],StructAccessExpression[IdentifierExpression[~sock,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~err~0,] left hand side expression in assignment: lhs: VariableLHS[~err~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~26,] left hand side expression in assignment: lhs: VariableLHS[~atmtcp_v_dev_ops_group0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~13,] left hand side expression in assignment: lhs: VariableLHS[~atmtcp_v_dev_ops_group1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~27,] left hand side expression in assignment: lhs: VariableLHS[~atmtcp_c_dev_ops_group0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~28,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~14,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~8,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~3,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~2,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg6~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~1,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg8~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg2~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~1,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~1,] 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___8~1,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~1,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~29,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] [2021-01-07 01:45:25,717 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-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--atm--atmtcp.ko-entry_point.cil.out.i[225078,225091] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp~30,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~15,] left hand side expression in assignment: lhs: VariableLHS[~ldv_module_refcounter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~module_get_succeeded~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_module_refcounter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_module_refcounter~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[230],StructAccessExpression[IdentifierExpression[~skb~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[238],StructAccessExpression[IdentifierExpression[~skb~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[222],StructAccessExpression[IdentifierExpression[~skb~1,],offset]]]] [2021-01-07 01:45:25,771 WARN L612 FunctionHandler]: implicit declaration of function ldv_xmalloc [2021-01-07 01:45:25,788 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 01:45:25,827 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: address: IdentifierExpression[~res,] left hand side expression in assignment: address: IdentifierExpression[~res,] left hand side expression in assignment: address: IdentifierExpression[~res,] left hand side expression in assignment: address: IdentifierExpression[~res,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: address: IdentifierExpression[~#tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] 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~3,] left hand side expression in assignment: lhs: VariableLHS[~p~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~p~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: lhs: VariableLHS[~sz~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~n,] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~skb,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~_________p1~0,] left hand side expression in assignment: lhs: VariableLHS[~________p1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#wait~0,],base],StructAccessExpression[IdentifierExpression[~#wait~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#wait~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#wait~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#wait~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~#wait~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#wait~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~#wait~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#wait~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~#wait~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~error~0,] left hand side expression in assignment: lhs: VariableLHS[~out_vcc~0,] left hand side expression in assignment: lhs: VariableLHS[~skb~0,] left hand side expression in assignment: lhs: VariableLHS[~out_vcc~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: VariableLHS[~new_msg~0,] left hand side expression in assignment: address: IdentifierExpression[~new_msg~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_msg~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~new_msg~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_msg~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~new_msg~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_msg~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~new_msg~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~old_test~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: lhs: VariableLHS[~out_vcc~0,] left hand side expression in assignment: lhs: VariableLHS[~error~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tmp___3~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11729],StructAccessExpression[IdentifierExpression[~tmp___3~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~__ret~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] 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[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tmp___9~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[11729],StructAccessExpression[IdentifierExpression[~tmp___9~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~__ret___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___11~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___12~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___13~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___14~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___15~0,] left hand side expression in assignment: lhs: VariableLHS[~vcc~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~vcc~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1232],StructAccessExpression[IdentifierExpression[~vcc~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~vcc~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1234],StructAccessExpression[IdentifierExpression[~vcc~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~vcc~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1262],StructAccessExpression[IdentifierExpression[~vcc~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tmp~15,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[914],StructAccessExpression[IdentifierExpression[~tmp~15,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: lhs: VariableLHS[~vpi~0,] left hand side expression in assignment: lhs: VariableLHS[~vci~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#msg~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~#msg~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#msg~0,],base],StructAccessExpression[IdentifierExpression[~#msg~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#msg~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~#msg~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#msg~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~#msg~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#msg~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[26],StructAccessExpression[IdentifierExpression[~#msg~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#msg~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#msg~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#msg~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[30],StructAccessExpression[IdentifierExpression[~#msg~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~error~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#msg~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~#msg~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#msg~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~#msg~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#msg~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[26],StructAccessExpression[IdentifierExpression[~#msg~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ci~0,],base],StructAccessExpression[IdentifierExpression[~#ci~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ci~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~#ci~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~head~0,] left hand side expression in assignment: lhs: VariableLHS[~____ptr~0,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: lhs: VariableLHS[~s~0,] left hand side expression in assignment: lhs: VariableLHS[~vcc~1,] left hand side expression in assignment: lhs: VariableLHS[~____ptr___0~0,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: lhs: VariableLHS[~s~0,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[90],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~out_vcc~1,] left hand side expression in assignment: lhs: VariableLHS[~dev_data~0,] left hand side expression in assignment: lhs: VariableLHS[~out_vcc~1,] left hand side expression in assignment: lhs: VariableLHS[~size~0,] left hand side expression in assignment: lhs: VariableLHS[~new_skb~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~hdr~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~hdr~0,],base],StructAccessExpression[IdentifierExpression[~hdr~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~5,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~hdr~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~hdr~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~hdr~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~hdr~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] left hand side expression in assignment: lhs: VariableLHS[~dev_data~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] left hand side expression in assignment: lhs: VariableLHS[~atmtcp_dev~0,] left hand side expression in assignment: lhs: VariableLHS[~dev_data~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev_data~2,],base],StructAccessExpression[IdentifierExpression[~dev_data~2,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~atmtcp_dev~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~atmtcp_dev~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~vcc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1435],StructAccessExpression[IdentifierExpression[~vcc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~head~1,] left hand side expression in assignment: lhs: VariableLHS[~____ptr~1,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~s~1,] left hand side expression in assignment: lhs: VariableLHS[~vcc~2,] left hand side expression in assignment: lhs: VariableLHS[~____ptr___0~1,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___0~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~10,] left hand side expression in assignment: lhs: VariableLHS[~s~1,] left hand side expression in assignment: lhs: VariableLHS[~result~0,] left hand side expression in assignment: lhs: VariableLHS[~dev~0,] left hand side expression in assignment: lhs: VariableLHS[~hdr~1,] left hand side expression in assignment: lhs: VariableLHS[~result~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~11,] left hand side expression in assignment: lhs: VariableLHS[~out_vcc~2,] left hand side expression in assignment: lhs: VariableLHS[~result~0,] left hand side expression in assignment: lhs: VariableLHS[~new_skb~1,] left hand side expression in assignment: lhs: VariableLHS[~result~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~dev_data~3,] left hand side expression in assignment: lhs: VariableLHS[~dev~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[90],StructAccessExpression[IdentifierExpression[~dev~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[91],StructAccessExpression[IdentifierExpression[~dev~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~dev~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem440,],base],StructAccessExpression[IdentifierExpression[#t~mem440,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem441,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem441,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~result,] left hand side expression in assignment: address: IdentifierExpression[~#dev~2,] left hand side expression in assignment: address: IdentifierExpression[~#dev~2,] left hand side expression in assignment: lhs: VariableLHS[~error~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem453,],base],StructAccessExpression[IdentifierExpression[#t~mem453,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~vcc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1254],StructAccessExpression[IdentifierExpression[~vcc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~vcc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1435],StructAccessExpression[IdentifierExpression[~vcc,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~vcc,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1451],StructAccessExpression[IdentifierExpression[~vcc,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~24,] left hand side expression in assignment: lhs: VariableLHS[~dev~3,] left hand side expression in assignment: lhs: VariableLHS[~dev_data~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev_data~4,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~dev_data~4,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~25,] left hand side expression in assignment: lhs: VariableLHS[~vcc~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~7,] left hand side expression in assignment: lhs: VariableLHS[~err~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sock,],base],StructAccessExpression[IdentifierExpression[~sock,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~err~0,] left hand side expression in assignment: lhs: VariableLHS[~err~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~26,] left hand side expression in assignment: lhs: VariableLHS[~atmtcp_v_dev_ops_group0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~13,] left hand side expression in assignment: lhs: VariableLHS[~atmtcp_v_dev_ops_group1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~27,] left hand side expression in assignment: lhs: VariableLHS[~atmtcp_c_dev_ops_group0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~28,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~14,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~8,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~3,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~2,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg6~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~1,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg8~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg2~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~1,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~1,] 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___8~1,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~1,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~29,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] [2021-01-07 01:45:26,182 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-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--atm--atmtcp.ko-entry_point.cil.out.i[225078,225091] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp~30,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~15,] left hand side expression in assignment: lhs: VariableLHS[~ldv_module_refcounter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~module_get_succeeded~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_module_refcounter~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_module_refcounter~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[230],StructAccessExpression[IdentifierExpression[~skb~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[238],StructAccessExpression[IdentifierExpression[~skb~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~skb~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[222],StructAccessExpression[IdentifierExpression[~skb~1,],offset]]]] [2021-01-07 01:45:26,190 WARN L612 FunctionHandler]: implicit declaration of function ldv_xmalloc [2021-01-07 01:45:26,194 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 01:45:26,367 INFO L208 MainTranslator]: Completed translation [2021-01-07 01:45:26,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:45:26 WrapperNode [2021-01-07 01:45:26,368 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 01:45:26,370 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 01:45:26,370 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 01:45:26,370 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 01:45:26,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:45:26" (1/1) ... [2021-01-07 01:45:26,438 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:45:26" (1/1) ... [2021-01-07 01:45:26,942 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 01:45:26,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 01:45:26,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 01:45:26,944 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 01:45:26,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:45:26" (1/1) ... [2021-01-07 01:45:26,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:45:26" (1/1) ... [2021-01-07 01:45:27,193 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:45:26" (1/1) ... [2021-01-07 01:45:27,194 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:45:26" (1/1) ... [2021-01-07 01:45:27,570 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:45:26" (1/1) ... [2021-01-07 01:45:27,615 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:45:26" (1/1) ... [2021-01-07 01:45:27,650 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:45:26" (1/1) ... [2021-01-07 01:45:27,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 01:45:27,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 01:45:27,701 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 01:45:27,701 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 01:45:27,702 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:45:26" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 01:45:27,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-01-07 01:45:27,901 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2021-01-07 01:45:27,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-01-07 01:45:27,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-01-07 01:45:27,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 01:45:27,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 01:45:27,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 01:45:27,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 01:45:27,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 01:45:27,905 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-01-07 01:45:27,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 01:45:27,905 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2021-01-07 01:45:27,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 01:45:27,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-01-07 01:45:27,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 01:45:27,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-01-07 01:45:27,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 01:45:27,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 01:46:18,606 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 01:46:18,608 INFO L299 CfgBuilder]: Removed 1124 assume(true) statements. [2021-01-07 01:46:18,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 01:46:18 BoogieIcfgContainer [2021-01-07 01:46:18,615 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 01:46:18,619 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 01:46:18,620 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 01:46:18,624 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 01:46:18,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 01:45:24" (1/3) ... [2021-01-07 01:46:18,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@412280d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 01:46:18, skipping insertion in model container [2021-01-07 01:46:18,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:45:26" (2/3) ... [2021-01-07 01:46:18,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@412280d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 01:46:18, skipping insertion in model container [2021-01-07 01:46:18,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 01:46:18" (3/3) ... [2021-01-07 01:46:18,629 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--atm--atmtcp.ko-entry_point.cil.out.i [2021-01-07 01:46:18,636 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 01:46:18,644 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2021-01-07 01:46:18,667 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-01-07 01:46:18,722 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 01:46:18,723 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-07 01:46:18,723 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 01:46:18,723 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 01:46:18,723 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 01:46:18,724 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 01:46:18,724 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 01:46:18,724 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 01:46:18,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states. [2021-01-07 01:46:18,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-01-07 01:46:18,795 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:46:18,796 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:46:18,796 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:46:18,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:46:18,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1301306874, now seen corresponding path program 1 times [2021-01-07 01:46:18,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:46:18,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261880039] [2021-01-07 01:46:18,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:46:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:46:19,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:46:19,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261880039] [2021-01-07 01:46:19,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:46:19,506 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 01:46:19,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310712572] [2021-01-07 01:46:19,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-07 01:46:19,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:46:19,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-07 01:46:19,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 01:46:19,537 INFO L87 Difference]: Start difference. First operand 1596 states. Second operand 2 states. [2021-01-07 01:46:19,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:46:19,702 INFO L93 Difference]: Finished difference Result 3188 states and 4813 transitions. [2021-01-07 01:46:19,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-07 01:46:19,704 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 42 [2021-01-07 01:46:19,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:46:19,743 INFO L225 Difference]: With dead ends: 3188 [2021-01-07 01:46:19,743 INFO L226 Difference]: Without dead ends: 1583 [2021-01-07 01:46:19,760 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 01:46:19,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2021-01-07 01:46:19,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1583. [2021-01-07 01:46:19,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2021-01-07 01:46:19,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2347 transitions. [2021-01-07 01:46:19,923 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2347 transitions. Word has length 42 [2021-01-07 01:46:19,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:46:19,923 INFO L481 AbstractCegarLoop]: Abstraction has 1583 states and 2347 transitions. [2021-01-07 01:46:19,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-07 01:46:19,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2347 transitions. [2021-01-07 01:46:19,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-01-07 01:46:19,927 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:46:19,927 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:46:19,928 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 01:46:19,928 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:46:19,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:46:19,931 INFO L82 PathProgramCache]: Analyzing trace with hash -568676220, now seen corresponding path program 1 times [2021-01-07 01:46:19,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:46:19,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447476189] [2021-01-07 01:46:19,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:46:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:46:20,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:46:20,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447476189] [2021-01-07 01:46:20,214 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:46:20,214 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:46:20,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940664667] [2021-01-07 01:46:20,216 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:46:20,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:46:20,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:46:20,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:46:20,218 INFO L87 Difference]: Start difference. First operand 1583 states and 2347 transitions. Second operand 3 states. [2021-01-07 01:46:20,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:46:20,469 INFO L93 Difference]: Finished difference Result 4676 states and 6964 transitions. [2021-01-07 01:46:20,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:46:20,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2021-01-07 01:46:20,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:46:20,491 INFO L225 Difference]: With dead ends: 4676 [2021-01-07 01:46:20,491 INFO L226 Difference]: Without dead ends: 3126 [2021-01-07 01:46:20,496 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:46:20,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3126 states. [2021-01-07 01:46:20,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3126 to 3116. [2021-01-07 01:46:20,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2021-01-07 01:46:20,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 4644 transitions. [2021-01-07 01:46:20,608 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 4644 transitions. Word has length 42 [2021-01-07 01:46:20,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:46:20,609 INFO L481 AbstractCegarLoop]: Abstraction has 3116 states and 4644 transitions. [2021-01-07 01:46:20,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:46:20,610 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 4644 transitions. [2021-01-07 01:46:20,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-01-07 01:46:20,620 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:46:20,620 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:46:20,621 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 01:46:20,621 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:46:20,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:46:20,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1340666122, now seen corresponding path program 1 times [2021-01-07 01:46:20,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:46:20,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881735428] [2021-01-07 01:46:20,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:46:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:46:20,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:46:20,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881735428] [2021-01-07 01:46:20,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:46:20,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 01:46:20,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630607727] [2021-01-07 01:46:20,896 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:46:20,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:46:20,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:46:20,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:46:20,902 INFO L87 Difference]: Start difference. First operand 3116 states and 4644 transitions. Second operand 4 states. [2021-01-07 01:46:21,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:46:21,183 INFO L93 Difference]: Finished difference Result 6208 states and 9256 transitions. [2021-01-07 01:46:21,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 01:46:21,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2021-01-07 01:46:21,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:46:21,202 INFO L225 Difference]: With dead ends: 6208 [2021-01-07 01:46:21,202 INFO L226 Difference]: Without dead ends: 3125 [2021-01-07 01:46:21,209 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:46:21,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3125 states. [2021-01-07 01:46:21,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3125 to 3115. [2021-01-07 01:46:21,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2021-01-07 01:46:21,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 4640 transitions. [2021-01-07 01:46:21,322 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 4640 transitions. Word has length 46 [2021-01-07 01:46:21,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:46:21,322 INFO L481 AbstractCegarLoop]: Abstraction has 3115 states and 4640 transitions. [2021-01-07 01:46:21,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:46:21,323 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 4640 transitions. [2021-01-07 01:46:21,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-01-07 01:46:21,325 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:46:21,325 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:46:21,325 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 01:46:21,325 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:46:21,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:46:21,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1163448145, now seen corresponding path program 1 times [2021-01-07 01:46:21,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:46:21,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180524743] [2021-01-07 01:46:21,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:46:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:46:21,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:46:21,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180524743] [2021-01-07 01:46:21,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:46:21,664 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:46:21,666 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027590406] [2021-01-07 01:46:21,667 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:46:21,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:46:21,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:46:21,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:46:21,668 INFO L87 Difference]: Start difference. First operand 3115 states and 4640 transitions. Second operand 3 states. [2021-01-07 01:46:21,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:46:21,822 INFO L93 Difference]: Finished difference Result 5883 states and 8808 transitions. [2021-01-07 01:46:21,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:46:21,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2021-01-07 01:46:21,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:46:21,838 INFO L225 Difference]: With dead ends: 5883 [2021-01-07 01:46:21,838 INFO L226 Difference]: Without dead ends: 2801 [2021-01-07 01:46:21,845 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:46:21,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2801 states. [2021-01-07 01:46:21,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2801 to 2801. [2021-01-07 01:46:21,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2801 states. [2021-01-07 01:46:21,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2801 states to 2801 states and 4201 transitions. [2021-01-07 01:46:21,945 INFO L78 Accepts]: Start accepts. Automaton has 2801 states and 4201 transitions. Word has length 49 [2021-01-07 01:46:21,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:46:21,945 INFO L481 AbstractCegarLoop]: Abstraction has 2801 states and 4201 transitions. [2021-01-07 01:46:21,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:46:21,945 INFO L276 IsEmpty]: Start isEmpty. Operand 2801 states and 4201 transitions. [2021-01-07 01:46:21,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-01-07 01:46:21,947 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:46:21,947 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:46:21,947 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-07 01:46:21,948 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:46:21,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:46:21,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1670408081, now seen corresponding path program 1 times [2021-01-07 01:46:21,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:46:21,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587557940] [2021-01-07 01:46:21,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:46:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:46:22,180 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-07 01:46:22,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587557940] [2021-01-07 01:46:22,180 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:46:22,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 01:46:22,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740027718] [2021-01-07 01:46:22,181 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:46:22,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:46:22,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:46:22,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:46:22,183 INFO L87 Difference]: Start difference. First operand 2801 states and 4201 transitions. Second operand 3 states. [2021-01-07 01:46:22,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:46:22,469 INFO L93 Difference]: Finished difference Result 8327 states and 12524 transitions. [2021-01-07 01:46:22,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:46:22,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2021-01-07 01:46:22,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:46:22,500 INFO L225 Difference]: With dead ends: 8327 [2021-01-07 01:46:22,501 INFO L226 Difference]: Without dead ends: 5557 [2021-01-07 01:46:22,508 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:46:22,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5557 states. [2021-01-07 01:46:22,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5557 to 5545. [2021-01-07 01:46:22,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5545 states. [2021-01-07 01:46:22,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5545 states to 5545 states and 8339 transitions. [2021-01-07 01:46:22,728 INFO L78 Accepts]: Start accepts. Automaton has 5545 states and 8339 transitions. Word has length 53 [2021-01-07 01:46:22,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:46:22,730 INFO L481 AbstractCegarLoop]: Abstraction has 5545 states and 8339 transitions. [2021-01-07 01:46:22,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:46:22,731 INFO L276 IsEmpty]: Start isEmpty. Operand 5545 states and 8339 transitions. [2021-01-07 01:46:22,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-07 01:46:22,734 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:46:22,735 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:46:22,735 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-07 01:46:22,735 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:46:22,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:46:22,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1632205903, now seen corresponding path program 1 times [2021-01-07 01:46:22,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:46:22,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866561741] [2021-01-07 01:46:22,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:46:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:46:22,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:46:22,957 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866561741] [2021-01-07 01:46:22,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:46:22,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:46:22,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424370368] [2021-01-07 01:46:22,960 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:46:22,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:46:22,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:46:22,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:46:22,962 INFO L87 Difference]: Start difference. First operand 5545 states and 8339 transitions. Second operand 3 states. [2021-01-07 01:46:23,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:46:23,208 INFO L93 Difference]: Finished difference Result 9907 states and 14908 transitions. [2021-01-07 01:46:23,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:46:23,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2021-01-07 01:46:23,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:46:23,233 INFO L225 Difference]: With dead ends: 9907 [2021-01-07 01:46:23,234 INFO L226 Difference]: Without dead ends: 4395 [2021-01-07 01:46:23,248 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:46:23,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4395 states. [2021-01-07 01:46:23,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4395 to 4385. [2021-01-07 01:46:23,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4385 states. [2021-01-07 01:46:23,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4385 states to 4385 states and 6592 transitions. [2021-01-07 01:46:23,422 INFO L78 Accepts]: Start accepts. Automaton has 4385 states and 6592 transitions. Word has length 63 [2021-01-07 01:46:23,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:46:23,424 INFO L481 AbstractCegarLoop]: Abstraction has 4385 states and 6592 transitions. [2021-01-07 01:46:23,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:46:23,424 INFO L276 IsEmpty]: Start isEmpty. Operand 4385 states and 6592 transitions. [2021-01-07 01:46:23,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-07 01:46:23,427 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:46:23,427 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:46:23,427 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-07 01:46:23,427 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:46:23,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:46:23,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1272537246, now seen corresponding path program 1 times [2021-01-07 01:46:23,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:46:23,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874923860] [2021-01-07 01:46:23,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:46:23,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:46:23,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 01:46:23,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874923860] [2021-01-07 01:46:23,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:46:23,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 01:46:23,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048565067] [2021-01-07 01:46:23,700 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:46:23,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:46:23,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:46:23,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:46:23,701 INFO L87 Difference]: Start difference. First operand 4385 states and 6592 transitions. Second operand 4 states. [2021-01-07 01:46:42,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:46:42,237 INFO L93 Difference]: Finished difference Result 8271 states and 12431 transitions. [2021-01-07 01:46:42,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 01:46:42,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2021-01-07 01:46:42,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:46:42,288 INFO L225 Difference]: With dead ends: 8271 [2021-01-07 01:46:42,289 INFO L226 Difference]: Without dead ends: 4447 [2021-01-07 01:46:42,302 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:46:42,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4447 states. [2021-01-07 01:46:42,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4447 to 4389. [2021-01-07 01:46:42,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4389 states. [2021-01-07 01:46:42,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4389 states to 4389 states and 6596 transitions. [2021-01-07 01:46:42,457 INFO L78 Accepts]: Start accepts. Automaton has 4389 states and 6596 transitions. Word has length 74 [2021-01-07 01:46:42,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:46:42,459 INFO L481 AbstractCegarLoop]: Abstraction has 4389 states and 6596 transitions. [2021-01-07 01:46:42,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:46:42,459 INFO L276 IsEmpty]: Start isEmpty. Operand 4389 states and 6596 transitions. [2021-01-07 01:46:42,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-01-07 01:46:42,462 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:46:42,463 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:46:42,463 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-07 01:46:42,463 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:46:42,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:46:42,464 INFO L82 PathProgramCache]: Analyzing trace with hash 510540193, now seen corresponding path program 1 times [2021-01-07 01:46:42,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:46:42,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809497691] [2021-01-07 01:46:42,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:46:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:46:42,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 01:46:42,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809497691] [2021-01-07 01:46:42,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:46:42,840 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 01:46:42,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716813193] [2021-01-07 01:46:42,840 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 01:46:42,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:46:42,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 01:46:42,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 01:46:42,842 INFO L87 Difference]: Start difference. First operand 4389 states and 6596 transitions. Second operand 6 states. [2021-01-07 01:47:16,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:47:16,863 INFO L93 Difference]: Finished difference Result 18133 states and 27294 transitions. [2021-01-07 01:47:16,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-07 01:47:16,864 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2021-01-07 01:47:16,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:47:16,903 INFO L225 Difference]: With dead ends: 18133 [2021-01-07 01:47:16,903 INFO L226 Difference]: Without dead ends: 14305 [2021-01-07 01:47:16,913 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-01-07 01:47:16,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14305 states. [2021-01-07 01:47:17,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14305 to 4393. [2021-01-07 01:47:17,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4393 states. [2021-01-07 01:47:17,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4393 states to 4393 states and 6600 transitions. [2021-01-07 01:47:17,169 INFO L78 Accepts]: Start accepts. Automaton has 4393 states and 6600 transitions. Word has length 77 [2021-01-07 01:47:17,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:47:17,169 INFO L481 AbstractCegarLoop]: Abstraction has 4393 states and 6600 transitions. [2021-01-07 01:47:17,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 01:47:17,169 INFO L276 IsEmpty]: Start isEmpty. Operand 4393 states and 6600 transitions. [2021-01-07 01:47:17,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-01-07 01:47:17,172 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:47:17,172 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:47:17,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-07 01:47:17,173 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:47:17,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:47:17,173 INFO L82 PathProgramCache]: Analyzing trace with hash -337844584, now seen corresponding path program 1 times [2021-01-07 01:47:17,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:47:17,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279828651] [2021-01-07 01:47:17,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:47:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:47:17,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 01:47:17,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279828651] [2021-01-07 01:47:17,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:47:17,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 01:47:17,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463201395] [2021-01-07 01:47:17,438 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 01:47:17,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:47:17,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 01:47:17,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:47:17,444 INFO L87 Difference]: Start difference. First operand 4393 states and 6600 transitions. Second operand 5 states. [2021-01-07 01:47:19,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:47:19,753 INFO L93 Difference]: Finished difference Result 27029 states and 40638 transitions. [2021-01-07 01:47:19,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 01:47:19,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2021-01-07 01:47:19,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:47:19,818 INFO L225 Difference]: With dead ends: 27029 [2021-01-07 01:47:19,819 INFO L226 Difference]: Without dead ends: 23197 [2021-01-07 01:47:19,835 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-07 01:47:19,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23197 states. [2021-01-07 01:47:20,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23197 to 4399. [2021-01-07 01:47:20,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4399 states. [2021-01-07 01:47:20,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4399 states to 4399 states and 6606 transitions. [2021-01-07 01:47:20,216 INFO L78 Accepts]: Start accepts. Automaton has 4399 states and 6606 transitions. Word has length 77 [2021-01-07 01:47:20,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:47:20,216 INFO L481 AbstractCegarLoop]: Abstraction has 4399 states and 6606 transitions. [2021-01-07 01:47:20,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 01:47:20,216 INFO L276 IsEmpty]: Start isEmpty. Operand 4399 states and 6606 transitions. [2021-01-07 01:47:20,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-01-07 01:47:20,219 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:47:20,219 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:47:20,220 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-07 01:47:20,220 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:47:20,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:47:20,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1910819619, now seen corresponding path program 1 times [2021-01-07 01:47:20,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:47:20,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345829354] [2021-01-07 01:47:20,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:47:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:47:20,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 01:47:20,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345829354] [2021-01-07 01:47:20,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:47:20,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:47:20,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277695463] [2021-01-07 01:47:20,550 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:47:20,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:47:20,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:47:20,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:47:20,551 INFO L87 Difference]: Start difference. First operand 4399 states and 6606 transitions. Second operand 3 states. [2021-01-07 01:47:21,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:47:21,063 INFO L93 Difference]: Finished difference Result 8807 states and 13257 transitions. [2021-01-07 01:47:21,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:47:21,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2021-01-07 01:47:21,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:47:21,073 INFO L225 Difference]: With dead ends: 8807 [2021-01-07 01:47:21,074 INFO L226 Difference]: Without dead ends: 4436 [2021-01-07 01:47:21,082 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:47:21,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4436 states. [2021-01-07 01:47:21,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4436 to 4436. [2021-01-07 01:47:21,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4436 states. [2021-01-07 01:47:21,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4436 states to 4436 states and 6643 transitions. [2021-01-07 01:47:21,310 INFO L78 Accepts]: Start accepts. Automaton has 4436 states and 6643 transitions. Word has length 79 [2021-01-07 01:47:21,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:47:21,311 INFO L481 AbstractCegarLoop]: Abstraction has 4436 states and 6643 transitions. [2021-01-07 01:47:21,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:47:21,311 INFO L276 IsEmpty]: Start isEmpty. Operand 4436 states and 6643 transitions. [2021-01-07 01:47:21,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-01-07 01:47:21,314 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:47:21,314 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:47:21,314 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-07 01:47:21,314 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:47:21,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:47:21,315 INFO L82 PathProgramCache]: Analyzing trace with hash -2022075563, now seen corresponding path program 1 times [2021-01-07 01:47:21,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:47:21,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237643937] [2021-01-07 01:47:21,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:47:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:47:21,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 01:47:21,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237643937] [2021-01-07 01:47:21,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717242070] [2021-01-07 01:47:21,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:47:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:47:22,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 1918 conjuncts, 15 conjunts are in the unsatisfiable core [2021-01-07 01:47:22,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:47:22,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 01:47:22,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:47:22,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-01-07 01:47:22,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522078927] [2021-01-07 01:47:22,962 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 01:47:22,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:47:22,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 01:47:22,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-07 01:47:22,963 INFO L87 Difference]: Start difference. First operand 4436 states and 6643 transitions. Second operand 6 states. [2021-01-07 01:47:23,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:47:23,918 INFO L93 Difference]: Finished difference Result 8880 states and 13330 transitions. [2021-01-07 01:47:23,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 01:47:23,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2021-01-07 01:47:23,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:47:23,930 INFO L225 Difference]: With dead ends: 8880 [2021-01-07 01:47:23,931 INFO L226 Difference]: Without dead ends: 4473 [2021-01-07 01:47:23,938 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-01-07 01:47:23,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4473 states. [2021-01-07 01:47:24,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4473 to 4473. [2021-01-07 01:47:24,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4473 states. [2021-01-07 01:47:24,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4473 states to 4473 states and 6680 transitions. [2021-01-07 01:47:24,200 INFO L78 Accepts]: Start accepts. Automaton has 4473 states and 6680 transitions. Word has length 80 [2021-01-07 01:47:24,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:47:24,201 INFO L481 AbstractCegarLoop]: Abstraction has 4473 states and 6680 transitions. [2021-01-07 01:47:24,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 01:47:24,201 INFO L276 IsEmpty]: Start isEmpty. Operand 4473 states and 6680 transitions. [2021-01-07 01:47:24,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-01-07 01:47:24,204 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:47:24,204 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:47:24,417 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-01-07 01:47:24,418 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:47:24,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:47:24,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1176042531, now seen corresponding path program 2 times [2021-01-07 01:47:24,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:47:24,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906382873] [2021-01-07 01:47:24,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:47:24,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:47:24,815 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 01:47:24,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906382873] [2021-01-07 01:47:24,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154313211] [2021-01-07 01:47:24,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:47:25,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-01-07 01:47:25,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 01:47:25,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 1871 conjuncts, 12 conjunts are in the unsatisfiable core [2021-01-07 01:47:25,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:47:26,068 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-07 01:47:26,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 01:47:26,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-01-07 01:47:26,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406582221] [2021-01-07 01:47:26,070 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:47:26,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:47:26,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:47:26,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 01:47:26,071 INFO L87 Difference]: Start difference. First operand 4473 states and 6680 transitions. Second operand 3 states. [2021-01-07 01:47:26,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:47:26,803 INFO L93 Difference]: Finished difference Result 8914 states and 13327 transitions. [2021-01-07 01:47:26,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:47:26,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2021-01-07 01:47:26,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:47:26,814 INFO L225 Difference]: With dead ends: 8914 [2021-01-07 01:47:26,814 INFO L226 Difference]: Without dead ends: 4474 [2021-01-07 01:47:26,822 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 01:47:26,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4474 states. [2021-01-07 01:47:27,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4474 to 4474. [2021-01-07 01:47:27,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4474 states. [2021-01-07 01:47:27,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4474 states to 4474 states and 6681 transitions. [2021-01-07 01:47:27,080 INFO L78 Accepts]: Start accepts. Automaton has 4474 states and 6681 transitions. Word has length 81 [2021-01-07 01:47:27,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:47:27,081 INFO L481 AbstractCegarLoop]: Abstraction has 4474 states and 6681 transitions. [2021-01-07 01:47:27,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:47:27,081 INFO L276 IsEmpty]: Start isEmpty. Operand 4474 states and 6681 transitions. [2021-01-07 01:47:27,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-01-07 01:47:27,084 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:47:27,084 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:47:27,300 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-01-07 01:47:27,300 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:47:27,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:47:27,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1727328237, now seen corresponding path program 1 times [2021-01-07 01:47:27,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:47:27,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702850485] [2021-01-07 01:47:27,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:47:27,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:47:27,657 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 01:47:27,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702850485] [2021-01-07 01:47:27,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886357114] [2021-01-07 01:47:27,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:47:28,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:47:28,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 1930 conjuncts, 16 conjunts are in the unsatisfiable core [2021-01-07 01:47:28,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:47:28,770 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 01:47:28,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:47:28,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-01-07 01:47:28,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176803273] [2021-01-07 01:47:28,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 01:47:28,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:47:28,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 01:47:28,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 01:47:28,772 INFO L87 Difference]: Start difference. First operand 4474 states and 6681 transitions. Second operand 8 states. [2021-01-07 01:47:29,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:47:29,889 INFO L93 Difference]: Finished difference Result 8955 states and 13405 transitions. [2021-01-07 01:47:29,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 01:47:29,890 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2021-01-07 01:47:29,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:47:29,902 INFO L225 Difference]: With dead ends: 8955 [2021-01-07 01:47:29,902 INFO L226 Difference]: Without dead ends: 4511 [2021-01-07 01:47:29,910 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-01-07 01:47:29,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4511 states. [2021-01-07 01:47:30,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4511 to 4511. [2021-01-07 01:47:30,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4511 states. [2021-01-07 01:47:30,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4511 states to 4511 states and 6718 transitions. [2021-01-07 01:47:30,168 INFO L78 Accepts]: Start accepts. Automaton has 4511 states and 6718 transitions. Word has length 82 [2021-01-07 01:47:30,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:47:30,168 INFO L481 AbstractCegarLoop]: Abstraction has 4511 states and 6718 transitions. [2021-01-07 01:47:30,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 01:47:30,169 INFO L276 IsEmpty]: Start isEmpty. Operand 4511 states and 6718 transitions. [2021-01-07 01:47:30,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-01-07 01:47:30,174 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:47:30,174 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:47:30,387 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-01-07 01:47:30,388 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:47:30,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:47:30,389 INFO L82 PathProgramCache]: Analyzing trace with hash -438403429, now seen corresponding path program 2 times [2021-01-07 01:47:30,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:47:30,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886117060] [2021-01-07 01:47:30,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:47:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:47:30,786 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 01:47:30,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886117060] [2021-01-07 01:47:30,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997465695] [2021-01-07 01:47:30,787 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 [2021-01-07 01:47:33,037 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-07 01:47:33,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 01:47:33,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 1936 conjuncts, 17 conjunts are in the unsatisfiable core [2021-01-07 01:47:33,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:47:33,349 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 01:47:33,349 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:47:33,349 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-01-07 01:47:33,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077089095] [2021-01-07 01:47:33,350 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 01:47:33,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:47:33,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 01:47:33,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-01-07 01:47:33,353 INFO L87 Difference]: Start difference. First operand 4511 states and 6718 transitions. Second operand 10 states. [2021-01-07 01:47:34,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:47:34,687 INFO L93 Difference]: Finished difference Result 9028 states and 13478 transitions. [2021-01-07 01:47:34,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 01:47:34,688 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 83 [2021-01-07 01:47:34,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:47:34,700 INFO L225 Difference]: With dead ends: 9028 [2021-01-07 01:47:34,700 INFO L226 Difference]: Without dead ends: 4548 [2021-01-07 01:47:34,708 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2021-01-07 01:47:34,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4548 states. [2021-01-07 01:47:34,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4548 to 4548. [2021-01-07 01:47:34,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4548 states. [2021-01-07 01:47:34,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4548 states to 4548 states and 6755 transitions. [2021-01-07 01:47:34,965 INFO L78 Accepts]: Start accepts. Automaton has 4548 states and 6755 transitions. Word has length 83 [2021-01-07 01:47:34,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:47:34,965 INFO L481 AbstractCegarLoop]: Abstraction has 4548 states and 6755 transitions. [2021-01-07 01:47:34,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 01:47:34,965 INFO L276 IsEmpty]: Start isEmpty. Operand 4548 states and 6755 transitions. [2021-01-07 01:47:34,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-01-07 01:47:34,971 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:47:34,971 INFO L422 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:47:35,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:47:35,172 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:47:35,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:47:35,173 INFO L82 PathProgramCache]: Analyzing trace with hash 863559955, now seen corresponding path program 3 times [2021-01-07 01:47:35,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:47:35,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149221009] [2021-01-07 01:47:35,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:47:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:47:35,644 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 01:47:35,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149221009] [2021-01-07 01:47:35,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099749871] [2021-01-07 01:47:35,645 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 [2021-01-07 01:47:37,459 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-01-07 01:47:37,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 01:47:37,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 1930 conjuncts, 11 conjunts are in the unsatisfiable core [2021-01-07 01:47:37,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:47:37,639 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-07 01:47:37,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:47:37,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2021-01-07 01:47:37,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718633215] [2021-01-07 01:47:37,640 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 01:47:37,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:47:37,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 01:47:37,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-07 01:47:37,641 INFO L87 Difference]: Start difference. First operand 4548 states and 6755 transitions. Second operand 9 states. [2021-01-07 01:47:50,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:47:50,997 INFO L93 Difference]: Finished difference Result 9102 states and 13553 transitions. [2021-01-07 01:47:50,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-07 01:47:50,997 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2021-01-07 01:47:50,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:47:51,010 INFO L225 Difference]: With dead ends: 9102 [2021-01-07 01:47:51,010 INFO L226 Difference]: Without dead ends: 4586 [2021-01-07 01:47:51,020 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-01-07 01:47:51,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4586 states. [2021-01-07 01:47:51,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4586 to 4586. [2021-01-07 01:47:51,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4586 states. [2021-01-07 01:47:51,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4586 states to 4586 states and 6793 transitions. [2021-01-07 01:47:51,280 INFO L78 Accepts]: Start accepts. Automaton has 4586 states and 6793 transitions. Word has length 84 [2021-01-07 01:47:51,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:47:51,280 INFO L481 AbstractCegarLoop]: Abstraction has 4586 states and 6793 transitions. [2021-01-07 01:47:51,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 01:47:51,280 INFO L276 IsEmpty]: Start isEmpty. Operand 4586 states and 6793 transitions. [2021-01-07 01:47:51,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-01-07 01:47:51,286 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:47:51,286 INFO L422 BasicCegarLoop]: trace histogram [5, 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] [2021-01-07 01:47:51,499 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-01-07 01:47:51,500 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:47:51,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:47:51,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1572831723, now seen corresponding path program 4 times [2021-01-07 01:47:51,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:47:51,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547664081] [2021-01-07 01:47:51,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:47:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:47:52,010 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-07 01:47:52,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547664081] [2021-01-07 01:47:52,011 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884527228] [2021-01-07 01:47:52,011 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:47:53,305 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-01-07 01:47:53,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 01:47:53,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 1954 conjuncts, 24 conjunts are in the unsatisfiable core [2021-01-07 01:47:53,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:47:53,805 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-07 01:47:53,809 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:47:53,809 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-01-07 01:47:53,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509756583] [2021-01-07 01:47:53,810 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-07 01:47:53,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:47:53,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-07 01:47:53,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-01-07 01:47:53,811 INFO L87 Difference]: Start difference. First operand 4586 states and 6793 transitions. Second operand 14 states. [2021-01-07 01:48:31,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:48:31,962 INFO L93 Difference]: Finished difference Result 9176 states and 13626 transitions. [2021-01-07 01:48:31,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-07 01:48:31,963 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 86 [2021-01-07 01:48:31,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:48:31,972 INFO L225 Difference]: With dead ends: 9176 [2021-01-07 01:48:31,972 INFO L226 Difference]: Without dead ends: 4623 [2021-01-07 01:48:31,980 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2021-01-07 01:48:31,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4623 states. [2021-01-07 01:48:32,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4623 to 4623. [2021-01-07 01:48:32,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4623 states. [2021-01-07 01:48:32,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4623 states to 4623 states and 6830 transitions. [2021-01-07 01:48:32,223 INFO L78 Accepts]: Start accepts. Automaton has 4623 states and 6830 transitions. Word has length 86 [2021-01-07 01:48:32,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:48:32,224 INFO L481 AbstractCegarLoop]: Abstraction has 4623 states and 6830 transitions. [2021-01-07 01:48:32,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-07 01:48:32,224 INFO L276 IsEmpty]: Start isEmpty. Operand 4623 states and 6830 transitions. [2021-01-07 01:48:32,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-07 01:48:32,228 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:48:32,228 INFO L422 BasicCegarLoop]: trace histogram [6, 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] [2021-01-07 01:48:32,441 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:48:32,442 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:48:32,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:48:32,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1663658141, now seen corresponding path program 5 times [2021-01-07 01:48:32,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:48:32,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95202519] [2021-01-07 01:48:32,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:48:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:48:33,048 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-07 01:48:33,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95202519] [2021-01-07 01:48:33,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345048365] [2021-01-07 01:48:33,049 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:48:34,299 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-01-07 01:48:34,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 01:48:34,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 1960 conjuncts, 22 conjunts are in the unsatisfiable core [2021-01-07 01:48:34,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:48:34,799 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-07 01:48:34,799 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:48:34,799 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-01-07 01:48:34,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018191398] [2021-01-07 01:48:34,800 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-07 01:48:34,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:48:34,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-07 01:48:34,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2021-01-07 01:48:34,801 INFO L87 Difference]: Start difference. First operand 4623 states and 6830 transitions. Second operand 16 states. [2021-01-07 01:49:01,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:49:01,256 INFO L93 Difference]: Finished difference Result 9250 states and 13701 transitions. [2021-01-07 01:49:01,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-07 01:49:01,262 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 87 [2021-01-07 01:49:01,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:49:01,268 INFO L225 Difference]: With dead ends: 9250 [2021-01-07 01:49:01,269 INFO L226 Difference]: Without dead ends: 4661 [2021-01-07 01:49:01,275 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=150, Invalid=312, Unknown=0, NotChecked=0, Total=462 [2021-01-07 01:49:01,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4661 states. [2021-01-07 01:49:01,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4661 to 4661. [2021-01-07 01:49:01,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4661 states. [2021-01-07 01:49:01,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4661 states to 4661 states and 6868 transitions. [2021-01-07 01:49:01,603 INFO L78 Accepts]: Start accepts. Automaton has 4661 states and 6868 transitions. Word has length 87 [2021-01-07 01:49:01,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:49:01,603 INFO L481 AbstractCegarLoop]: Abstraction has 4661 states and 6868 transitions. [2021-01-07 01:49:01,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-07 01:49:01,603 INFO L276 IsEmpty]: Start isEmpty. Operand 4661 states and 6868 transitions. [2021-01-07 01:49:01,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-01-07 01:49:01,606 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:49:01,606 INFO L422 BasicCegarLoop]: trace histogram [7, 3, 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] [2021-01-07 01:49:01,813 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-01-07 01:49:01,814 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:49:01,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:49:01,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1114483675, now seen corresponding path program 6 times [2021-01-07 01:49:01,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:49:01,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902079351] [2021-01-07 01:49:01,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:49:01,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:49:02,447 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-07 01:49:02,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902079351] [2021-01-07 01:49:02,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933121757] [2021-01-07 01:49:02,448 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:49:13,580 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-01-07 01:49:13,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-07 01:49:13,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 1972 conjuncts, 21 conjunts are in the unsatisfiable core [2021-01-07 01:49:13,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:49:14,204 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-07 01:49:14,205 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:49:14,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-01-07 01:49:14,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544433025] [2021-01-07 01:49:14,205 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-01-07 01:49:14,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:49:14,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-01-07 01:49:14,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2021-01-07 01:49:14,206 INFO L87 Difference]: Start difference. First operand 4661 states and 6868 transitions. Second operand 18 states. [2021-01-07 01:49:16,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:49:16,589 INFO L93 Difference]: Finished difference Result 9325 states and 13776 transitions. [2021-01-07 01:49:16,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-07 01:49:16,590 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 89 [2021-01-07 01:49:16,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:49:16,595 INFO L225 Difference]: With dead ends: 9325 [2021-01-07 01:49:16,595 INFO L226 Difference]: Without dead ends: 4699 [2021-01-07 01:49:16,601 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2021-01-07 01:49:16,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4699 states. [2021-01-07 01:49:16,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4699 to 4699. [2021-01-07 01:49:16,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4699 states. [2021-01-07 01:49:16,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4699 states to 4699 states and 6906 transitions. [2021-01-07 01:49:16,895 INFO L78 Accepts]: Start accepts. Automaton has 4699 states and 6906 transitions. Word has length 89 [2021-01-07 01:49:16,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:49:16,895 INFO L481 AbstractCegarLoop]: Abstraction has 4699 states and 6906 transitions. [2021-01-07 01:49:16,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-01-07 01:49:16,895 INFO L276 IsEmpty]: Start isEmpty. Operand 4699 states and 6906 transitions. [2021-01-07 01:49:16,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-01-07 01:49:16,899 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:49:16,899 INFO L422 BasicCegarLoop]: trace histogram [8, 4, 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] [2021-01-07 01:49:17,114 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-01-07 01:49:17,118 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:49:17,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:49:17,118 INFO L82 PathProgramCache]: Analyzing trace with hash 389664349, now seen corresponding path program 7 times [2021-01-07 01:49:17,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:49:17,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446721916] [2021-01-07 01:49:17,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:49:18,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-07 01:49:18,386 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.