/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-consumption/32_7a_cilled_linux-3.8-rc1-drivers--hwmon--abituguru3.ko-main.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 14:55:26,749 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 14:55:26,752 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 14:55:26,790 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 14:55:26,791 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 14:55:26,792 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 14:55:26,794 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 14:55:26,803 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 14:55:26,805 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 14:55:26,806 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 14:55:26,807 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 14:55:26,809 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 14:55:26,809 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 14:55:26,810 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 14:55:26,812 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 14:55:26,813 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 14:55:26,814 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 14:55:26,815 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 14:55:26,817 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 14:55:26,820 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 14:55:26,822 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 14:55:26,823 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 14:55:26,825 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 14:55:26,826 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 14:55:26,830 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 14:55:26,830 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 14:55:26,830 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 14:55:26,832 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 14:55:26,832 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 14:55:26,833 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 14:55:26,834 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 14:55:26,835 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 14:55:26,835 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 14:55:26,836 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 14:55:26,838 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 14:55:26,838 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 14:55:26,839 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 14:55:26,839 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 14:55:26,839 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 14:55:26,841 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 14:55:26,841 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 14:55:26,842 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 14:55:26,876 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 14:55:26,878 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 14:55:26,879 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 14:55:26,880 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 14:55:26,881 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 14:55:26,881 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 14:55:26,881 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 14:55:26,882 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 14:55:26,882 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 14:55:26,882 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 14:55:26,883 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 14:55:26,883 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 14:55:26,883 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 14:55:26,884 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 14:55:26,884 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 14:55:26,884 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 14:55:26,884 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 14:55:26,884 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 14:55:26,885 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 14:55:26,885 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 14:55:26,885 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 14:55:26,885 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 14:55:26,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 14:55:26,886 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 14:55:26,886 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 14:55:26,887 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 14:55:27,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 14:55:27,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 14:55:27,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 14:55:27,348 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 14:55:27,349 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 14:55:27,350 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--hwmon--abituguru3.ko-main.cil.out.i [2020-12-23 14:55:27,424 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/eecae2acd/b06e151cf9914d5ca4ba265371d52c52/FLAGdeb38e2e1 [2020-12-23 14:55:28,350 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 14:55:28,350 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--hwmon--abituguru3.ko-main.cil.out.i [2020-12-23 14:55:28,392 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/eecae2acd/b06e151cf9914d5ca4ba265371d52c52/FLAGdeb38e2e1 [2020-12-23 14:55:28,885 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/eecae2acd/b06e151cf9914d5ca4ba265371d52c52 [2020-12-23 14:55:28,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 14:55:28,891 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 14:55:28,893 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 14:55:28,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 14:55:28,897 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 14:55:28,899 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 02:55:28" (1/1) ... [2020-12-23 14:55:28,901 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fd8e0b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:55:28, skipping insertion in model container [2020-12-23 14:55:28,902 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 02:55:28" (1/1) ... [2020-12-23 14:55:28,910 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 14:55:29,003 INFO L178 MainTranslator]: Built tables and reachable declarations 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[~value~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~timeout~0,] left hand side expression in assignment: lhs: VariableLHS[~timeout~0,] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~timeout~1,] left hand side expression in assignment: lhs: VariableLHS[~timeout~1,] left hand side expression in assignment: lhs: VariableLHS[~x~1,] left hand side expression in assignment: lhs: VariableLHS[~timeout~2,] left hand side expression in assignment: lhs: VariableLHS[~x~2,] left hand side expression in assignment: lhs: VariableLHS[~x~2,] left hand side expression in assignment: lhs: VariableLHS[~x~2,] left hand side expression in assignment: lhs: VariableLHS[~x~2,] left hand side expression in assignment: lhs: VariableLHS[~x~2,] left hand side expression in assignment: lhs: VariableLHS[~timeout~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~x~2,] left hand side expression in assignment: lhs: VariableLHS[~x~3,] left hand side expression in assignment: lhs: VariableLHS[~x~3,] left hand side expression in assignment: lhs: VariableLHS[~x~3,] left hand side expression in assignment: lhs: VariableLHS[~x~3,] left hand side expression in assignment: lhs: VariableLHS[~x~3,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~x~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~buf,],offset],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~0,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~0,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~0,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~x~4,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~0,] left hand side expression in assignment: lhs: VariableLHS[~attr~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~data~0,] left hand side expression in assignment: lhs: VariableLHS[~sensor~0,] left hand side expression in assignment: lhs: VariableLHS[~value~2,] left hand side expression in assignment: lhs: VariableLHS[~value~2,] left hand side expression in assignment: lhs: VariableLHS[~value~2,] left hand side expression in assignment: lhs: VariableLHS[~value~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~1,] left hand side expression in assignment: lhs: VariableLHS[~attr~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~data~1,] left hand side expression in assignment: lhs: VariableLHS[~port~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~2,] left hand side expression in assignment: lhs: VariableLHS[~attr~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~data~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~3,] left hand side expression in assignment: lhs: VariableLHS[~attr~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~data~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~no_sysfs_attr~0,],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~no_sysfs_attr~0,],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~no_sysfs_attr~0,],[IntegerLiteral[2]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~sensor_index~0,],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~sensor_index~0,],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~sensor_index~0,],[IntegerLiteral[2]]] left hand side expression in assignment: lhs: VariableLHS[~res~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~data~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~4,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[164],StructAccessExpression[IdentifierExpression[~data~4,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: lhs: VariableLHS[~id~0,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~4,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[15183],StructAccessExpression[IdentifierExpression[~data~4,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~sysfs_attr_i~0,] left hand side expression in assignment: lhs: VariableLHS[~sysfs_filename~0,] left hand side expression in assignment: lhs: VariableLHS[~sysfs_names_free~0,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~res~0,] left hand side expression in assignment: lhs: VariableLHS[~type~0,] left hand side expression in assignment: lhs: VariableLHS[~j~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~used~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~4,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[175],StructAccessExpression[IdentifierExpression[~data~4,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~sysfs_attr_i~0,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~4,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[175],StructAccessExpression[IdentifierExpression[~data~4,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~sysfs_attr_i~0,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~4,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[43],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[175],StructAccessExpression[IdentifierExpression[~data~4,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~sysfs_attr_i~0,]]]]]] left hand side expression in assignment: lhs: VariableLHS[~sysfs_filename~0,] left hand side expression in assignment: lhs: VariableLHS[~sysfs_names_free~0,] left hand side expression in assignment: lhs: VariableLHS[~sysfs_attr_i~0,] left hand side expression in assignment: lhs: VariableLHS[~j~0,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~sensor_index~0,],[IdentifierExpression[~type~0,]]] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~res~0,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~4,],base],StructAccessExpression[IdentifierExpression[~data~4,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~res~0,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~data~5,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~data~6,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~6,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[166],StructAccessExpression[IdentifierExpression[~data~6,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~1,] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~6,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[167],StructAccessExpression[IdentifierExpression[~data~6,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~6,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[166],StructAccessExpression[IdentifierExpression[~data~6,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~data~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~data~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~err~0,] left hand side expression in assignment: lhs: VariableLHS[~board_vendor~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~board_name~0,] left hand side expression in assignment: lhs: VariableLHS[~sublen~0,] left hand side expression in assignment: lhs: VariableLHS[~sublen~0,] left hand side expression in assignment: lhs: VariableLHS[~i~5,] left hand side expression in assignment: lhs: VariableLHS[~dmi_name~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: lhs: VariableLHS[~dmi_name~0,] left hand side expression in assignment: lhs: VariableLHS[~i~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~data_val~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: lhs: VariableLHS[~cmd_val~0,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~res~1,],start] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~res~1,],end] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~res~1,],name] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~res~1,],flags] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~res~1,],parent] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~res~1,],sibling] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~res~1,],child] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: lhs: VariableLHS[~abituguru3_pdev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~res~1,],start] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~res~1,],end] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~res~1,],name] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~5,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~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_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~3,] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_18~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_14~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_8~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_retval_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_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[~ldv_retval_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[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~1,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] [2020-12-23 14:55:30,009 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-consumption/32_7a_cilled_linux-3.8-rc1-drivers--hwmon--abituguru3.ko-main.cil.out.i[132927,132940] left hand side expression in assignment: lhs: VariableLHS[~nondetermined~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nondetermined~1,] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~is_mutex_held_by_another_thread~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~atomic_value_after_dec~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nondetermined~2,] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nondetermined~3,] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_mutex_of_device~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nondetermined~4,] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_mutex_of_device~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_mutex_of_device~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~is_mutex_held_by_another_thread~1,] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_mutex_of_device~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~atomic_value_after_dec~1,] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_mutex_of_device~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nondetermined~5,] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_mutex_of_device~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nondetermined~6,] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_update_lock_of_abituguru3_data~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nondetermined~7,] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_update_lock_of_abituguru3_data~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_update_lock_of_abituguru3_data~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~is_mutex_held_by_another_thread~2,] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_update_lock_of_abituguru3_data~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~atomic_value_after_dec~2,] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_update_lock_of_abituguru3_data~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nondetermined~8,] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_update_lock_of_abituguru3_data~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_mutex_of_device~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_update_lock_of_abituguru3_data~0,GLOBAL] [2020-12-23 14:55:30,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 14:55:30,212 INFO L203 MainTranslator]: Completed pre-run 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[~value~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~timeout~0,] left hand side expression in assignment: lhs: VariableLHS[~timeout~0,] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~timeout~1,] left hand side expression in assignment: lhs: VariableLHS[~timeout~1,] left hand side expression in assignment: lhs: VariableLHS[~x~1,] left hand side expression in assignment: lhs: VariableLHS[~timeout~2,] left hand side expression in assignment: lhs: VariableLHS[~x~2,] left hand side expression in assignment: lhs: VariableLHS[~x~2,] left hand side expression in assignment: lhs: VariableLHS[~x~2,] left hand side expression in assignment: lhs: VariableLHS[~x~2,] left hand side expression in assignment: lhs: VariableLHS[~x~2,] left hand side expression in assignment: lhs: VariableLHS[~timeout~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~x~2,] left hand side expression in assignment: lhs: VariableLHS[~x~3,] left hand side expression in assignment: lhs: VariableLHS[~x~3,] left hand side expression in assignment: lhs: VariableLHS[~x~3,] left hand side expression in assignment: lhs: VariableLHS[~x~3,] left hand side expression in assignment: lhs: VariableLHS[~x~3,] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~x~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~buf,],offset],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~0,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~0,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~0,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~x~4,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~0,] left hand side expression in assignment: lhs: VariableLHS[~attr~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~data~0,] left hand side expression in assignment: lhs: VariableLHS[~sensor~0,] left hand side expression in assignment: lhs: VariableLHS[~value~2,] left hand side expression in assignment: lhs: VariableLHS[~value~2,] left hand side expression in assignment: lhs: VariableLHS[~value~2,] left hand side expression in assignment: lhs: VariableLHS[~value~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~1,] left hand side expression in assignment: lhs: VariableLHS[~attr~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~data~1,] left hand side expression in assignment: lhs: VariableLHS[~port~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~2,] left hand side expression in assignment: lhs: VariableLHS[~attr~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~data~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~3,] left hand side expression in assignment: lhs: VariableLHS[~attr~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~data~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#no_sysfs_attr~0,],base],StructAccessExpression[IdentifierExpression[~#no_sysfs_attr~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#no_sysfs_attr~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#no_sysfs_attr~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#no_sysfs_attr~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#no_sysfs_attr~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#sensor_index~0,],base],StructAccessExpression[IdentifierExpression[~#sensor_index~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#sensor_index~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#sensor_index~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#sensor_index~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#sensor_index~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~res~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~data~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~4,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[164],StructAccessExpression[IdentifierExpression[~data~4,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: lhs: VariableLHS[~id~0,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~4,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[15183],StructAccessExpression[IdentifierExpression[~data~4,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~sysfs_attr_i~0,] left hand side expression in assignment: lhs: VariableLHS[~sysfs_filename~0,] left hand side expression in assignment: lhs: VariableLHS[~sysfs_names_free~0,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~res~0,] left hand side expression in assignment: lhs: VariableLHS[~type~0,] left hand side expression in assignment: lhs: VariableLHS[~j~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~used~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~4,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[175],StructAccessExpression[IdentifierExpression[~data~4,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~sysfs_attr_i~0,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~4,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[175],StructAccessExpression[IdentifierExpression[~data~4,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~sysfs_attr_i~0,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~4,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[43],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[175],StructAccessExpression[IdentifierExpression[~data~4,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[45],IdentifierExpression[~sysfs_attr_i~0,]]]]]] left hand side expression in assignment: lhs: VariableLHS[~sysfs_filename~0,] left hand side expression in assignment: lhs: VariableLHS[~sysfs_names_free~0,] left hand side expression in assignment: lhs: VariableLHS[~sysfs_attr_i~0,] left hand side expression in assignment: lhs: VariableLHS[~j~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#sensor_index~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#sensor_index~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~type~0,]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~res~0,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~4,],base],StructAccessExpression[IdentifierExpression[~data~4,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~res~0,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~data~5,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~data~6,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~6,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[166],StructAccessExpression[IdentifierExpression[~data~6,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~1,] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~6,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[167],StructAccessExpression[IdentifierExpression[~data~6,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~6,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[166],StructAccessExpression[IdentifierExpression[~data~6,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~data~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~data~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: lhs: VariableLHS[~err~0,] left hand side expression in assignment: lhs: VariableLHS[~board_vendor~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~board_name~0,] left hand side expression in assignment: lhs: VariableLHS[~sublen~0,] left hand side expression in assignment: lhs: VariableLHS[~sublen~0,] left hand side expression in assignment: lhs: VariableLHS[~i~5,] left hand side expression in assignment: lhs: VariableLHS[~dmi_name~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: lhs: VariableLHS[~dmi_name~0,] left hand side expression in assignment: lhs: VariableLHS[~i~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~data_val~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: lhs: VariableLHS[~cmd_val~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#res~1,],base],StructAccessExpression[IdentifierExpression[~#res~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#res~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#res~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#res~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~#res~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#res~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~#res~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#res~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~#res~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#res~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~#res~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#res~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~#res~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: lhs: VariableLHS[~abituguru3_pdev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#res~1,],base],StructAccessExpression[IdentifierExpression[~#res~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#res~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#res~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#res~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~#res~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~5,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~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_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~3,] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_20~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_19~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_18~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_17~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_16~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_14~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_8~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_retval_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_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[~ldv_retval_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[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~1,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] [2020-12-23 14:55:30,461 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-consumption/32_7a_cilled_linux-3.8-rc1-drivers--hwmon--abituguru3.ko-main.cil.out.i[132927,132940] left hand side expression in assignment: lhs: VariableLHS[~nondetermined~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nondetermined~1,] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~is_mutex_held_by_another_thread~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~atomic_value_after_dec~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nondetermined~2,] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nondetermined~3,] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_mutex_of_device~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nondetermined~4,] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_mutex_of_device~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_mutex_of_device~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~is_mutex_held_by_another_thread~1,] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_mutex_of_device~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~atomic_value_after_dec~1,] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_mutex_of_device~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nondetermined~5,] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_mutex_of_device~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nondetermined~6,] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_update_lock_of_abituguru3_data~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nondetermined~7,] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_update_lock_of_abituguru3_data~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_update_lock_of_abituguru3_data~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~is_mutex_held_by_another_thread~2,] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_update_lock_of_abituguru3_data~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~atomic_value_after_dec~2,] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_update_lock_of_abituguru3_data~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nondetermined~8,] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_update_lock_of_abituguru3_data~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_mutex_of_device~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_mutex_update_lock_of_abituguru3_data~0,GLOBAL] [2020-12-23 14:55:30,486 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 14:55:30,805 INFO L208 MainTranslator]: Completed translation [2020-12-23 14:55:30,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:55:30 WrapperNode [2020-12-23 14:55:30,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 14:55:30,809 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 14:55:30,809 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 14:55:30,809 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 14:55:30,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:55:30" (1/1) ... [2020-12-23 14:55:30,944 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:55:30" (1/1) ... [2020-12-23 14:55:31,418 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 14:55:31,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 14:55:31,424 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 14:55:31,425 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 14:55:31,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:55:30" (1/1) ... [2020-12-23 14:55:31,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:55:30" (1/1) ... [2020-12-23 14:55:31,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:55:30" (1/1) ... [2020-12-23 14:55:31,519 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:55:30" (1/1) ... [2020-12-23 14:55:31,770 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:55:30" (1/1) ... [2020-12-23 14:55:31,809 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:55:30" (1/1) ... [2020-12-23 14:55:31,850 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:55:30" (1/1) ... [2020-12-23 14:55:31,897 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 14:55:31,899 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 14:55:31,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 14:55:31,900 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 14:55:31,901 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:55:30" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 14:55:32,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 14:55:32,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 14:55:32,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 14:55:32,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 14:55:32,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 14:55:32,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 14:55:32,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 14:55:32,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-23 14:55:32,013 INFO L130 BoogieDeclarations]: Found specification of procedure strcspn [2020-12-23 14:55:32,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 14:55:32,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 14:55:32,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 14:56:24,101 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 14:56:24,101 INFO L299 CfgBuilder]: Removed 1211 assume(true) statements. [2020-12-23 14:56:24,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 02:56:24 BoogieIcfgContainer [2020-12-23 14:56:24,105 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 14:56:24,109 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 14:56:24,109 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 14:56:24,113 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 14:56:24,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 02:55:28" (1/3) ... [2020-12-23 14:56:24,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@536d035b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 02:56:24, skipping insertion in model container [2020-12-23 14:56:24,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:55:30" (2/3) ... [2020-12-23 14:56:24,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@536d035b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 02:56:24, skipping insertion in model container [2020-12-23 14:56:24,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 02:56:24" (3/3) ... [2020-12-23 14:56:24,117 INFO L111 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--hwmon--abituguru3.ko-main.cil.out.i [2020-12-23 14:56:24,124 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 14:56:24,130 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2020-12-23 14:56:24,149 INFO L253 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2020-12-23 14:56:24,186 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 14:56:24,186 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 14:56:24,186 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 14:56:24,187 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 14:56:24,187 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 14:56:24,187 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 14:56:24,187 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 14:56:24,187 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 14:56:24,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states. [2020-12-23 14:56:24,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-23 14:56:24,234 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:56:24,235 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:56:24,236 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:56:24,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:56:24,242 INFO L82 PathProgramCache]: Analyzing trace with hash 12375506, now seen corresponding path program 1 times [2020-12-23 14:56:24,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:56:24,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614586084] [2020-12-23 14:56:24,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:56:25,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:56:25,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:56:25,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614586084] [2020-12-23 14:56:25,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:56:25,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 14:56:25,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791257990] [2020-12-23 14:56:25,964 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 14:56:25,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:56:25,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 14:56:25,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:56:25,986 INFO L87 Difference]: Start difference. First operand 1381 states. Second operand 3 states. [2020-12-23 14:56:28,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:56:28,707 INFO L93 Difference]: Finished difference Result 4047 states and 5536 transitions. [2020-12-23 14:56:28,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 14:56:28,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-12-23 14:56:28,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:56:28,742 INFO L225 Difference]: With dead ends: 4047 [2020-12-23 14:56:28,742 INFO L226 Difference]: Without dead ends: 2665 [2020-12-23 14:56:28,752 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:56:28,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2665 states. [2020-12-23 14:56:28,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2665 to 2649. [2020-12-23 14:56:28,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2649 states. [2020-12-23 14:56:28,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2649 states to 2649 states and 3593 transitions. [2020-12-23 14:56:28,926 INFO L78 Accepts]: Start accepts. Automaton has 2649 states and 3593 transitions. Word has length 14 [2020-12-23 14:56:28,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:56:28,927 INFO L481 AbstractCegarLoop]: Abstraction has 2649 states and 3593 transitions. [2020-12-23 14:56:28,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 14:56:28,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2649 states and 3593 transitions. [2020-12-23 14:56:28,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-23 14:56:28,930 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:56:28,930 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:56:28,930 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 14:56:28,931 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:56:28,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:56:28,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1358126481, now seen corresponding path program 1 times [2020-12-23 14:56:28,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:56:28,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106714625] [2020-12-23 14:56:28,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:56:29,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:56:29,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:56:29,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106714625] [2020-12-23 14:56:29,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:56:29,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 14:56:29,836 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879150579] [2020-12-23 14:56:29,838 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 14:56:29,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:56:29,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 14:56:29,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:56:29,839 INFO L87 Difference]: Start difference. First operand 2649 states and 3593 transitions. Second operand 3 states. [2020-12-23 14:56:30,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:56:30,454 INFO L93 Difference]: Finished difference Result 7634 states and 10327 transitions. [2020-12-23 14:56:30,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 14:56:30,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-12-23 14:56:30,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:56:30,479 INFO L225 Difference]: With dead ends: 7634 [2020-12-23 14:56:30,480 INFO L226 Difference]: Without dead ends: 4988 [2020-12-23 14:56:30,487 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:56:30,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2020-12-23 14:56:30,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4972. [2020-12-23 14:56:30,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4972 states. [2020-12-23 14:56:30,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4972 states to 4972 states and 6722 transitions. [2020-12-23 14:56:30,651 INFO L78 Accepts]: Start accepts. Automaton has 4972 states and 6722 transitions. Word has length 15 [2020-12-23 14:56:30,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:56:30,652 INFO L481 AbstractCegarLoop]: Abstraction has 4972 states and 6722 transitions. [2020-12-23 14:56:30,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 14:56:30,653 INFO L276 IsEmpty]: Start isEmpty. Operand 4972 states and 6722 transitions. [2020-12-23 14:56:30,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-23 14:56:30,660 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:56:30,660 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] [2020-12-23 14:56:30,660 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 14:56:30,662 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:56:30,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:56:30,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1461430461, now seen corresponding path program 1 times [2020-12-23 14:56:30,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:56:30,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904073536] [2020-12-23 14:56:30,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:56:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:56:31,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:56:31,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904073536] [2020-12-23 14:56:31,658 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:56:31,658 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 14:56:31,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4776583] [2020-12-23 14:56:31,659 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 14:56:31,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:56:31,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 14:56:31,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 14:56:31,660 INFO L87 Difference]: Start difference. First operand 4972 states and 6722 transitions. Second operand 6 states. [2020-12-23 14:56:33,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:56:33,552 INFO L93 Difference]: Finished difference Result 24702 states and 33402 transitions. [2020-12-23 14:56:33,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 14:56:33,558 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-12-23 14:56:33,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:56:33,682 INFO L225 Difference]: With dead ends: 24702 [2020-12-23 14:56:33,684 INFO L226 Difference]: Without dead ends: 19733 [2020-12-23 14:56:33,698 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-12-23 14:56:33,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19733 states. [2020-12-23 14:56:34,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19733 to 5014. [2020-12-23 14:56:34,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5014 states. [2020-12-23 14:56:34,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5014 states to 5014 states and 6774 transitions. [2020-12-23 14:56:34,079 INFO L78 Accepts]: Start accepts. Automaton has 5014 states and 6774 transitions. Word has length 23 [2020-12-23 14:56:34,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:56:34,080 INFO L481 AbstractCegarLoop]: Abstraction has 5014 states and 6774 transitions. [2020-12-23 14:56:34,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 14:56:34,080 INFO L276 IsEmpty]: Start isEmpty. Operand 5014 states and 6774 transitions. [2020-12-23 14:56:34,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-23 14:56:34,083 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:56:34,083 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] [2020-12-23 14:56:34,083 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 14:56:34,084 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:56:34,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:56:34,084 INFO L82 PathProgramCache]: Analyzing trace with hash 874624447, now seen corresponding path program 1 times [2020-12-23 14:56:34,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:56:34,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397756631] [2020-12-23 14:56:34,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:56:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:56:34,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:56:34,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397756631] [2020-12-23 14:56:34,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:56:34,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 14:56:34,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440277592] [2020-12-23 14:56:34,896 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 14:56:34,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:56:34,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 14:56:34,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:56:34,898 INFO L87 Difference]: Start difference. First operand 5014 states and 6774 transitions. Second operand 3 states. [2020-12-23 14:56:35,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:56:35,529 INFO L93 Difference]: Finished difference Result 5032 states and 6790 transitions. [2020-12-23 14:56:35,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 14:56:35,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-12-23 14:56:35,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:56:35,542 INFO L225 Difference]: With dead ends: 5032 [2020-12-23 14:56:35,542 INFO L226 Difference]: Without dead ends: 5023 [2020-12-23 14:56:35,545 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:56:35,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5023 states. [2020-12-23 14:56:35,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5023 to 5014. [2020-12-23 14:56:35,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5014 states. [2020-12-23 14:56:35,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5014 states to 5014 states and 6773 transitions. [2020-12-23 14:56:35,816 INFO L78 Accepts]: Start accepts. Automaton has 5014 states and 6773 transitions. Word has length 23 [2020-12-23 14:56:35,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:56:35,817 INFO L481 AbstractCegarLoop]: Abstraction has 5014 states and 6773 transitions. [2020-12-23 14:56:35,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 14:56:35,818 INFO L276 IsEmpty]: Start isEmpty. Operand 5014 states and 6773 transitions. [2020-12-23 14:56:35,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-23 14:56:35,819 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:56:35,819 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] [2020-12-23 14:56:35,819 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 14:56:35,819 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:56:35,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:56:35,820 INFO L82 PathProgramCache]: Analyzing trace with hash 874684029, now seen corresponding path program 1 times [2020-12-23 14:56:35,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:56:35,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519200607] [2020-12-23 14:56:35,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:56:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:56:36,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:56:36,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519200607] [2020-12-23 14:56:36,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:56:36,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 14:56:36,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719730379] [2020-12-23 14:56:36,595 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 14:56:36,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:56:36,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 14:56:36,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:56:36,597 INFO L87 Difference]: Start difference. First operand 5014 states and 6773 transitions. Second operand 3 states. [2020-12-23 14:56:39,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:56:39,262 INFO L93 Difference]: Finished difference Result 5014 states and 6773 transitions. [2020-12-23 14:56:39,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 14:56:39,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-12-23 14:56:39,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:56:39,275 INFO L225 Difference]: With dead ends: 5014 [2020-12-23 14:56:39,275 INFO L226 Difference]: Without dead ends: 5012 [2020-12-23 14:56:39,277 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:56:39,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5012 states. [2020-12-23 14:56:39,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5012 to 5012. [2020-12-23 14:56:39,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5012 states. [2020-12-23 14:56:39,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5012 states to 5012 states and 6771 transitions. [2020-12-23 14:56:39,531 INFO L78 Accepts]: Start accepts. Automaton has 5012 states and 6771 transitions. Word has length 23 [2020-12-23 14:56:39,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:56:39,531 INFO L481 AbstractCegarLoop]: Abstraction has 5012 states and 6771 transitions. [2020-12-23 14:56:39,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 14:56:39,531 INFO L276 IsEmpty]: Start isEmpty. Operand 5012 states and 6771 transitions. [2020-12-23 14:56:39,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-23 14:56:39,532 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:56:39,532 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:56:39,532 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 14:56:39,533 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:56:39,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:56:39,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1345403867, now seen corresponding path program 1 times [2020-12-23 14:56:39,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:56:39,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409224630] [2020-12-23 14:56:39,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:56:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:56:40,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:56:40,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409224630] [2020-12-23 14:56:40,272 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:56:40,272 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 14:56:40,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427617399] [2020-12-23 14:56:40,272 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 14:56:40,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:56:40,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 14:56:40,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:56:40,273 INFO L87 Difference]: Start difference. First operand 5012 states and 6771 transitions. Second operand 3 states. [2020-12-23 14:56:42,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:56:42,890 INFO L93 Difference]: Finished difference Result 5012 states and 6771 transitions. [2020-12-23 14:56:42,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 14:56:42,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-12-23 14:56:42,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:56:42,901 INFO L225 Difference]: With dead ends: 5012 [2020-12-23 14:56:42,901 INFO L226 Difference]: Without dead ends: 5010 [2020-12-23 14:56:42,903 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:56:42,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5010 states. [2020-12-23 14:56:43,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5010 to 5010. [2020-12-23 14:56:43,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5010 states. [2020-12-23 14:56:43,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5010 states to 5010 states and 6769 transitions. [2020-12-23 14:56:43,144 INFO L78 Accepts]: Start accepts. Automaton has 5010 states and 6769 transitions. Word has length 24 [2020-12-23 14:56:43,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:56:43,144 INFO L481 AbstractCegarLoop]: Abstraction has 5010 states and 6769 transitions. [2020-12-23 14:56:43,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 14:56:43,145 INFO L276 IsEmpty]: Start isEmpty. Operand 5010 states and 6769 transitions. [2020-12-23 14:56:43,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-23 14:56:43,150 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:56:43,150 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] [2020-12-23 14:56:43,155 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 14:56:43,155 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:56:43,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:56:43,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1242150329, now seen corresponding path program 1 times [2020-12-23 14:56:43,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:56:43,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486748041] [2020-12-23 14:56:43,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:56:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:56:43,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:56:43,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486748041] [2020-12-23 14:56:43,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:56:43,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 14:56:43,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908003335] [2020-12-23 14:56:43,858 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 14:56:43,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:56:43,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 14:56:43,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:56:43,859 INFO L87 Difference]: Start difference. First operand 5010 states and 6769 transitions. Second operand 3 states. [2020-12-23 14:56:46,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:56:46,704 INFO L93 Difference]: Finished difference Result 11424 states and 15459 transitions. [2020-12-23 14:56:46,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 14:56:46,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-12-23 14:56:46,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:56:46,721 INFO L225 Difference]: With dead ends: 11424 [2020-12-23 14:56:46,721 INFO L226 Difference]: Without dead ends: 6411 [2020-12-23 14:56:46,730 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:56:46,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6411 states. [2020-12-23 14:56:47,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6411 to 6381. [2020-12-23 14:56:47,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6381 states. [2020-12-23 14:56:47,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6381 states to 6381 states and 8637 transitions. [2020-12-23 14:56:47,017 INFO L78 Accepts]: Start accepts. Automaton has 6381 states and 8637 transitions. Word has length 25 [2020-12-23 14:56:47,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:56:47,019 INFO L481 AbstractCegarLoop]: Abstraction has 6381 states and 8637 transitions. [2020-12-23 14:56:47,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 14:56:47,020 INFO L276 IsEmpty]: Start isEmpty. Operand 6381 states and 8637 transitions. [2020-12-23 14:56:47,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-23 14:56:47,023 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:56:47,023 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] [2020-12-23 14:56:47,024 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 14:56:47,024 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:56:47,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:56:47,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1456826833, now seen corresponding path program 1 times [2020-12-23 14:56:47,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:56:47,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370564380] [2020-12-23 14:56:47,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:56:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:56:47,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:56:47,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370564380] [2020-12-23 14:56:47,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:56:47,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 14:56:47,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128130698] [2020-12-23 14:56:47,722 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 14:56:47,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:56:47,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 14:56:47,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:56:47,723 INFO L87 Difference]: Start difference. First operand 6381 states and 8637 transitions. Second operand 3 states. [2020-12-23 14:56:50,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:56:50,527 INFO L93 Difference]: Finished difference Result 15863 states and 21540 transitions. [2020-12-23 14:56:50,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 14:56:50,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-12-23 14:56:50,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:56:50,550 INFO L225 Difference]: With dead ends: 15863 [2020-12-23 14:56:50,551 INFO L226 Difference]: Without dead ends: 9485 [2020-12-23 14:56:50,562 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:56:50,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9485 states. [2020-12-23 14:56:51,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9485 to 9473. [2020-12-23 14:56:51,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9473 states. [2020-12-23 14:56:51,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9473 states to 9473 states and 12813 transitions. [2020-12-23 14:56:51,062 INFO L78 Accepts]: Start accepts. Automaton has 9473 states and 12813 transitions. Word has length 33 [2020-12-23 14:56:51,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:56:51,062 INFO L481 AbstractCegarLoop]: Abstraction has 9473 states and 12813 transitions. [2020-12-23 14:56:51,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 14:56:51,063 INFO L276 IsEmpty]: Start isEmpty. Operand 9473 states and 12813 transitions. [2020-12-23 14:56:51,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-23 14:56:51,064 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:56:51,064 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] [2020-12-23 14:56:51,064 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 14:56:51,065 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:56:51,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:56:51,065 INFO L82 PathProgramCache]: Analyzing trace with hash -2053211790, now seen corresponding path program 1 times [2020-12-23 14:56:51,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:56:51,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885148017] [2020-12-23 14:56:51,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:56:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:56:51,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 14:56:51,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885148017] [2020-12-23 14:56:51,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:56:51,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 14:56:51,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972449227] [2020-12-23 14:56:51,703 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 14:56:51,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:56:51,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 14:56:51,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:56:51,706 INFO L87 Difference]: Start difference. First operand 9473 states and 12813 transitions. Second operand 3 states. [2020-12-23 14:56:52,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:56:52,548 INFO L93 Difference]: Finished difference Result 20290 states and 27570 transitions. [2020-12-23 14:56:52,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 14:56:52,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-12-23 14:56:52,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:56:52,573 INFO L225 Difference]: With dead ends: 20290 [2020-12-23 14:56:52,573 INFO L226 Difference]: Without dead ends: 10820 [2020-12-23 14:56:52,587 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:56:52,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10820 states. [2020-12-23 14:56:52,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10820 to 10765. [2020-12-23 14:56:52,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10765 states. [2020-12-23 14:56:53,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10765 states to 10765 states and 14697 transitions. [2020-12-23 14:56:53,007 INFO L78 Accepts]: Start accepts. Automaton has 10765 states and 14697 transitions. Word has length 45 [2020-12-23 14:56:53,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:56:53,007 INFO L481 AbstractCegarLoop]: Abstraction has 10765 states and 14697 transitions. [2020-12-23 14:56:53,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 14:56:53,008 INFO L276 IsEmpty]: Start isEmpty. Operand 10765 states and 14697 transitions. [2020-12-23 14:56:53,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-23 14:56:53,011 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:56:53,011 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:56:53,011 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 14:56:53,012 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:56:53,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:56:53,012 INFO L82 PathProgramCache]: Analyzing trace with hash -234060580, now seen corresponding path program 1 times [2020-12-23 14:56:53,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:56:53,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923810344] [2020-12-23 14:56:53,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:56:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:56:53,892 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-23 14:56:53,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923810344] [2020-12-23 14:56:53,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:56:53,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 14:56:53,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599354715] [2020-12-23 14:56:53,894 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 14:56:53,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:56:53,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 14:56:53,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:56:53,895 INFO L87 Difference]: Start difference. First operand 10765 states and 14697 transitions. Second operand 3 states. [2020-12-23 14:56:56,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:56:56,881 INFO L93 Difference]: Finished difference Result 25013 states and 34292 transitions. [2020-12-23 14:56:56,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 14:56:56,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-12-23 14:56:56,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:56:56,909 INFO L225 Difference]: With dead ends: 25013 [2020-12-23 14:56:56,909 INFO L226 Difference]: Without dead ends: 14251 [2020-12-23 14:56:56,926 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:56:56,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14251 states. [2020-12-23 14:56:57,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14251 to 14239. [2020-12-23 14:56:57,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14239 states. [2020-12-23 14:56:57,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14239 states to 14239 states and 19421 transitions. [2020-12-23 14:56:57,479 INFO L78 Accepts]: Start accepts. Automaton has 14239 states and 19421 transitions. Word has length 54 [2020-12-23 14:56:57,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:56:57,479 INFO L481 AbstractCegarLoop]: Abstraction has 14239 states and 19421 transitions. [2020-12-23 14:56:57,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 14:56:57,479 INFO L276 IsEmpty]: Start isEmpty. Operand 14239 states and 19421 transitions. [2020-12-23 14:56:57,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-12-23 14:56:57,482 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:56:57,483 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] [2020-12-23 14:56:57,483 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 14:56:57,483 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:56:57,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:56:57,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1153792279, now seen corresponding path program 1 times [2020-12-23 14:56:57,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:56:57,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573478120] [2020-12-23 14:56:57,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:56:58,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:56:58,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 14:56:58,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573478120] [2020-12-23 14:56:58,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:56:58,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 14:56:58,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863512109] [2020-12-23 14:56:58,557 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 14:56:58,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:56:58,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 14:56:58,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:56:58,559 INFO L87 Difference]: Start difference. First operand 14239 states and 19421 transitions. Second operand 3 states. [2020-12-23 14:56:59,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:56:59,120 INFO L93 Difference]: Finished difference Result 28483 states and 38855 transitions. [2020-12-23 14:56:59,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 14:56:59,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2020-12-23 14:56:59,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:56:59,144 INFO L225 Difference]: With dead ends: 28483 [2020-12-23 14:56:59,144 INFO L226 Difference]: Without dead ends: 14247 [2020-12-23 14:56:59,165 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:56:59,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14247 states. [2020-12-23 14:56:59,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14247 to 14247. [2020-12-23 14:56:59,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14247 states. [2020-12-23 14:56:59,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14247 states to 14247 states and 19429 transitions. [2020-12-23 14:56:59,582 INFO L78 Accepts]: Start accepts. Automaton has 14247 states and 19429 transitions. Word has length 69 [2020-12-23 14:56:59,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:56:59,582 INFO L481 AbstractCegarLoop]: Abstraction has 14247 states and 19429 transitions. [2020-12-23 14:56:59,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 14:56:59,583 INFO L276 IsEmpty]: Start isEmpty. Operand 14247 states and 19429 transitions. [2020-12-23 14:56:59,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-12-23 14:56:59,586 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:56:59,586 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] [2020-12-23 14:56:59,586 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 14:56:59,587 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:56:59,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:56:59,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1155639321, now seen corresponding path program 1 times [2020-12-23 14:56:59,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:56:59,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690679604] [2020-12-23 14:56:59,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:57:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:57:00,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 14:57:00,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690679604] [2020-12-23 14:57:00,375 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:57:00,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 14:57:00,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217972663] [2020-12-23 14:57:00,377 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 14:57:00,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:57:00,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 14:57:00,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:57:00,378 INFO L87 Difference]: Start difference. First operand 14247 states and 19429 transitions. Second operand 3 states. [2020-12-23 14:57:03,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:57:03,275 INFO L93 Difference]: Finished difference Result 28489 states and 38854 transitions. [2020-12-23 14:57:03,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 14:57:03,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2020-12-23 14:57:03,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:57:03,292 INFO L225 Difference]: With dead ends: 28489 [2020-12-23 14:57:03,292 INFO L226 Difference]: Without dead ends: 14245 [2020-12-23 14:57:03,310 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:57:03,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14245 states. [2020-12-23 14:57:03,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14245 to 14108. [2020-12-23 14:57:03,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14108 states. [2020-12-23 14:57:03,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14108 states to 14108 states and 19235 transitions. [2020-12-23 14:57:03,884 INFO L78 Accepts]: Start accepts. Automaton has 14108 states and 19235 transitions. Word has length 69 [2020-12-23 14:57:03,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:57:03,885 INFO L481 AbstractCegarLoop]: Abstraction has 14108 states and 19235 transitions. [2020-12-23 14:57:03,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 14:57:03,885 INFO L276 IsEmpty]: Start isEmpty. Operand 14108 states and 19235 transitions. [2020-12-23 14:57:03,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-12-23 14:57:03,889 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:57:03,890 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:57:03,890 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 14:57:03,890 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:57:03,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:57:03,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1383268386, now seen corresponding path program 1 times [2020-12-23 14:57:03,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:57:03,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063429037] [2020-12-23 14:57:03,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:57:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:57:04,630 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-23 14:57:04,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063429037] [2020-12-23 14:57:04,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334284430] [2020-12-23 14:57:04,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:57:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:57:09,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 12893 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-23 14:57:09,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:57:09,989 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-23 14:57:09,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 14:57:09,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2020-12-23 14:57:09,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936496229] [2020-12-23 14:57:09,991 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 14:57:09,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:57:09,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 14:57:09,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-12-23 14:57:09,991 INFO L87 Difference]: Start difference. First operand 14108 states and 19235 transitions. Second operand 8 states. [2020-12-23 14:57:15,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:57:15,202 INFO L93 Difference]: Finished difference Result 41811 states and 57055 transitions. [2020-12-23 14:57:15,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 14:57:15,204 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2020-12-23 14:57:15,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:57:15,273 INFO L225 Difference]: With dead ends: 41811 [2020-12-23 14:57:15,273 INFO L226 Difference]: Without dead ends: 27666 [2020-12-23 14:57:15,289 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2020-12-23 14:57:15,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27666 states. [2020-12-23 14:57:16,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27666 to 14113. [2020-12-23 14:57:16,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14113 states. [2020-12-23 14:57:16,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14113 states to 14113 states and 19216 transitions. [2020-12-23 14:57:16,162 INFO L78 Accepts]: Start accepts. Automaton has 14113 states and 19216 transitions. Word has length 73 [2020-12-23 14:57:16,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:57:16,163 INFO L481 AbstractCegarLoop]: Abstraction has 14113 states and 19216 transitions. [2020-12-23 14:57:16,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 14:57:16,163 INFO L276 IsEmpty]: Start isEmpty. Operand 14113 states and 19216 transitions. [2020-12-23 14:57:16,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-12-23 14:57:16,167 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:57:16,167 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:57:16,381 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-12-23 14:57:16,382 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:57:16,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:57:16,383 INFO L82 PathProgramCache]: Analyzing trace with hash -860246004, now seen corresponding path program 1 times [2020-12-23 14:57:16,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:57:16,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583125846] [2020-12-23 14:57:16,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:57:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:57:17,221 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-23 14:57:17,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583125846] [2020-12-23 14:57:17,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:57:17,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 14:57:17,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766607032] [2020-12-23 14:57:17,224 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:57:17,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:57:17,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:57:17,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:57:17,225 INFO L87 Difference]: Start difference. First operand 14113 states and 19216 transitions. Second operand 4 states. [2020-12-23 14:57:19,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:57:19,694 INFO L93 Difference]: Finished difference Result 67691 states and 92366 transitions. [2020-12-23 14:57:19,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 14:57:19,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2020-12-23 14:57:19,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:57:19,907 INFO L225 Difference]: With dead ends: 67691 [2020-12-23 14:57:19,907 INFO L226 Difference]: Without dead ends: 53581 [2020-12-23 14:57:19,926 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:57:19,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53581 states. [2020-12-23 14:57:20,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53581 to 14129. [2020-12-23 14:57:20,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14129 states. [2020-12-23 14:57:20,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14129 states to 14129 states and 19232 transitions. [2020-12-23 14:57:20,968 INFO L78 Accepts]: Start accepts. Automaton has 14129 states and 19232 transitions. Word has length 85 [2020-12-23 14:57:20,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:57:20,969 INFO L481 AbstractCegarLoop]: Abstraction has 14129 states and 19232 transitions. [2020-12-23 14:57:20,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:57:20,969 INFO L276 IsEmpty]: Start isEmpty. Operand 14129 states and 19232 transitions. [2020-12-23 14:57:20,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-12-23 14:57:20,973 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:57:20,974 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:57:20,974 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 14:57:20,974 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:57:20,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:57:20,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1508724510, now seen corresponding path program 1 times [2020-12-23 14:57:20,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:57:20,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282160168] [2020-12-23 14:57:20,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:57:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:57:21,675 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-23 14:57:21,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282160168] [2020-12-23 14:57:21,675 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:57:21,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 14:57:21,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386392810] [2020-12-23 14:57:21,679 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 14:57:21,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:57:21,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 14:57:21,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:57:21,680 INFO L87 Difference]: Start difference. First operand 14129 states and 19232 transitions. Second operand 3 states. [2020-12-23 14:57:25,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:57:25,948 INFO L93 Difference]: Finished difference Result 41768 states and 56925 transitions. [2020-12-23 14:57:25,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 14:57:25,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2020-12-23 14:57:25,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:57:25,988 INFO L225 Difference]: With dead ends: 41768 [2020-12-23 14:57:25,988 INFO L226 Difference]: Without dead ends: 27642 [2020-12-23 14:57:26,005 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:57:26,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27642 states. [2020-12-23 14:57:27,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27642 to 27433. [2020-12-23 14:57:27,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27433 states. [2020-12-23 14:57:27,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27433 states to 27433 states and 37432 transitions. [2020-12-23 14:57:27,376 INFO L78 Accepts]: Start accepts. Automaton has 27433 states and 37432 transitions. Word has length 87 [2020-12-23 14:57:27,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:57:27,376 INFO L481 AbstractCegarLoop]: Abstraction has 27433 states and 37432 transitions. [2020-12-23 14:57:27,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 14:57:27,376 INFO L276 IsEmpty]: Start isEmpty. Operand 27433 states and 37432 transitions. [2020-12-23 14:57:27,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-12-23 14:57:27,383 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:57:27,383 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:57:27,383 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 14:57:27,384 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:57:27,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:57:27,384 INFO L82 PathProgramCache]: Analyzing trace with hash 962307733, now seen corresponding path program 1 times [2020-12-23 14:57:27,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:57:27,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842818260] [2020-12-23 14:57:27,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:57:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:57:28,128 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-23 14:57:28,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842818260] [2020-12-23 14:57:28,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244273944] [2020-12-23 14:57:28,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 14:57:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:57:33,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 12994 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 14:57:33,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 14:57:33,420 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-23 14:57:33,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 14:57:33,421 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2020-12-23 14:57:33,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784011356] [2020-12-23 14:57:33,421 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:57:33,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:57:33,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:57:33,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:57:33,422 INFO L87 Difference]: Start difference. First operand 27433 states and 37432 transitions. Second operand 4 states. [2020-12-23 14:57:39,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:57:39,309 INFO L93 Difference]: Finished difference Result 82295 states and 112291 transitions. [2020-12-23 14:57:39,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 14:57:39,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2020-12-23 14:57:39,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:57:39,407 INFO L225 Difference]: With dead ends: 82295 [2020-12-23 14:57:39,407 INFO L226 Difference]: Without dead ends: 82287 [2020-12-23 14:57:39,426 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:57:39,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82287 states. [2020-12-23 14:57:43,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82287 to 81433. [2020-12-23 14:57:43,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81433 states. [2020-12-23 14:57:43,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81433 states to 81433 states and 111320 transitions. [2020-12-23 14:57:43,794 INFO L78 Accepts]: Start accepts. Automaton has 81433 states and 111320 transitions. Word has length 90 [2020-12-23 14:57:43,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:57:43,795 INFO L481 AbstractCegarLoop]: Abstraction has 81433 states and 111320 transitions. [2020-12-23 14:57:43,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:57:43,795 INFO L276 IsEmpty]: Start isEmpty. Operand 81433 states and 111320 transitions. [2020-12-23 14:57:43,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-12-23 14:57:43,806 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:57:43,806 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:57:44,020 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-12-23 14:57:44,021 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:57:44,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:57:44,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1841486479, now seen corresponding path program 1 times [2020-12-23 14:57:44,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:57:44,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042613729] [2020-12-23 14:57:44,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:57:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:57:45,005 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-23 14:57:45,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042613729] [2020-12-23 14:57:45,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:57:45,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 14:57:45,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107147412] [2020-12-23 14:57:45,007 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 14:57:45,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:57:45,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 14:57:45,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:57:45,014 INFO L87 Difference]: Start difference. First operand 81433 states and 111320 transitions. Second operand 3 states. [2020-12-23 14:57:52,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:57:52,902 INFO L93 Difference]: Finished difference Result 182950 states and 250975 transitions. [2020-12-23 14:57:52,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 14:57:52,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2020-12-23 14:57:52,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:57:53,051 INFO L225 Difference]: With dead ends: 182950 [2020-12-23 14:57:53,052 INFO L226 Difference]: Without dead ends: 101520 [2020-12-23 14:57:53,124 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:57:53,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101520 states. [2020-12-23 14:57:58,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101520 to 101497. [2020-12-23 14:57:58,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101497 states. [2020-12-23 14:57:59,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101497 states to 101497 states and 138628 transitions. [2020-12-23 14:57:59,040 INFO L78 Accepts]: Start accepts. Automaton has 101497 states and 138628 transitions. Word has length 91 [2020-12-23 14:57:59,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:57:59,040 INFO L481 AbstractCegarLoop]: Abstraction has 101497 states and 138628 transitions. [2020-12-23 14:57:59,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 14:57:59,040 INFO L276 IsEmpty]: Start isEmpty. Operand 101497 states and 138628 transitions. [2020-12-23 14:57:59,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-12-23 14:57:59,048 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:57:59,048 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:57:59,048 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 14:57:59,048 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:57:59,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:57:59,048 INFO L82 PathProgramCache]: Analyzing trace with hash 561622801, now seen corresponding path program 1 times [2020-12-23 14:57:59,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:57:59,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290170416] [2020-12-23 14:57:59,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:57:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:57:59,892 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-23 14:57:59,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290170416] [2020-12-23 14:57:59,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:57:59,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 14:57:59,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662221204] [2020-12-23 14:57:59,894 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:57:59,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:57:59,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:57:59,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:57:59,894 INFO L87 Difference]: Start difference. First operand 101497 states and 138628 transitions. Second operand 4 states. [2020-12-23 14:58:07,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:58:07,640 INFO L93 Difference]: Finished difference Result 149301 states and 203538 transitions. [2020-12-23 14:58:07,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 14:58:07,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2020-12-23 14:58:07,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:58:07,823 INFO L225 Difference]: With dead ends: 149301 [2020-12-23 14:58:07,823 INFO L226 Difference]: Without dead ends: 139885 [2020-12-23 14:58:07,854 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:58:07,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139885 states. [2020-12-23 14:58:14,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139885 to 101497. [2020-12-23 14:58:14,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101497 states. [2020-12-23 14:58:14,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101497 states to 101497 states and 138604 transitions. [2020-12-23 14:58:14,466 INFO L78 Accepts]: Start accepts. Automaton has 101497 states and 138604 transitions. Word has length 91 [2020-12-23 14:58:14,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:58:14,466 INFO L481 AbstractCegarLoop]: Abstraction has 101497 states and 138604 transitions. [2020-12-23 14:58:14,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:58:14,466 INFO L276 IsEmpty]: Start isEmpty. Operand 101497 states and 138604 transitions. [2020-12-23 14:58:14,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-12-23 14:58:14,665 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:58:14,665 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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] [2020-12-23 14:58:14,666 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 14:58:14,666 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:58:14,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:58:14,667 INFO L82 PathProgramCache]: Analyzing trace with hash -209702106, now seen corresponding path program 1 times [2020-12-23 14:58:14,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:58:14,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540978836] [2020-12-23 14:58:14,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:58:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:58:15,365 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-12-23 14:58:15,365 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540978836] [2020-12-23 14:58:15,365 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:58:15,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 14:58:15,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756068286] [2020-12-23 14:58:15,367 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 14:58:15,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:58:15,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 14:58:15,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:58:15,368 INFO L87 Difference]: Start difference. First operand 101497 states and 138604 transitions. Second operand 3 states. [2020-12-23 14:58:25,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:58:25,121 INFO L93 Difference]: Finished difference Result 223078 states and 305543 transitions. [2020-12-23 14:58:25,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 14:58:25,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2020-12-23 14:58:25,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:58:25,332 INFO L225 Difference]: With dead ends: 223078 [2020-12-23 14:58:25,332 INFO L226 Difference]: Without dead ends: 121584 [2020-12-23 14:58:25,583 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:58:25,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121584 states. [2020-12-23 14:58:32,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121584 to 121561. [2020-12-23 14:58:32,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121561 states. [2020-12-23 14:58:32,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121561 states to 121561 states and 165912 transitions. [2020-12-23 14:58:32,864 INFO L78 Accepts]: Start accepts. Automaton has 121561 states and 165912 transitions. Word has length 92 [2020-12-23 14:58:32,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:58:32,865 INFO L481 AbstractCegarLoop]: Abstraction has 121561 states and 165912 transitions. [2020-12-23 14:58:32,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 14:58:32,865 INFO L276 IsEmpty]: Start isEmpty. Operand 121561 states and 165912 transitions. [2020-12-23 14:58:32,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-12-23 14:58:32,876 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:58:32,876 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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] [2020-12-23 14:58:32,876 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 14:58:32,876 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:58:32,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:58:32,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1489565784, now seen corresponding path program 1 times [2020-12-23 14:58:32,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:58:32,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532053417] [2020-12-23 14:58:32,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:58:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:58:33,600 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-12-23 14:58:33,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532053417] [2020-12-23 14:58:33,601 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:58:33,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 14:58:33,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781235009] [2020-12-23 14:58:33,602 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 14:58:33,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:58:33,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 14:58:33,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 14:58:33,603 INFO L87 Difference]: Start difference. First operand 121561 states and 165912 transitions. Second operand 4 states. [2020-12-23 14:58:42,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:58:42,869 INFO L93 Difference]: Finished difference Result 169365 states and 230822 transitions. [2020-12-23 14:58:42,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 14:58:42,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2020-12-23 14:58:42,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:58:43,096 INFO L225 Difference]: With dead ends: 169365 [2020-12-23 14:58:43,096 INFO L226 Difference]: Without dead ends: 159949 [2020-12-23 14:58:43,140 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 14:58:43,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159949 states. [2020-12-23 14:58:50,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159949 to 121561. [2020-12-23 14:58:50,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121561 states. [2020-12-23 14:58:50,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121561 states to 121561 states and 165888 transitions. [2020-12-23 14:58:50,863 INFO L78 Accepts]: Start accepts. Automaton has 121561 states and 165888 transitions. Word has length 92 [2020-12-23 14:58:50,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 14:58:50,863 INFO L481 AbstractCegarLoop]: Abstraction has 121561 states and 165888 transitions. [2020-12-23 14:58:50,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 14:58:50,864 INFO L276 IsEmpty]: Start isEmpty. Operand 121561 states and 165888 transitions. [2020-12-23 14:58:50,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-12-23 14:58:50,873 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 14:58:50,873 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 14:58:50,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 14:58:50,874 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 14:58:50,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 14:58:50,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1938932070, now seen corresponding path program 1 times [2020-12-23 14:58:50,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 14:58:50,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611401476] [2020-12-23 14:58:50,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 14:58:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 14:58:51,413 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-23 14:58:51,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611401476] [2020-12-23 14:58:51,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 14:58:51,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 14:58:51,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665610068] [2020-12-23 14:58:51,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 14:58:51,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 14:58:51,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 14:58:51,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:58:51,421 INFO L87 Difference]: Start difference. First operand 121561 states and 165888 transitions. Second operand 3 states. [2020-12-23 14:59:02,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 14:59:02,778 INFO L93 Difference]: Finished difference Result 263206 states and 360111 transitions. [2020-12-23 14:59:02,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 14:59:02,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2020-12-23 14:59:02,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 14:59:03,053 INFO L225 Difference]: With dead ends: 263206 [2020-12-23 14:59:03,053 INFO L226 Difference]: Without dead ends: 141648 [2020-12-23 14:59:03,165 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 14:59:03,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141648 states.