/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-178dd20 [2021-01-07 01:02:48,595 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 01:02:48,601 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 01:02:48,651 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 01:02:48,652 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 01:02:48,658 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 01:02:48,662 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 01:02:48,668 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 01:02:48,672 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 01:02:48,680 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 01:02:48,685 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 01:02:48,686 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 01:02:48,687 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 01:02:48,690 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 01:02:48,692 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 01:02:48,694 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 01:02:48,695 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 01:02:48,700 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 01:02:48,708 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 01:02:48,711 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 01:02:48,714 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 01:02:48,716 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 01:02:48,719 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 01:02:48,721 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 01:02:48,730 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 01:02:48,731 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 01:02:48,731 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 01:02:48,732 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 01:02:48,733 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 01:02:48,737 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 01:02:48,737 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 01:02:48,738 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 01:02:48,740 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 01:02:48,741 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 01:02:48,743 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 01:02:48,743 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 01:02:48,744 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 01:02:48,744 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 01:02:48,744 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 01:02:48,759 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 01:02:48,760 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 01:02:48,761 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-07 01:02:48,822 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 01:02:48,823 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 01:02:48,828 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 01:02:48,828 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 01:02:48,829 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 01:02:48,829 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 01:02:48,829 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 01:02:48,829 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 01:02:48,829 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-07 01:02:48,830 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 01:02:48,831 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-07 01:02:48,831 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-07 01:02:48,831 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 01:02:48,832 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-07 01:02:48,832 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 01:02:48,832 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 01:02:48,832 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 01:02:48,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 01:02:48,833 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 01:02:48,833 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 01:02:48,833 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-07 01:02:48,833 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 01:02:48,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 01:02:48,834 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-07 01:02:48,834 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 01:02:48,834 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-07 01:02:49,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 01:02:49,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 01:02:49,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 01:02:49,315 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 01:02:49,316 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 01:02:49,317 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 [2021-01-07 01:02:49,399 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/f8915e224/3519c4d671414a898c84049acc26cfc4/FLAG2861c736e [2021-01-07 01:02:50,374 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 01:02:50,375 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 [2021-01-07 01:02:50,414 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/f8915e224/3519c4d671414a898c84049acc26cfc4/FLAG2861c736e [2021-01-07 01:02:50,897 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/f8915e224/3519c4d671414a898c84049acc26cfc4 [2021-01-07 01:02:50,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 01:02:50,905 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 01:02:50,909 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 01:02:50,910 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 01:02:50,914 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 01:02:50,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 01:02:50" (1/1) ... [2021-01-07 01:02:50,916 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dd76929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:02:50, skipping insertion in model container [2021-01-07 01:02:50,916 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 01:02:50" (1/1) ... [2021-01-07 01:02:50,930 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 01:02:51,032 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] [2021-01-07 01:02:52,000 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] [2021-01-07 01:02:52,133 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 01:02:52,261 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] [2021-01-07 01:02:52,515 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] [2021-01-07 01:02:52,533 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 01:02:52,936 INFO L208 MainTranslator]: Completed translation [2021-01-07 01:02:52,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:02:52 WrapperNode [2021-01-07 01:02:52,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 01:02:52,939 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 01:02:52,940 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 01:02:52,940 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 01:02:52,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:02:52" (1/1) ... [2021-01-07 01:02:53,085 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:02:52" (1/1) ... [2021-01-07 01:02:53,509 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 01:02:53,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 01:02:53,510 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 01:02:53,510 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 01:02:53,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:02:52" (1/1) ... [2021-01-07 01:02:53,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:02:52" (1/1) ... [2021-01-07 01:02:53,620 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:02:52" (1/1) ... [2021-01-07 01:02:53,620 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:02:52" (1/1) ... [2021-01-07 01:02:53,848 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:02:52" (1/1) ... [2021-01-07 01:02:53,877 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:02:52" (1/1) ... [2021-01-07 01:02:53,920 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:02:52" (1/1) ... [2021-01-07 01:02:54,041 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 01:02:54,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 01:02:54,052 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 01:02:54,052 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 01:02:54,055 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:02:52" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 01:02:54,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 01:02:54,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 01:02:54,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 01:02:54,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 01:02:54,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 01:02:54,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 01:02:54,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 01:02:54,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-01-07 01:02:54,184 INFO L130 BoogieDeclarations]: Found specification of procedure strcspn [2021-01-07 01:02:54,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 01:02:54,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 01:02:54,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 01:03:51,237 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 01:03:51,237 INFO L299 CfgBuilder]: Removed 1211 assume(true) statements. [2021-01-07 01:03:51,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 01:03:51 BoogieIcfgContainer [2021-01-07 01:03:51,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 01:03:51,244 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 01:03:51,244 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 01:03:51,248 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 01:03:51,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 01:02:50" (1/3) ... [2021-01-07 01:03:51,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a39e229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 01:03:51, skipping insertion in model container [2021-01-07 01:03:51,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:02:52" (2/3) ... [2021-01-07 01:03:51,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a39e229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 01:03:51, skipping insertion in model container [2021-01-07 01:03:51,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 01:03:51" (3/3) ... [2021-01-07 01:03:51,252 INFO L111 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--hwmon--abituguru3.ko-main.cil.out.i [2021-01-07 01:03:51,258 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 01:03:51,265 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2021-01-07 01:03:51,286 INFO L253 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2021-01-07 01:03:51,323 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 01:03:51,323 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-07 01:03:51,323 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 01:03:51,324 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 01:03:51,324 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 01:03:51,324 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 01:03:51,324 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 01:03:51,324 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 01:03:51,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states. [2021-01-07 01:03:51,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-01-07 01:03:51,373 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:03:51,374 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:03:51,375 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]=== [2021-01-07 01:03:51,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:03:51,382 INFO L82 PathProgramCache]: Analyzing trace with hash 12375506, now seen corresponding path program 1 times [2021-01-07 01:03:51,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:03:51,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057000598] [2021-01-07 01:03:51,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:03:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:03:52,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:03:52,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057000598] [2021-01-07 01:03:52,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:03:52,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:03:52,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655550756] [2021-01-07 01:03:52,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:03:52,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:03:52,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:03:53,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:03:53,004 INFO L87 Difference]: Start difference. First operand 1381 states. Second operand 3 states. [2021-01-07 01:03:55,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:03:55,850 INFO L93 Difference]: Finished difference Result 4047 states and 5536 transitions. [2021-01-07 01:03:55,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:03:55,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2021-01-07 01:03:55,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:03:55,904 INFO L225 Difference]: With dead ends: 4047 [2021-01-07 01:03:55,904 INFO L226 Difference]: Without dead ends: 2665 [2021-01-07 01:03:55,917 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:03:55,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2665 states. [2021-01-07 01:03:56,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2665 to 2649. [2021-01-07 01:03:56,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2649 states. [2021-01-07 01:03:56,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2649 states to 2649 states and 3593 transitions. [2021-01-07 01:03:56,084 INFO L78 Accepts]: Start accepts. Automaton has 2649 states and 3593 transitions. Word has length 14 [2021-01-07 01:03:56,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:03:56,084 INFO L481 AbstractCegarLoop]: Abstraction has 2649 states and 3593 transitions. [2021-01-07 01:03:56,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:03:56,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2649 states and 3593 transitions. [2021-01-07 01:03:56,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-01-07 01:03:56,086 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:03:56,086 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:03:56,087 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 01:03:56,087 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]=== [2021-01-07 01:03:56,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:03:56,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1358126481, now seen corresponding path program 1 times [2021-01-07 01:03:56,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:03:56,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994014686] [2021-01-07 01:03:56,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:03:56,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:03:57,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:03:57,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994014686] [2021-01-07 01:03:57,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:03:57,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:03:57,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127980511] [2021-01-07 01:03:57,235 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:03:57,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:03:57,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:03:57,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:03:57,237 INFO L87 Difference]: Start difference. First operand 2649 states and 3593 transitions. Second operand 3 states. [2021-01-07 01:03:57,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:03:57,879 INFO L93 Difference]: Finished difference Result 7634 states and 10327 transitions. [2021-01-07 01:03:57,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:03:57,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2021-01-07 01:03:57,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:03:57,907 INFO L225 Difference]: With dead ends: 7634 [2021-01-07 01:03:57,907 INFO L226 Difference]: Without dead ends: 4988 [2021-01-07 01:03:57,914 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:03:57,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2021-01-07 01:03:58,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4972. [2021-01-07 01:03:58,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4972 states. [2021-01-07 01:03:58,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4972 states to 4972 states and 6722 transitions. [2021-01-07 01:03:58,097 INFO L78 Accepts]: Start accepts. Automaton has 4972 states and 6722 transitions. Word has length 15 [2021-01-07 01:03:58,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:03:58,097 INFO L481 AbstractCegarLoop]: Abstraction has 4972 states and 6722 transitions. [2021-01-07 01:03:58,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:03:58,098 INFO L276 IsEmpty]: Start isEmpty. Operand 4972 states and 6722 transitions. [2021-01-07 01:03:58,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-07 01:03:58,105 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:03:58,105 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] [2021-01-07 01:03:58,106 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 01:03:58,107 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]=== [2021-01-07 01:03:58,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:03:58,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1461430461, now seen corresponding path program 1 times [2021-01-07 01:03:58,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:03:58,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44694723] [2021-01-07 01:03:58,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:03:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:03:59,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:03:59,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44694723] [2021-01-07 01:03:59,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:03:59,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 01:03:59,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863775691] [2021-01-07 01:03:59,155 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 01:03:59,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:03:59,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 01:03:59,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 01:03:59,156 INFO L87 Difference]: Start difference. First operand 4972 states and 6722 transitions. Second operand 6 states. [2021-01-07 01:04:00,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:04:00,722 INFO L93 Difference]: Finished difference Result 24702 states and 33402 transitions. [2021-01-07 01:04:00,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 01:04:00,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2021-01-07 01:04:00,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:04:00,854 INFO L225 Difference]: With dead ends: 24702 [2021-01-07 01:04:00,854 INFO L226 Difference]: Without dead ends: 19733 [2021-01-07 01:04:00,873 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 [2021-01-07 01:04:00,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19733 states. [2021-01-07 01:04:01,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19733 to 5014. [2021-01-07 01:04:01,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5014 states. [2021-01-07 01:04:01,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5014 states to 5014 states and 6774 transitions. [2021-01-07 01:04:01,222 INFO L78 Accepts]: Start accepts. Automaton has 5014 states and 6774 transitions. Word has length 23 [2021-01-07 01:04:01,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:04:01,222 INFO L481 AbstractCegarLoop]: Abstraction has 5014 states and 6774 transitions. [2021-01-07 01:04:01,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 01:04:01,223 INFO L276 IsEmpty]: Start isEmpty. Operand 5014 states and 6774 transitions. [2021-01-07 01:04:01,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-07 01:04:01,226 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:04:01,227 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] [2021-01-07 01:04:01,227 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 01:04:01,227 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]=== [2021-01-07 01:04:01,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:04:01,228 INFO L82 PathProgramCache]: Analyzing trace with hash 874624447, now seen corresponding path program 1 times [2021-01-07 01:04:01,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:04:01,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160238276] [2021-01-07 01:04:01,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:04:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:04:02,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:04:02,070 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160238276] [2021-01-07 01:04:02,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:04:02,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:04:02,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480345393] [2021-01-07 01:04:02,072 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:04:02,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:04:02,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:04:02,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:04:02,074 INFO L87 Difference]: Start difference. First operand 5014 states and 6774 transitions. Second operand 3 states. [2021-01-07 01:04:02,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:04:02,688 INFO L93 Difference]: Finished difference Result 5032 states and 6790 transitions. [2021-01-07 01:04:02,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:04:02,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2021-01-07 01:04:02,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:04:02,700 INFO L225 Difference]: With dead ends: 5032 [2021-01-07 01:04:02,700 INFO L226 Difference]: Without dead ends: 5023 [2021-01-07 01:04:02,703 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:04:02,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5023 states. [2021-01-07 01:04:02,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5023 to 5014. [2021-01-07 01:04:02,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5014 states. [2021-01-07 01:04:02,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5014 states to 5014 states and 6773 transitions. [2021-01-07 01:04:02,933 INFO L78 Accepts]: Start accepts. Automaton has 5014 states and 6773 transitions. Word has length 23 [2021-01-07 01:04:02,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:04:02,934 INFO L481 AbstractCegarLoop]: Abstraction has 5014 states and 6773 transitions. [2021-01-07 01:04:02,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:04:02,934 INFO L276 IsEmpty]: Start isEmpty. Operand 5014 states and 6773 transitions. [2021-01-07 01:04:02,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-07 01:04:02,936 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:04:02,936 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] [2021-01-07 01:04:02,936 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-07 01:04:02,936 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]=== [2021-01-07 01:04:02,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:04:02,937 INFO L82 PathProgramCache]: Analyzing trace with hash 874684029, now seen corresponding path program 1 times [2021-01-07 01:04:02,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:04:02,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304986030] [2021-01-07 01:04:02,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:04:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:04:03,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:04:03,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304986030] [2021-01-07 01:04:03,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:04:03,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:04:03,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010493078] [2021-01-07 01:04:03,858 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:04:03,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:04:03,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:04:03,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:04:03,860 INFO L87 Difference]: Start difference. First operand 5014 states and 6773 transitions. Second operand 3 states. [2021-01-07 01:04:06,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:04:06,487 INFO L93 Difference]: Finished difference Result 5014 states and 6773 transitions. [2021-01-07 01:04:06,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:04:06,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2021-01-07 01:04:06,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:04:06,501 INFO L225 Difference]: With dead ends: 5014 [2021-01-07 01:04:06,501 INFO L226 Difference]: Without dead ends: 5012 [2021-01-07 01:04:06,504 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:04:06,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5012 states. [2021-01-07 01:04:06,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5012 to 5012. [2021-01-07 01:04:06,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5012 states. [2021-01-07 01:04:06,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5012 states to 5012 states and 6771 transitions. [2021-01-07 01:04:06,735 INFO L78 Accepts]: Start accepts. Automaton has 5012 states and 6771 transitions. Word has length 23 [2021-01-07 01:04:06,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:04:06,735 INFO L481 AbstractCegarLoop]: Abstraction has 5012 states and 6771 transitions. [2021-01-07 01:04:06,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:04:06,735 INFO L276 IsEmpty]: Start isEmpty. Operand 5012 states and 6771 transitions. [2021-01-07 01:04:06,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-07 01:04:06,736 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:04:06,736 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] [2021-01-07 01:04:06,737 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-07 01:04:06,737 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]=== [2021-01-07 01:04:06,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:04:06,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1345403867, now seen corresponding path program 1 times [2021-01-07 01:04:06,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:04:06,738 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247662587] [2021-01-07 01:04:06,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:04:07,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:04:07,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:04:07,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247662587] [2021-01-07 01:04:07,484 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:04:07,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:04:07,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376620807] [2021-01-07 01:04:07,485 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:04:07,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:04:07,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:04:07,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:04:07,486 INFO L87 Difference]: Start difference. First operand 5012 states and 6771 transitions. Second operand 3 states. [2021-01-07 01:04:10,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:04:10,073 INFO L93 Difference]: Finished difference Result 5012 states and 6771 transitions. [2021-01-07 01:04:10,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:04:10,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2021-01-07 01:04:10,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:04:10,086 INFO L225 Difference]: With dead ends: 5012 [2021-01-07 01:04:10,086 INFO L226 Difference]: Without dead ends: 5010 [2021-01-07 01:04:10,089 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:04:10,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5010 states. [2021-01-07 01:04:10,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5010 to 5010. [2021-01-07 01:04:10,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5010 states. [2021-01-07 01:04:10,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5010 states to 5010 states and 6769 transitions. [2021-01-07 01:04:10,463 INFO L78 Accepts]: Start accepts. Automaton has 5010 states and 6769 transitions. Word has length 24 [2021-01-07 01:04:10,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:04:10,464 INFO L481 AbstractCegarLoop]: Abstraction has 5010 states and 6769 transitions. [2021-01-07 01:04:10,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:04:10,464 INFO L276 IsEmpty]: Start isEmpty. Operand 5010 states and 6769 transitions. [2021-01-07 01:04:10,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-07 01:04:10,465 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:04:10,466 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] [2021-01-07 01:04:10,466 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-07 01:04:10,466 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]=== [2021-01-07 01:04:10,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:04:10,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1242150329, now seen corresponding path program 1 times [2021-01-07 01:04:10,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:04:10,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106636723] [2021-01-07 01:04:10,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:04:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:04:11,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:04:11,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106636723] [2021-01-07 01:04:11,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:04:11,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:04:11,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004597095] [2021-01-07 01:04:11,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:04:11,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:04:11,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:04:11,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:04:11,370 INFO L87 Difference]: Start difference. First operand 5010 states and 6769 transitions. Second operand 3 states. [2021-01-07 01:04:14,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:04:14,153 INFO L93 Difference]: Finished difference Result 11424 states and 15459 transitions. [2021-01-07 01:04:14,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:04:14,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2021-01-07 01:04:14,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:04:14,170 INFO L225 Difference]: With dead ends: 11424 [2021-01-07 01:04:14,170 INFO L226 Difference]: Without dead ends: 6411 [2021-01-07 01:04:14,182 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:04:14,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6411 states. [2021-01-07 01:04:14,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6411 to 6381. [2021-01-07 01:04:14,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6381 states. [2021-01-07 01:04:14,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6381 states to 6381 states and 8637 transitions. [2021-01-07 01:04:14,454 INFO L78 Accepts]: Start accepts. Automaton has 6381 states and 8637 transitions. Word has length 25 [2021-01-07 01:04:14,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:04:14,455 INFO L481 AbstractCegarLoop]: Abstraction has 6381 states and 8637 transitions. [2021-01-07 01:04:14,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:04:14,455 INFO L276 IsEmpty]: Start isEmpty. Operand 6381 states and 8637 transitions. [2021-01-07 01:04:14,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-01-07 01:04:14,456 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:04:14,457 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] [2021-01-07 01:04:14,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-07 01:04:14,457 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]=== [2021-01-07 01:04:14,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:04:14,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1456826833, now seen corresponding path program 1 times [2021-01-07 01:04:14,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:04:14,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081720283] [2021-01-07 01:04:14,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:04:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:04:15,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:04:15,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081720283] [2021-01-07 01:04:15,391 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:04:15,392 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:04:15,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196207776] [2021-01-07 01:04:15,392 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:04:15,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:04:15,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:04:15,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:04:15,394 INFO L87 Difference]: Start difference. First operand 6381 states and 8637 transitions. Second operand 3 states. [2021-01-07 01:04:18,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:04:18,432 INFO L93 Difference]: Finished difference Result 15863 states and 21540 transitions. [2021-01-07 01:04:18,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:04:18,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2021-01-07 01:04:18,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:04:18,459 INFO L225 Difference]: With dead ends: 15863 [2021-01-07 01:04:18,459 INFO L226 Difference]: Without dead ends: 9485 [2021-01-07 01:04:18,471 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:04:18,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9485 states. [2021-01-07 01:04:18,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9485 to 9473. [2021-01-07 01:04:18,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9473 states. [2021-01-07 01:04:18,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9473 states to 9473 states and 12813 transitions. [2021-01-07 01:04:18,867 INFO L78 Accepts]: Start accepts. Automaton has 9473 states and 12813 transitions. Word has length 33 [2021-01-07 01:04:18,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:04:18,868 INFO L481 AbstractCegarLoop]: Abstraction has 9473 states and 12813 transitions. [2021-01-07 01:04:18,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:04:18,868 INFO L276 IsEmpty]: Start isEmpty. Operand 9473 states and 12813 transitions. [2021-01-07 01:04:18,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-07 01:04:18,870 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:04:18,871 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] [2021-01-07 01:04:18,871 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-07 01:04:18,871 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]=== [2021-01-07 01:04:18,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:04:18,872 INFO L82 PathProgramCache]: Analyzing trace with hash -2053211790, now seen corresponding path program 1 times [2021-01-07 01:04:18,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:04:18,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985110490] [2021-01-07 01:04:18,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:04:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:04:19,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 01:04:19,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985110490] [2021-01-07 01:04:19,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:04:19,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:04:19,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582411234] [2021-01-07 01:04:19,551 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:04:19,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:04:19,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:04:19,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:04:19,553 INFO L87 Difference]: Start difference. First operand 9473 states and 12813 transitions. Second operand 3 states. [2021-01-07 01:04:20,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:04:20,419 INFO L93 Difference]: Finished difference Result 20290 states and 27570 transitions. [2021-01-07 01:04:20,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:04:20,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2021-01-07 01:04:20,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:04:20,446 INFO L225 Difference]: With dead ends: 20290 [2021-01-07 01:04:20,446 INFO L226 Difference]: Without dead ends: 10820 [2021-01-07 01:04:20,462 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:04:20,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10820 states. [2021-01-07 01:04:20,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10820 to 10765. [2021-01-07 01:04:20,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10765 states. [2021-01-07 01:04:20,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10765 states to 10765 states and 14697 transitions. [2021-01-07 01:04:20,819 INFO L78 Accepts]: Start accepts. Automaton has 10765 states and 14697 transitions. Word has length 45 [2021-01-07 01:04:20,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:04:20,820 INFO L481 AbstractCegarLoop]: Abstraction has 10765 states and 14697 transitions. [2021-01-07 01:04:20,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:04:20,820 INFO L276 IsEmpty]: Start isEmpty. Operand 10765 states and 14697 transitions. [2021-01-07 01:04:20,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-07 01:04:20,823 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:04:20,823 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] [2021-01-07 01:04:20,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-07 01:04:20,823 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]=== [2021-01-07 01:04:20,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:04:20,824 INFO L82 PathProgramCache]: Analyzing trace with hash -234060580, now seen corresponding path program 1 times [2021-01-07 01:04:20,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:04:20,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355904735] [2021-01-07 01:04:20,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:04:21,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:04:21,560 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 01:04:21,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355904735] [2021-01-07 01:04:21,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:04:21,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:04:21,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506771792] [2021-01-07 01:04:21,563 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:04:21,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:04:21,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:04:21,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:04:21,567 INFO L87 Difference]: Start difference. First operand 10765 states and 14697 transitions. Second operand 3 states. [2021-01-07 01:04:24,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:04:24,683 INFO L93 Difference]: Finished difference Result 25013 states and 34292 transitions. [2021-01-07 01:04:24,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:04:24,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2021-01-07 01:04:24,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:04:24,715 INFO L225 Difference]: With dead ends: 25013 [2021-01-07 01:04:24,715 INFO L226 Difference]: Without dead ends: 14251 [2021-01-07 01:04:24,732 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:04:24,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14251 states. [2021-01-07 01:04:25,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14251 to 14239. [2021-01-07 01:04:25,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14239 states. [2021-01-07 01:04:25,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14239 states to 14239 states and 19421 transitions. [2021-01-07 01:04:25,213 INFO L78 Accepts]: Start accepts. Automaton has 14239 states and 19421 transitions. Word has length 54 [2021-01-07 01:04:25,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:04:25,214 INFO L481 AbstractCegarLoop]: Abstraction has 14239 states and 19421 transitions. [2021-01-07 01:04:25,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:04:25,214 INFO L276 IsEmpty]: Start isEmpty. Operand 14239 states and 19421 transitions. [2021-01-07 01:04:25,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-07 01:04:25,219 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:04:25,219 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:04:25,219 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-07 01:04:25,219 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]=== [2021-01-07 01:04:25,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:04:25,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1153792279, now seen corresponding path program 1 times [2021-01-07 01:04:25,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:04:25,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020154128] [2021-01-07 01:04:25,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:04:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:04:26,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 01:04:26,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020154128] [2021-01-07 01:04:26,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:04:26,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:04:26,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54098177] [2021-01-07 01:04:26,044 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:04:26,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:04:26,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:04:26,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:04:26,046 INFO L87 Difference]: Start difference. First operand 14239 states and 19421 transitions. Second operand 3 states. [2021-01-07 01:04:26,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:04:26,741 INFO L93 Difference]: Finished difference Result 28483 states and 38855 transitions. [2021-01-07 01:04:26,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:04:26,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2021-01-07 01:04:26,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:04:26,767 INFO L225 Difference]: With dead ends: 28483 [2021-01-07 01:04:26,767 INFO L226 Difference]: Without dead ends: 14247 [2021-01-07 01:04:26,789 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:04:26,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14247 states. [2021-01-07 01:04:27,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14247 to 14247. [2021-01-07 01:04:27,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14247 states. [2021-01-07 01:04:27,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14247 states to 14247 states and 19429 transitions. [2021-01-07 01:04:27,299 INFO L78 Accepts]: Start accepts. Automaton has 14247 states and 19429 transitions. Word has length 69 [2021-01-07 01:04:27,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:04:27,299 INFO L481 AbstractCegarLoop]: Abstraction has 14247 states and 19429 transitions. [2021-01-07 01:04:27,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:04:27,299 INFO L276 IsEmpty]: Start isEmpty. Operand 14247 states and 19429 transitions. [2021-01-07 01:04:27,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-07 01:04:27,303 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:04:27,304 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] [2021-01-07 01:04:27,304 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-07 01:04:27,304 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]=== [2021-01-07 01:04:27,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:04:27,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1155639321, now seen corresponding path program 1 times [2021-01-07 01:04:27,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:04:27,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138954347] [2021-01-07 01:04:27,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:04:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:04:28,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 01:04:28,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138954347] [2021-01-07 01:04:28,053 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:04:28,054 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:04:28,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787842113] [2021-01-07 01:04:28,054 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:04:28,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:04:28,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:04:28,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:04:28,055 INFO L87 Difference]: Start difference. First operand 14247 states and 19429 transitions. Second operand 3 states. [2021-01-07 01:04:30,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:04:30,965 INFO L93 Difference]: Finished difference Result 28489 states and 38854 transitions. [2021-01-07 01:04:30,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:04:30,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2021-01-07 01:04:30,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:04:30,985 INFO L225 Difference]: With dead ends: 28489 [2021-01-07 01:04:30,985 INFO L226 Difference]: Without dead ends: 14245 [2021-01-07 01:04:31,000 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:04:31,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14245 states. [2021-01-07 01:04:31,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14245 to 14108. [2021-01-07 01:04:31,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14108 states. [2021-01-07 01:04:31,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14108 states to 14108 states and 19235 transitions. [2021-01-07 01:04:31,722 INFO L78 Accepts]: Start accepts. Automaton has 14108 states and 19235 transitions. Word has length 69 [2021-01-07 01:04:31,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:04:31,722 INFO L481 AbstractCegarLoop]: Abstraction has 14108 states and 19235 transitions. [2021-01-07 01:04:31,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:04:31,722 INFO L276 IsEmpty]: Start isEmpty. Operand 14108 states and 19235 transitions. [2021-01-07 01:04:31,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-07 01:04:31,729 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:04:31,729 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] [2021-01-07 01:04:31,729 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-07 01:04:31,729 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]=== [2021-01-07 01:04:31,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:04:31,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1383268386, now seen corresponding path program 1 times [2021-01-07 01:04:31,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:04:31,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390999620] [2021-01-07 01:04:31,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:04:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:04:32,568 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-07 01:04:32,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390999620] [2021-01-07 01:04:32,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853053404] [2021-01-07 01:04:32,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:04:37,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:04:37,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 12893 conjuncts, 7 conjunts are in the unsatisfiable core [2021-01-07 01:04:37,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:04:37,946 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-01-07 01:04:37,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 01:04:37,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2021-01-07 01:04:37,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492702832] [2021-01-07 01:04:37,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 01:04:37,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:04:37,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 01:04:37,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-01-07 01:04:37,949 INFO L87 Difference]: Start difference. First operand 14108 states and 19235 transitions. Second operand 8 states. [2021-01-07 01:04:40,994 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2021-01-07 01:04:43,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:04:43,043 INFO L93 Difference]: Finished difference Result 41811 states and 57055 transitions. [2021-01-07 01:04:43,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 01:04:43,044 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2021-01-07 01:04:43,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:04:43,134 INFO L225 Difference]: With dead ends: 41811 [2021-01-07 01:04:43,134 INFO L226 Difference]: Without dead ends: 27666 [2021-01-07 01:04:43,158 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-01-07 01:04:43,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27666 states. [2021-01-07 01:04:44,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27666 to 14113. [2021-01-07 01:04:44,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14113 states. [2021-01-07 01:04:44,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14113 states to 14113 states and 19216 transitions. [2021-01-07 01:04:44,291 INFO L78 Accepts]: Start accepts. Automaton has 14113 states and 19216 transitions. Word has length 73 [2021-01-07 01:04:44,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:04:44,291 INFO L481 AbstractCegarLoop]: Abstraction has 14113 states and 19216 transitions. [2021-01-07 01:04:44,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 01:04:44,292 INFO L276 IsEmpty]: Start isEmpty. Operand 14113 states and 19216 transitions. [2021-01-07 01:04:44,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-07 01:04:44,296 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:04:44,296 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] [2021-01-07 01:04:44,510 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-01-07 01:04:44,511 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]=== [2021-01-07 01:04:44,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:04:44,512 INFO L82 PathProgramCache]: Analyzing trace with hash -860246004, now seen corresponding path program 1 times [2021-01-07 01:04:44,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:04:44,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387972636] [2021-01-07 01:04:44,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:04:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:04:45,251 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-01-07 01:04:45,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387972636] [2021-01-07 01:04:45,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:04:45,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 01:04:45,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767281762] [2021-01-07 01:04:45,253 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:04:45,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:04:45,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:04:45,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:04:45,255 INFO L87 Difference]: Start difference. First operand 14113 states and 19216 transitions. Second operand 4 states. [2021-01-07 01:04:47,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:04:47,629 INFO L93 Difference]: Finished difference Result 67691 states and 92366 transitions. [2021-01-07 01:04:47,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 01:04:47,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2021-01-07 01:04:47,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:04:47,707 INFO L225 Difference]: With dead ends: 67691 [2021-01-07 01:04:47,707 INFO L226 Difference]: Without dead ends: 53581 [2021-01-07 01:04:47,736 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:04:47,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53581 states. [2021-01-07 01:04:49,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53581 to 14129. [2021-01-07 01:04:49,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14129 states. [2021-01-07 01:04:49,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14129 states to 14129 states and 19232 transitions. [2021-01-07 01:04:49,098 INFO L78 Accepts]: Start accepts. Automaton has 14129 states and 19232 transitions. Word has length 85 [2021-01-07 01:04:49,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:04:49,098 INFO L481 AbstractCegarLoop]: Abstraction has 14129 states and 19232 transitions. [2021-01-07 01:04:49,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:04:49,098 INFO L276 IsEmpty]: Start isEmpty. Operand 14129 states and 19232 transitions. [2021-01-07 01:04:49,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-07 01:04:49,103 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:04:49,104 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] [2021-01-07 01:04:49,104 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-07 01:04:49,104 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]=== [2021-01-07 01:04:49,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:04:49,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1508724510, now seen corresponding path program 1 times [2021-01-07 01:04:49,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:04:49,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832399508] [2021-01-07 01:04:49,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:04:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:04:50,146 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-01-07 01:04:50,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832399508] [2021-01-07 01:04:50,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:04:50,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:04:50,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365622979] [2021-01-07 01:04:50,150 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:04:50,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:04:50,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:04:50,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:04:50,151 INFO L87 Difference]: Start difference. First operand 14129 states and 19232 transitions. Second operand 3 states. [2021-01-07 01:04:54,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:04:54,260 INFO L93 Difference]: Finished difference Result 41768 states and 56925 transitions. [2021-01-07 01:04:54,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:04:54,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2021-01-07 01:04:54,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:04:54,300 INFO L225 Difference]: With dead ends: 41768 [2021-01-07 01:04:54,300 INFO L226 Difference]: Without dead ends: 27642 [2021-01-07 01:04:54,315 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:04:54,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27642 states. [2021-01-07 01:04:55,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27642 to 27433. [2021-01-07 01:04:55,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27433 states. [2021-01-07 01:04:56,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27433 states to 27433 states and 37432 transitions. [2021-01-07 01:04:56,039 INFO L78 Accepts]: Start accepts. Automaton has 27433 states and 37432 transitions. Word has length 87 [2021-01-07 01:04:56,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:04:56,039 INFO L481 AbstractCegarLoop]: Abstraction has 27433 states and 37432 transitions. [2021-01-07 01:04:56,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:04:56,039 INFO L276 IsEmpty]: Start isEmpty. Operand 27433 states and 37432 transitions. [2021-01-07 01:04:56,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-07 01:04:56,047 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:04:56,047 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] [2021-01-07 01:04:56,047 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-07 01:04:56,048 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]=== [2021-01-07 01:04:56,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:04:56,048 INFO L82 PathProgramCache]: Analyzing trace with hash 962307733, now seen corresponding path program 1 times [2021-01-07 01:04:56,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:04:56,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063277907] [2021-01-07 01:04:56,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:04:56,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:04:57,209 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-07 01:04:57,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063277907] [2021-01-07 01:04:57,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317695957] [2021-01-07 01:04:57,210 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 [2021-01-07 01:05:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:05:02,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 12994 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 01:05:02,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:05:02,627 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-07 01:05:02,628 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 01:05:02,628 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-01-07 01:05:02,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168563869] [2021-01-07 01:05:02,629 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:05:02,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:05:02,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:05:02,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:05:02,630 INFO L87 Difference]: Start difference. First operand 27433 states and 37432 transitions. Second operand 4 states. [2021-01-07 01:05:09,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:05:09,395 INFO L93 Difference]: Finished difference Result 82295 states and 112291 transitions. [2021-01-07 01:05:09,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 01:05:09,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2021-01-07 01:05:09,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:05:09,508 INFO L225 Difference]: With dead ends: 82295 [2021-01-07 01:05:09,508 INFO L226 Difference]: Without dead ends: 82287 [2021-01-07 01:05:09,528 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 [2021-01-07 01:05:09,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82287 states. [2021-01-07 01:05:14,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82287 to 81433. [2021-01-07 01:05:14,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81433 states. [2021-01-07 01:05:14,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81433 states to 81433 states and 111320 transitions. [2021-01-07 01:05:14,274 INFO L78 Accepts]: Start accepts. Automaton has 81433 states and 111320 transitions. Word has length 90 [2021-01-07 01:05:14,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:05:14,275 INFO L481 AbstractCegarLoop]: Abstraction has 81433 states and 111320 transitions. [2021-01-07 01:05:14,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:05:14,275 INFO L276 IsEmpty]: Start isEmpty. Operand 81433 states and 111320 transitions. [2021-01-07 01:05:14,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-01-07 01:05:14,286 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:05:14,286 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] [2021-01-07 01:05:14,486 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-01-07 01:05:14,488 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]=== [2021-01-07 01:05:14,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:05:14,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1841486479, now seen corresponding path program 1 times [2021-01-07 01:05:14,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:05:14,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477733053] [2021-01-07 01:05:14,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:05:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:05:15,289 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-01-07 01:05:15,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477733053] [2021-01-07 01:05:15,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:05:15,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:05:15,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36573370] [2021-01-07 01:05:15,291 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:05:15,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:05:15,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:05:15,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:05:15,296 INFO L87 Difference]: Start difference. First operand 81433 states and 111320 transitions. Second operand 3 states. [2021-01-07 01:05:23,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:05:23,610 INFO L93 Difference]: Finished difference Result 182950 states and 250975 transitions. [2021-01-07 01:05:23,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:05:23,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2021-01-07 01:05:23,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:05:23,766 INFO L225 Difference]: With dead ends: 182950 [2021-01-07 01:05:23,766 INFO L226 Difference]: Without dead ends: 101520 [2021-01-07 01:05:23,844 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:05:23,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101520 states. [2021-01-07 01:05:29,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101520 to 101497. [2021-01-07 01:05:29,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101497 states. [2021-01-07 01:05:30,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101497 states to 101497 states and 138628 transitions. [2021-01-07 01:05:30,128 INFO L78 Accepts]: Start accepts. Automaton has 101497 states and 138628 transitions. Word has length 91 [2021-01-07 01:05:30,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:05:30,128 INFO L481 AbstractCegarLoop]: Abstraction has 101497 states and 138628 transitions. [2021-01-07 01:05:30,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:05:30,128 INFO L276 IsEmpty]: Start isEmpty. Operand 101497 states and 138628 transitions. [2021-01-07 01:05:30,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-01-07 01:05:30,136 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:05:30,136 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] [2021-01-07 01:05:30,137 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-07 01:05:30,137 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]=== [2021-01-07 01:05:30,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:05:30,137 INFO L82 PathProgramCache]: Analyzing trace with hash 561622801, now seen corresponding path program 1 times [2021-01-07 01:05:30,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:05:30,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887921281] [2021-01-07 01:05:30,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:05:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:05:30,975 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-01-07 01:05:30,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887921281] [2021-01-07 01:05:30,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:05:30,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 01:05:30,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377503979] [2021-01-07 01:05:30,979 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:05:30,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:05:30,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:05:30,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:05:30,980 INFO L87 Difference]: Start difference. First operand 101497 states and 138628 transitions. Second operand 4 states. [2021-01-07 01:05:38,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:05:38,777 INFO L93 Difference]: Finished difference Result 149301 states and 203538 transitions. [2021-01-07 01:05:38,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 01:05:38,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2021-01-07 01:05:38,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:05:39,095 INFO L225 Difference]: With dead ends: 149301 [2021-01-07 01:05:39,096 INFO L226 Difference]: Without dead ends: 139885 [2021-01-07 01:05:39,130 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:05:39,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139885 states. [2021-01-07 01:05:45,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139885 to 101497. [2021-01-07 01:05:45,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101497 states. [2021-01-07 01:05:45,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101497 states to 101497 states and 138604 transitions. [2021-01-07 01:05:45,404 INFO L78 Accepts]: Start accepts. Automaton has 101497 states and 138604 transitions. Word has length 91 [2021-01-07 01:05:45,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:05:45,404 INFO L481 AbstractCegarLoop]: Abstraction has 101497 states and 138604 transitions. [2021-01-07 01:05:45,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:05:45,405 INFO L276 IsEmpty]: Start isEmpty. Operand 101497 states and 138604 transitions. [2021-01-07 01:05:45,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-07 01:05:45,413 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:05:45,413 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] [2021-01-07 01:05:45,413 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-07 01:05:45,414 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]=== [2021-01-07 01:05:45,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:05:45,414 INFO L82 PathProgramCache]: Analyzing trace with hash -209702106, now seen corresponding path program 1 times [2021-01-07 01:05:45,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:05:45,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363775176] [2021-01-07 01:05:45,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:05:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:05:46,286 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-01-07 01:05:46,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363775176] [2021-01-07 01:05:46,286 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:05:46,286 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:05:46,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166453233] [2021-01-07 01:05:46,287 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:05:46,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:05:46,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:05:46,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:05:46,288 INFO L87 Difference]: Start difference. First operand 101497 states and 138604 transitions. Second operand 3 states. [2021-01-07 01:05:56,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:05:56,279 INFO L93 Difference]: Finished difference Result 223078 states and 305543 transitions. [2021-01-07 01:05:56,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:05:56,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2021-01-07 01:05:56,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:05:56,494 INFO L225 Difference]: With dead ends: 223078 [2021-01-07 01:05:56,495 INFO L226 Difference]: Without dead ends: 121584 [2021-01-07 01:05:56,572 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:05:56,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121584 states. [2021-01-07 01:06:04,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121584 to 121561. [2021-01-07 01:06:04,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121561 states. [2021-01-07 01:06:04,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121561 states to 121561 states and 165912 transitions. [2021-01-07 01:06:04,421 INFO L78 Accepts]: Start accepts. Automaton has 121561 states and 165912 transitions. Word has length 92 [2021-01-07 01:06:04,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:06:04,421 INFO L481 AbstractCegarLoop]: Abstraction has 121561 states and 165912 transitions. [2021-01-07 01:06:04,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:06:04,422 INFO L276 IsEmpty]: Start isEmpty. Operand 121561 states and 165912 transitions. [2021-01-07 01:06:04,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-07 01:06:04,431 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:06:04,431 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] [2021-01-07 01:06:04,431 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-07 01:06:04,431 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]=== [2021-01-07 01:06:04,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:06:04,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1489565784, now seen corresponding path program 1 times [2021-01-07 01:06:04,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:06:04,434 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520228334] [2021-01-07 01:06:04,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:06:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:06:05,190 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-01-07 01:06:05,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520228334] [2021-01-07 01:06:05,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:06:05,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 01:06:05,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019803870] [2021-01-07 01:06:05,192 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:06:05,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:06:05,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:06:05,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:06:05,196 INFO L87 Difference]: Start difference. First operand 121561 states and 165912 transitions. Second operand 4 states. [2021-01-07 01:06:15,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:06:15,192 INFO L93 Difference]: Finished difference Result 169365 states and 230822 transitions. [2021-01-07 01:06:15,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 01:06:15,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2021-01-07 01:06:15,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:06:15,577 INFO L225 Difference]: With dead ends: 169365 [2021-01-07 01:06:15,578 INFO L226 Difference]: Without dead ends: 159949 [2021-01-07 01:06:15,627 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:06:15,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159949 states. [2021-01-07 01:06:23,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159949 to 121561. [2021-01-07 01:06:23,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121561 states. [2021-01-07 01:06:23,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121561 states to 121561 states and 165888 transitions. [2021-01-07 01:06:23,443 INFO L78 Accepts]: Start accepts. Automaton has 121561 states and 165888 transitions. Word has length 92 [2021-01-07 01:06:23,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:06:23,443 INFO L481 AbstractCegarLoop]: Abstraction has 121561 states and 165888 transitions. [2021-01-07 01:06:23,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:06:23,443 INFO L276 IsEmpty]: Start isEmpty. Operand 121561 states and 165888 transitions. [2021-01-07 01:06:23,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-01-07 01:06:23,675 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:06:23,675 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] [2021-01-07 01:06:23,675 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-07 01:06:23,675 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]=== [2021-01-07 01:06:23,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:06:23,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1938932070, now seen corresponding path program 1 times [2021-01-07 01:06:23,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:06:23,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458130840] [2021-01-07 01:06:23,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:06:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:06:24,181 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-01-07 01:06:24,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458130840] [2021-01-07 01:06:24,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:06:24,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:06:24,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704289853] [2021-01-07 01:06:24,183 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:06:24,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:06:24,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:06:24,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:06:24,183 INFO L87 Difference]: Start difference. First operand 121561 states and 165888 transitions. Second operand 3 states.