/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru3.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 02:01:10,903 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 02:01:10,910 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 02:01:10,969 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 02:01:10,970 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 02:01:10,974 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 02:01:10,978 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 02:01:10,984 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 02:01:10,988 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 02:01:10,997 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 02:01:11,002 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 02:01:11,004 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 02:01:11,004 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 02:01:11,005 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 02:01:11,006 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 02:01:11,008 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 02:01:11,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 02:01:11,010 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 02:01:11,032 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 02:01:11,040 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 02:01:11,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 02:01:11,049 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 02:01:11,050 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 02:01:11,051 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 02:01:11,054 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 02:01:11,054 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 02:01:11,055 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 02:01:11,056 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 02:01:11,056 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 02:01:11,058 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 02:01:11,058 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 02:01:11,059 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 02:01:11,060 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 02:01:11,061 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 02:01:11,062 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 02:01:11,063 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 02:01:11,064 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 02:01:11,064 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 02:01:11,064 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 02:01:11,065 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 02:01:11,066 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 02:01:11,067 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 02:01:11,094 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 02:01:11,095 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 02:01:11,096 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 02:01:11,096 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 02:01:11,097 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 02:01:11,097 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 02:01:11,097 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 02:01:11,097 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 02:01:11,098 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-07 02:01:11,098 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 02:01:11,098 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-07 02:01:11,098 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-07 02:01:11,098 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 02:01:11,099 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-07 02:01:11,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 02:01:11,099 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 02:01:11,099 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 02:01:11,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 02:01:11,100 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 02:01:11,100 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 02:01:11,100 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-07 02:01:11,100 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 02:01:11,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 02:01:11,101 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-07 02:01:11,101 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 02:01:11,101 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-07 02:01:11,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 02:01:11,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 02:01:11,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 02:01:11,564 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 02:01:11,565 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 02:01:11,566 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru3.ko-entry_point.cil.out.i [2021-01-07 02:01:11,667 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/879e3b950/df312cab8d30405ba01f8f6e70bb5116/FLAGe801beeec [2021-01-07 02:01:12,793 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 02:01:12,794 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru3.ko-entry_point.cil.out.i [2021-01-07 02:01:12,839 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/879e3b950/df312cab8d30405ba01f8f6e70bb5116/FLAGe801beeec [2021-01-07 02:01:13,255 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/879e3b950/df312cab8d30405ba01f8f6e70bb5116 [2021-01-07 02:01:13,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 02:01:13,260 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 02:01:13,262 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 02:01:13,262 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 02:01:13,266 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 02:01:13,267 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 02:01:13" (1/1) ... [2021-01-07 02:01:13,269 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f41ee6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 02:01:13, skipping insertion in model container [2021-01-07 02:01:13,269 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 02:01:13" (1/1) ... [2021-01-07 02:01:13,277 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 02:01:13,369 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~p~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~p~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~value~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[477],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] 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: StructLHS[VariableLHS[~descriptor~0,],modname] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~0,],function] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~0,],filename] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~0,],format] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~0,],lineno] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~0,],flags] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~x~2,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___0~0,],modname] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___0~0,],function] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___0~0,],filename] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___0~0,],format] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___0~0,],lineno] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___0~0,],flags] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~x~2,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___1~0,],modname] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___1~0,],function] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___1~0,],filename] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___1~0,],format] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___1~0,],lineno] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___1~0,],flags] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~x~2,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___2~0,],modname] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___2~0,],function] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___2~0,],filename] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___2~0,],format] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___2~0,],lineno] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___2~0,],flags] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~x~2,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___3~0,],modname] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___3~0,],function] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___3~0,],filename] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___3~0,],format] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___3~0,],lineno] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___3~0,],flags] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~timeout~2,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___4~0,],modname] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___4~0,],function] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___4~0,],filename] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___4~0,],format] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___4~0,],lineno] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___4~0,],flags] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~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: StructLHS[VariableLHS[~descriptor~1,],modname] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~1,],function] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~1,],filename] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~1,],format] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~1,],lineno] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~1,],flags] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~x~3,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___0~1,],modname] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___0~1,],function] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___0~1,],filename] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___0~1,],format] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___0~1,],lineno] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___0~1,],flags] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~x~3,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___1~1,],modname] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___1~1,],function] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___1~1,],filename] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___1~1,],format] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___1~1,],lineno] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___1~1,],flags] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~x~3,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___2~1,],modname] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___2~1,],function] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___2~1,],filename] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___2~1,],format] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___2~1,],lineno] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___2~1,],flags] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] 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: lhs: StructLHS[VariableLHS[~descriptor___3~1,],modname] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___3~1,],function] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___3~1,],filename] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___3~1,],format] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___3~1,],lineno] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor___3~1,],flags] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] 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~11,] 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~4,] 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~12,] 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~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] 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~13,] left hand side expression in assignment: lhs: VariableLHS[~data~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] 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~14,] left hand side expression in assignment: lhs: VariableLHS[~data~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] 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~16,] left hand side expression in assignment: lhs: VariableLHS[~data~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~4,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[156],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~4,] 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[15175],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~2,] 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[167],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[167],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[167],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~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___4~1,] 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~1,] 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~17,] 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~18,] 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[158],StructAccessExpression[IdentifierExpression[~data~6,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~3,] 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~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~2,] 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[159],StructAccessExpression[IdentifierExpression[~data~6,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~6,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[158],StructAccessExpression[IdentifierExpression[~data~6,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~data~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~data~8,] 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~21,] 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___0~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~6,] 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~22,] left hand side expression in assignment: lhs: VariableLHS[~data_val~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~11,] left hand side expression in assignment: lhs: VariableLHS[~cmd_val~0,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~2,],modname] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~2,],function] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~2,],filename] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~2,],format] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~2,],lineno] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~descriptor~2,],flags] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~7,] 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[~err~2,] left hand side expression in assignment: lhs: VariableLHS[~probed_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] left hand side expression in assignment: lhs: VariableLHS[~abituguru3_pm_group1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~24,] left hand side expression in assignment: lhs: VariableLHS[~abituguru3_driver_group1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~25,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~12,] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_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[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~probed_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~probed_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~probed_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~8,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~4,] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_21~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_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[~ref_cnt~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[~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_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~26,] left hand side expression in assignment: lhs: VariableLHS[~tmp~27,] left hand side expression in assignment: lhs: VariableLHS[~tmp~28,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp~29,] 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 02:01:14,755 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru3.ko-entry_point.cil.out.i[192198,192211] left hand side expression in assignment: lhs: VariableLHS[~tmp~30,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp~31,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~14,] 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[~tmp~32,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp~33,] 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[~tmp~34,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp~35,] 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[~tmp~36,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~17,] left hand side expression in assignment: lhs: VariableLHS[~tmp~37,] [2021-01-07 02:01:14,899 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 02:01:15,032 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~p~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~p~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~value~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~dev,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[477],StructAccessExpression[IdentifierExpression[~dev,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] 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: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~0,],base],StructAccessExpression[IdentifierExpression[~#descriptor~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#descriptor~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~#descriptor~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~#descriptor~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~#descriptor~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~#descriptor~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~x~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___0~0,],base],StructAccessExpression[IdentifierExpression[~#descriptor___0~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#descriptor___0~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~#descriptor___0~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~#descriptor___0~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~#descriptor___0~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~#descriptor___0~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~x~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___1~0,],base],StructAccessExpression[IdentifierExpression[~#descriptor___1~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___1~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#descriptor___1~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___1~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~#descriptor___1~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___1~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~#descriptor___1~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___1~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~#descriptor___1~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___1~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~#descriptor___1~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~x~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___2~0,],base],StructAccessExpression[IdentifierExpression[~#descriptor___2~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___2~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#descriptor___2~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___2~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~#descriptor___2~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___2~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~#descriptor___2~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___2~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~#descriptor___2~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___2~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~#descriptor___2~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~x~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___3~0,],base],StructAccessExpression[IdentifierExpression[~#descriptor___3~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___3~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#descriptor___3~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___3~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~#descriptor___3~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___3~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~#descriptor___3~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___3~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~#descriptor___3~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___3~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~#descriptor___3~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~timeout~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___4~0,],base],StructAccessExpression[IdentifierExpression[~#descriptor___4~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___4~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#descriptor___4~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___4~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~#descriptor___4~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___4~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~#descriptor___4~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___4~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~#descriptor___4~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___4~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~#descriptor___4~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~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: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~1,],base],StructAccessExpression[IdentifierExpression[~#descriptor~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#descriptor~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~#descriptor~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~#descriptor~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~#descriptor~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~#descriptor~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~x~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___0~1,],base],StructAccessExpression[IdentifierExpression[~#descriptor___0~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___0~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#descriptor___0~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___0~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~#descriptor___0~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___0~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~#descriptor___0~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___0~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~#descriptor___0~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___0~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~#descriptor___0~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~x~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___1~1,],base],StructAccessExpression[IdentifierExpression[~#descriptor___1~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___1~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#descriptor___1~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___1~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~#descriptor___1~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___1~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~#descriptor___1~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___1~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~#descriptor___1~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___1~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~#descriptor___1~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~x~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___2~1,],base],StructAccessExpression[IdentifierExpression[~#descriptor___2~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___2~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#descriptor___2~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___2~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~#descriptor___2~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___2~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~#descriptor___2~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___2~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~#descriptor___2~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___2~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~#descriptor___2~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] 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[~#descriptor___3~1,],base],StructAccessExpression[IdentifierExpression[~#descriptor___3~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___3~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#descriptor___3~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___3~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~#descriptor___3~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___3~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~#descriptor___3~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___3~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~#descriptor___3~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor___3~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~#descriptor___3~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] 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~11,] 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~4,] 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~12,] 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~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] 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~13,] left hand side expression in assignment: lhs: VariableLHS[~data~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] 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~14,] left hand side expression in assignment: lhs: VariableLHS[~data~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] 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~16,] left hand side expression in assignment: lhs: VariableLHS[~data~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~4,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[156],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~4,] 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[15175],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~2,] 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[167],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[167],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[167],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~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___4~1,] 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~1,] 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~17,] 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~18,] 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[158],StructAccessExpression[IdentifierExpression[~data~6,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~3,] 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~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~2,] 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[159],StructAccessExpression[IdentifierExpression[~data~6,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~6,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[158],StructAccessExpression[IdentifierExpression[~data~6,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~data~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~data~8,] 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~21,] 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___0~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~6,] 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~22,] left hand side expression in assignment: lhs: VariableLHS[~data_val~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~11,] left hand side expression in assignment: lhs: VariableLHS[~cmd_val~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~2,],base],StructAccessExpression[IdentifierExpression[~#descriptor~2,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#descriptor~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~#descriptor~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~#descriptor~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~#descriptor~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#descriptor~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~#descriptor~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~7,] 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[~err~2,] left hand side expression in assignment: lhs: VariableLHS[~probed_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] left hand side expression in assignment: lhs: VariableLHS[~abituguru3_pm_group1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~24,] left hand side expression in assignment: lhs: VariableLHS[~abituguru3_driver_group1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~25,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~12,] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_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[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~probed_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~probed_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~probed_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~8,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~4,] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_21~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_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[~ref_cnt~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[~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_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~26,] left hand side expression in assignment: lhs: VariableLHS[~tmp~27,] left hand side expression in assignment: lhs: VariableLHS[~tmp~28,] left hand side expression in assignment: lhs: VariableLHS[~ldv_func_res~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp~29,] 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 02:01:15,458 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru3.ko-entry_point.cil.out.i[192198,192211] left hand side expression in assignment: lhs: VariableLHS[~tmp~30,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp~31,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~14,] 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[~tmp~32,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp~33,] 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[~tmp~34,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp~35,] 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[~tmp~36,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~17,] left hand side expression in assignment: lhs: VariableLHS[~tmp~37,] [2021-01-07 02:01:15,496 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 02:01:15,864 INFO L208 MainTranslator]: Completed translation [2021-01-07 02:01:15,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 02:01:15 WrapperNode [2021-01-07 02:01:15,865 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 02:01:15,866 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 02:01:15,867 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 02:01:15,867 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 02:01:15,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 02:01:15" (1/1) ... [2021-01-07 02:01:16,039 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 02:01:15" (1/1) ... [2021-01-07 02:01:16,596 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 02:01:16,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 02:01:16,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 02:01:16,601 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 02:01:16,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 02:01:15" (1/1) ... [2021-01-07 02:01:16,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 02:01:15" (1/1) ... [2021-01-07 02:01:16,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 02:01:15" (1/1) ... [2021-01-07 02:01:16,785 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 02:01:15" (1/1) ... [2021-01-07 02:01:17,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 02:01:15" (1/1) ... [2021-01-07 02:01:17,213 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 02:01:15" (1/1) ... [2021-01-07 02:01:17,284 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 02:01:15" (1/1) ... [2021-01-07 02:01:17,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 02:01:17,366 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 02:01:17,366 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 02:01:17,366 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 02:01:17,367 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 02:01:15" (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 02:01:17,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 02:01:17,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 02:01:17,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 02:01:17,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 02:01:17,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 02:01:17,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 02:01:17,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 02:01:17,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-01-07 02:01:17,565 INFO L130 BoogieDeclarations]: Found specification of procedure strcspn [2021-01-07 02:01:17,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 02:01:17,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 02:01:17,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 02:02:28,640 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 02:02:28,641 INFO L299 CfgBuilder]: Removed 1329 assume(true) statements. [2021-01-07 02:02:28,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 02:02:28 BoogieIcfgContainer [2021-01-07 02:02:28,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 02:02:28,650 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 02:02:28,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 02:02:28,654 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 02:02:28,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 02:01:13" (1/3) ... [2021-01-07 02:02:28,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e80538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 02:02:28, skipping insertion in model container [2021-01-07 02:02:28,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 02:01:15" (2/3) ... [2021-01-07 02:02:28,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e80538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 02:02:28, skipping insertion in model container [2021-01-07 02:02:28,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 02:02:28" (3/3) ... [2021-01-07 02:02:28,658 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru3.ko-entry_point.cil.out.i [2021-01-07 02:02:28,670 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 02:02:28,677 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2021-01-07 02:02:28,699 INFO L253 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2021-01-07 02:02:28,740 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 02:02:28,740 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-07 02:02:28,740 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 02:02:28,741 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 02:02:28,741 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 02:02:28,741 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 02:02:28,741 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 02:02:28,741 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 02:02:28,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states. [2021-01-07 02:02:28,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-01-07 02:02:28,795 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 02:02:28,796 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 02:02:28,796 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 02:02:28,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 02:02:28,806 INFO L82 PathProgramCache]: Analyzing trace with hash 754127617, now seen corresponding path program 1 times [2021-01-07 02:02:28,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 02:02:28,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367651246] [2021-01-07 02:02:28,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 02:02:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 02:02:30,763 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 02:02:30,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367651246] [2021-01-07 02:02:30,766 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 02:02:30,766 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 02:02:30,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547150725] [2021-01-07 02:02:30,773 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 02:02:30,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 02:02:30,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 02:02:30,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 02:02:30,798 INFO L87 Difference]: Start difference. First operand 1424 states. Second operand 3 states. [2021-01-07 02:02:31,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 02:02:31,714 INFO L93 Difference]: Finished difference Result 4138 states and 5781 transitions. [2021-01-07 02:02:31,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 02:02:31,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2021-01-07 02:02:31,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 02:02:31,752 INFO L225 Difference]: With dead ends: 4138 [2021-01-07 02:02:31,752 INFO L226 Difference]: Without dead ends: 2702 [2021-01-07 02:02:31,762 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 02:02:31,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2021-01-07 02:02:31,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 2686. [2021-01-07 02:02:31,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2686 states. [2021-01-07 02:02:31,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2686 states to 2686 states and 3711 transitions. [2021-01-07 02:02:31,959 INFO L78 Accepts]: Start accepts. Automaton has 2686 states and 3711 transitions. Word has length 13 [2021-01-07 02:02:31,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 02:02:31,959 INFO L481 AbstractCegarLoop]: Abstraction has 2686 states and 3711 transitions. [2021-01-07 02:02:31,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 02:02:31,960 INFO L276 IsEmpty]: Start isEmpty. Operand 2686 states and 3711 transitions. [2021-01-07 02:02:31,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-01-07 02:02:31,962 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 02:02:31,963 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 02:02:31,963 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 02:02:31,964 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 02:02:31,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 02:02:31,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1936008622, now seen corresponding path program 1 times [2021-01-07 02:02:31,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 02:02:31,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650226544] [2021-01-07 02:02:31,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 02:02:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 02:02:33,119 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 02:02:33,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650226544] [2021-01-07 02:02:33,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 02:02:33,120 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 02:02:33,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821701063] [2021-01-07 02:02:33,122 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 02:02:33,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 02:02:33,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 02:02:33,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 02:02:33,124 INFO L87 Difference]: Start difference. First operand 2686 states and 3711 transitions. Second operand 3 states. [2021-01-07 02:02:35,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 02:02:35,820 INFO L93 Difference]: Finished difference Result 7866 states and 10890 transitions. [2021-01-07 02:02:35,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 02:02:35,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2021-01-07 02:02:35,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 02:02:35,852 INFO L225 Difference]: With dead ends: 7866 [2021-01-07 02:02:35,853 INFO L226 Difference]: Without dead ends: 5183 [2021-01-07 02:02:35,861 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 02:02:35,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5183 states. [2021-01-07 02:02:36,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5183 to 5167. [2021-01-07 02:02:36,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5167 states. [2021-01-07 02:02:36,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5167 states to 5167 states and 7168 transitions. [2021-01-07 02:02:36,068 INFO L78 Accepts]: Start accepts. Automaton has 5167 states and 7168 transitions. Word has length 14 [2021-01-07 02:02:36,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 02:02:36,068 INFO L481 AbstractCegarLoop]: Abstraction has 5167 states and 7168 transitions. [2021-01-07 02:02:36,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 02:02:36,069 INFO L276 IsEmpty]: Start isEmpty. Operand 5167 states and 7168 transitions. [2021-01-07 02:02:36,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-07 02:02:36,077 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 02:02:36,077 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] [2021-01-07 02:02:36,077 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 02:02:36,081 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 02:02:36,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 02:02:36,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1032247073, now seen corresponding path program 1 times [2021-01-07 02:02:36,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 02:02:36,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722210066] [2021-01-07 02:02:36,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 02:02:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 02:02:37,448 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 02:02:37,449 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722210066] [2021-01-07 02:02:37,449 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 02:02:37,449 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 02:02:37,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399582988] [2021-01-07 02:02:37,450 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 02:02:37,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 02:02:37,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 02:02:37,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 02:02:37,451 INFO L87 Difference]: Start difference. First operand 5167 states and 7168 transitions. Second operand 6 states. [2021-01-07 02:02:38,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 02:02:38,691 INFO L93 Difference]: Finished difference Result 25673 states and 35628 transitions. [2021-01-07 02:02:38,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 02:02:38,696 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2021-01-07 02:02:38,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 02:02:38,845 INFO L225 Difference]: With dead ends: 25673 [2021-01-07 02:02:38,845 INFO L226 Difference]: Without dead ends: 20509 [2021-01-07 02:02:38,868 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-01-07 02:02:38,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20509 states. [2021-01-07 02:02:39,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20509 to 5217. [2021-01-07 02:02:39,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5217 states. [2021-01-07 02:02:39,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5217 states to 5217 states and 7228 transitions. [2021-01-07 02:02:39,316 INFO L78 Accepts]: Start accepts. Automaton has 5217 states and 7228 transitions. Word has length 22 [2021-01-07 02:02:39,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 02:02:39,316 INFO L481 AbstractCegarLoop]: Abstraction has 5217 states and 7228 transitions. [2021-01-07 02:02:39,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 02:02:39,316 INFO L276 IsEmpty]: Start isEmpty. Operand 5217 states and 7228 transitions. [2021-01-07 02:02:39,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-07 02:02:39,320 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 02:02:39,320 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] [2021-01-07 02:02:39,321 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 02:02:39,321 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 02:02:39,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 02:02:39,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1290412511, now seen corresponding path program 1 times [2021-01-07 02:02:39,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 02:02:39,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765243115] [2021-01-07 02:02:39,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 02:02:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 02:02:40,407 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 02:02:40,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765243115] [2021-01-07 02:02:40,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 02:02:40,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 02:02:40,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66404924] [2021-01-07 02:02:40,409 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 02:02:40,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 02:02:40,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 02:02:40,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 02:02:40,410 INFO L87 Difference]: Start difference. First operand 5217 states and 7228 transitions. Second operand 3 states. [2021-01-07 02:02:40,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 02:02:40,705 INFO L93 Difference]: Finished difference Result 5217 states and 7228 transitions. [2021-01-07 02:02:40,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 02:02:40,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2021-01-07 02:02:40,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 02:02:40,721 INFO L225 Difference]: With dead ends: 5217 [2021-01-07 02:02:40,721 INFO L226 Difference]: Without dead ends: 5215 [2021-01-07 02:02:40,725 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 02:02:40,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5215 states. [2021-01-07 02:02:41,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5215 to 5215. [2021-01-07 02:02:41,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5215 states. [2021-01-07 02:02:41,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5215 states to 5215 states and 7226 transitions. [2021-01-07 02:02:41,037 INFO L78 Accepts]: Start accepts. Automaton has 5215 states and 7226 transitions. Word has length 22 [2021-01-07 02:02:41,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 02:02:41,038 INFO L481 AbstractCegarLoop]: Abstraction has 5215 states and 7226 transitions. [2021-01-07 02:02:41,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 02:02:41,038 INFO L276 IsEmpty]: Start isEmpty. Operand 5215 states and 7226 transitions. [2021-01-07 02:02:41,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-07 02:02:41,039 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 02:02:41,039 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 02:02:41,039 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-07 02:02:41,040 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 02:02:41,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 02:02:41,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1348092953, now seen corresponding path program 1 times [2021-01-07 02:02:41,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 02:02:41,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604317501] [2021-01-07 02:02:41,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 02:02:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 02:02:42,069 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 02:02:42,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604317501] [2021-01-07 02:02:42,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 02:02:42,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 02:02:42,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055322714] [2021-01-07 02:02:42,080 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 02:02:42,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 02:02:42,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 02:02:42,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 02:02:42,081 INFO L87 Difference]: Start difference. First operand 5215 states and 7226 transitions. Second operand 3 states. [2021-01-07 02:02:42,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 02:02:42,279 INFO L93 Difference]: Finished difference Result 5215 states and 7226 transitions. [2021-01-07 02:02:42,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 02:02:42,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2021-01-07 02:02:42,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 02:02:42,294 INFO L225 Difference]: With dead ends: 5215 [2021-01-07 02:02:42,294 INFO L226 Difference]: Without dead ends: 5213 [2021-01-07 02:02:42,297 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 02:02:42,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5213 states. [2021-01-07 02:02:42,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5213 to 5213. [2021-01-07 02:02:42,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5213 states. [2021-01-07 02:02:42,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5213 states to 5213 states and 7224 transitions. [2021-01-07 02:02:42,592 INFO L78 Accepts]: Start accepts. Automaton has 5213 states and 7224 transitions. Word has length 23 [2021-01-07 02:02:42,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 02:02:42,593 INFO L481 AbstractCegarLoop]: Abstraction has 5213 states and 7224 transitions. [2021-01-07 02:02:42,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 02:02:42,593 INFO L276 IsEmpty]: Start isEmpty. Operand 5213 states and 7224 transitions. [2021-01-07 02:02:42,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-07 02:02:42,594 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 02:02:42,594 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 02:02:42,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-07 02:02:42,594 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 02:02:42,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 02:02:42,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1158780631, now seen corresponding path program 1 times [2021-01-07 02:02:42,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 02:02:42,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729028593] [2021-01-07 02:02:42,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 02:02:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 02:02:43,522 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 02:02:43,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729028593] [2021-01-07 02:02:43,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 02:02:43,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 02:02:43,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451947158] [2021-01-07 02:02:43,524 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 02:02:43,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 02:02:43,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 02:02:43,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 02:02:43,525 INFO L87 Difference]: Start difference. First operand 5213 states and 7224 transitions. Second operand 3 states. [2021-01-07 02:02:43,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 02:02:43,963 INFO L93 Difference]: Finished difference Result 11833 states and 16404 transitions. [2021-01-07 02:02:43,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 02:02:43,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2021-01-07 02:02:43,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 02:02:43,983 INFO L225 Difference]: With dead ends: 11833 [2021-01-07 02:02:43,984 INFO L226 Difference]: Without dead ends: 6617 [2021-01-07 02:02:43,994 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 02:02:44,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6617 states. [2021-01-07 02:02:44,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6617 to 6605. [2021-01-07 02:02:44,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6605 states. [2021-01-07 02:02:44,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6605 states to 6605 states and 9148 transitions. [2021-01-07 02:02:44,326 INFO L78 Accepts]: Start accepts. Automaton has 6605 states and 9148 transitions. Word has length 24 [2021-01-07 02:02:44,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 02:02:44,328 INFO L481 AbstractCegarLoop]: Abstraction has 6605 states and 9148 transitions. [2021-01-07 02:02:44,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 02:02:44,334 INFO L276 IsEmpty]: Start isEmpty. Operand 6605 states and 9148 transitions. [2021-01-07 02:02:44,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-07 02:02:44,335 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 02:02:44,336 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 02:02:44,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-07 02:02:44,342 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 02:02:44,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 02:02:44,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1100373169, now seen corresponding path program 1 times [2021-01-07 02:02:44,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 02:02:44,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658438506] [2021-01-07 02:02:44,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 02:02:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 02:02:45,365 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 02:02:45,365 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658438506] [2021-01-07 02:02:45,365 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 02:02:45,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 02:02:45,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718000534] [2021-01-07 02:02:45,366 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 02:02:45,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 02:02:45,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 02:02:45,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 02:02:45,379 INFO L87 Difference]: Start difference. First operand 6605 states and 9148 transitions. Second operand 3 states. [2021-01-07 02:02:48,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 02:02:48,615 INFO L93 Difference]: Finished difference Result 16483 states and 22886 transitions. [2021-01-07 02:02:48,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 02:02:48,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2021-01-07 02:02:48,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 02:02:48,644 INFO L225 Difference]: With dead ends: 16483 [2021-01-07 02:02:48,645 INFO L226 Difference]: Without dead ends: 9881 [2021-01-07 02:02:48,660 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 02:02:48,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9881 states. [2021-01-07 02:02:49,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9881 to 9869. [2021-01-07 02:02:49,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9869 states. [2021-01-07 02:02:49,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9869 states to 9869 states and 13648 transitions. [2021-01-07 02:02:49,300 INFO L78 Accepts]: Start accepts. Automaton has 9869 states and 13648 transitions. Word has length 35 [2021-01-07 02:02:49,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 02:02:49,300 INFO L481 AbstractCegarLoop]: Abstraction has 9869 states and 13648 transitions. [2021-01-07 02:02:49,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 02:02:49,301 INFO L276 IsEmpty]: Start isEmpty. Operand 9869 states and 13648 transitions. [2021-01-07 02:02:49,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-01-07 02:02:49,302 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 02:02:49,303 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 02:02:49,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-07 02:02:49,303 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 02:02:49,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 02:02:49,304 INFO L82 PathProgramCache]: Analyzing trace with hash 491641491, now seen corresponding path program 1 times [2021-01-07 02:02:49,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 02:02:49,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652516683] [2021-01-07 02:02:49,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 02:02:49,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 02:02:50,080 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 02:02:50,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652516683] [2021-01-07 02:02:50,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 02:02:50,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 02:02:50,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392372338] [2021-01-07 02:02:50,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 02:02:50,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 02:02:50,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 02:02:50,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 02:02:50,083 INFO L87 Difference]: Start difference. First operand 9869 states and 13648 transitions. Second operand 3 states. [2021-01-07 02:02:51,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 02:02:51,210 INFO L93 Difference]: Finished difference Result 21004 states and 29115 transitions. [2021-01-07 02:02:51,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 02:02:51,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2021-01-07 02:02:51,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 02:02:51,243 INFO L225 Difference]: With dead ends: 21004 [2021-01-07 02:02:51,243 INFO L226 Difference]: Without dead ends: 11138 [2021-01-07 02:02:51,263 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 02:02:51,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11138 states. [2021-01-07 02:02:51,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11138 to 11101. [2021-01-07 02:02:51,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11101 states. [2021-01-07 02:02:51,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11101 states to 11101 states and 15428 transitions. [2021-01-07 02:02:51,818 INFO L78 Accepts]: Start accepts. Automaton has 11101 states and 15428 transitions. Word has length 42 [2021-01-07 02:02:51,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 02:02:51,818 INFO L481 AbstractCegarLoop]: Abstraction has 11101 states and 15428 transitions. [2021-01-07 02:02:51,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 02:02:51,818 INFO L276 IsEmpty]: Start isEmpty. Operand 11101 states and 15428 transitions. [2021-01-07 02:02:51,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-01-07 02:02:51,824 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 02:02:51,825 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 02:02:51,825 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-07 02:02:51,825 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 02:02:51,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 02:02:51,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1019502293, now seen corresponding path program 1 times [2021-01-07 02:02:51,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 02:02:51,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012338279] [2021-01-07 02:02:51,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 02:02:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 02:02:52,982 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 02:02:52,982 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012338279] [2021-01-07 02:02:52,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 02:02:52,984 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 02:02:52,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499802773] [2021-01-07 02:02:52,985 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 02:02:52,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 02:02:52,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 02:02:52,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 02:02:52,986 INFO L87 Difference]: Start difference. First operand 11101 states and 15428 transitions. Second operand 3 states. [2021-01-07 02:02:56,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 02:02:56,274 INFO L93 Difference]: Finished difference Result 25871 states and 36082 transitions. [2021-01-07 02:02:56,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 02:02:56,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2021-01-07 02:02:56,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 02:02:56,322 INFO L225 Difference]: With dead ends: 25871 [2021-01-07 02:02:56,322 INFO L226 Difference]: Without dead ends: 14773 [2021-01-07 02:02:56,341 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 02:02:56,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14773 states. [2021-01-07 02:02:56,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14773 to 14761. [2021-01-07 02:02:56,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14761 states. [2021-01-07 02:02:56,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14761 states to 14761 states and 20480 transitions. [2021-01-07 02:02:56,881 INFO L78 Accepts]: Start accepts. Automaton has 14761 states and 20480 transitions. Word has length 56 [2021-01-07 02:02:56,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 02:02:56,881 INFO L481 AbstractCegarLoop]: Abstraction has 14761 states and 20480 transitions. [2021-01-07 02:02:56,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 02:02:56,881 INFO L276 IsEmpty]: Start isEmpty. Operand 14761 states and 20480 transitions. [2021-01-07 02:02:56,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-01-07 02:02:56,885 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 02:02:56,885 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 02:02:56,886 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-07 02:02:56,886 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 02:02:56,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 02:02:56,887 INFO L82 PathProgramCache]: Analyzing trace with hash 606612250, now seen corresponding path program 1 times [2021-01-07 02:02:56,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 02:02:56,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194474036] [2021-01-07 02:02:56,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 02:02:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 02:02:58,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 02:02:58,098 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194474036] [2021-01-07 02:02:58,098 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 02:02:58,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 02:02:58,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114892290] [2021-01-07 02:02:58,101 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 02:02:58,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 02:02:58,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 02:02:58,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 02:02:58,103 INFO L87 Difference]: Start difference. First operand 14761 states and 20480 transitions. Second operand 3 states. [2021-01-07 02:02:58,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 02:02:58,911 INFO L93 Difference]: Finished difference Result 22959 states and 31781 transitions. [2021-01-07 02:02:58,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 02:02:58,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2021-01-07 02:02:58,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 02:02:58,936 INFO L225 Difference]: With dead ends: 22959 [2021-01-07 02:02:58,936 INFO L226 Difference]: Without dead ends: 8201 [2021-01-07 02:02:58,960 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 02:02:58,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8201 states. [2021-01-07 02:02:59,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8201 to 7032. [2021-01-07 02:02:59,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7032 states. [2021-01-07 02:02:59,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7032 states to 7032 states and 9796 transitions. [2021-01-07 02:02:59,256 INFO L78 Accepts]: Start accepts. Automaton has 7032 states and 9796 transitions. Word has length 71 [2021-01-07 02:02:59,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 02:02:59,257 INFO L481 AbstractCegarLoop]: Abstraction has 7032 states and 9796 transitions. [2021-01-07 02:02:59,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 02:02:59,257 INFO L276 IsEmpty]: Start isEmpty. Operand 7032 states and 9796 transitions. [2021-01-07 02:02:59,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-07 02:02:59,260 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 02:02:59,260 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 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] [2021-01-07 02:02:59,261 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-07 02:02:59,261 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 02:02:59,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 02:02:59,261 INFO L82 PathProgramCache]: Analyzing trace with hash 2036984032, now seen corresponding path program 1 times [2021-01-07 02:02:59,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 02:02:59,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703270504] [2021-01-07 02:02:59,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 02:02:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 02:03:00,401 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-01-07 02:03:00,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703270504] [2021-01-07 02:03:00,401 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 02:03:00,401 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 02:03:00,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686876160] [2021-01-07 02:03:00,403 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 02:03:00,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 02:03:00,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 02:03:00,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-07 02:03:00,406 INFO L87 Difference]: Start difference. First operand 7032 states and 9796 transitions. Second operand 5 states. [2021-01-07 02:03:02,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 02:03:02,400 INFO L93 Difference]: Finished difference Result 25642 states and 35557 transitions. [2021-01-07 02:03:02,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 02:03:02,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2021-01-07 02:03:02,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 02:03:02,447 INFO L225 Difference]: With dead ends: 25642 [2021-01-07 02:03:02,447 INFO L226 Difference]: Without dead ends: 18628 [2021-01-07 02:03:02,465 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-01-07 02:03:02,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18628 states. [2021-01-07 02:03:03,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18628 to 8668. [2021-01-07 02:03:03,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8668 states. [2021-01-07 02:03:03,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8668 states to 8668 states and 12157 transitions. [2021-01-07 02:03:03,050 INFO L78 Accepts]: Start accepts. Automaton has 8668 states and 12157 transitions. Word has length 72 [2021-01-07 02:03:03,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 02:03:03,051 INFO L481 AbstractCegarLoop]: Abstraction has 8668 states and 12157 transitions. [2021-01-07 02:03:03,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 02:03:03,051 INFO L276 IsEmpty]: Start isEmpty. Operand 8668 states and 12157 transitions. [2021-01-07 02:03:03,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-07 02:03:03,053 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 02:03:03,053 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 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] [2021-01-07 02:03:03,053 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-07 02:03:03,054 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 02:03:03,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 02:03:03,054 INFO L82 PathProgramCache]: Analyzing trace with hash -272132865, now seen corresponding path program 1 times [2021-01-07 02:03:03,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 02:03:03,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947324434] [2021-01-07 02:03:03,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 02:03:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 02:03:03,930 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-01-07 02:03:03,930 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947324434] [2021-01-07 02:03:03,931 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 02:03:03,931 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 02:03:03,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159713987] [2021-01-07 02:03:03,931 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 02:03:03,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 02:03:03,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 02:03:03,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 02:03:03,932 INFO L87 Difference]: Start difference. First operand 8668 states and 12157 transitions. Second operand 3 states. [2021-01-07 02:03:07,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 02:03:07,270 INFO L93 Difference]: Finished difference Result 19354 states and 27157 transitions. [2021-01-07 02:03:07,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 02:03:07,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2021-01-07 02:03:07,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 02:03:07,305 INFO L225 Difference]: With dead ends: 19354 [2021-01-07 02:03:07,306 INFO L226 Difference]: Without dead ends: 10704 [2021-01-07 02:03:07,323 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 02:03:07,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10704 states. [2021-01-07 02:03:07,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10704 to 10304. [2021-01-07 02:03:07,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10304 states. [2021-01-07 02:03:07,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10304 states to 10304 states and 14438 transitions. [2021-01-07 02:03:07,830 INFO L78 Accepts]: Start accepts. Automaton has 10304 states and 14438 transitions. Word has length 73 [2021-01-07 02:03:07,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 02:03:07,830 INFO L481 AbstractCegarLoop]: Abstraction has 10304 states and 14438 transitions. [2021-01-07 02:03:07,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 02:03:07,830 INFO L276 IsEmpty]: Start isEmpty. Operand 10304 states and 14438 transitions. [2021-01-07 02:03:07,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-07 02:03:07,833 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 02:03:07,833 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 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] [2021-01-07 02:03:07,833 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-07 02:03:07,833 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 02:03:07,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 02:03:07,834 INFO L82 PathProgramCache]: Analyzing trace with hash -698320662, now seen corresponding path program 1 times [2021-01-07 02:03:07,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 02:03:07,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253638034] [2021-01-07 02:03:07,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 02:03:08,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 02:03:08,963 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-01-07 02:03:08,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253638034] [2021-01-07 02:03:08,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 02:03:08,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 02:03:08,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035397975] [2021-01-07 02:03:08,964 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 02:03:08,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 02:03:08,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 02:03:08,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 02:03:08,966 INFO L87 Difference]: Start difference. First operand 10304 states and 14438 transitions. Second operand 3 states. [2021-01-07 02:03:11,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 02:03:11,953 INFO L93 Difference]: Finished difference Result 22626 states and 31719 transitions. [2021-01-07 02:03:11,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 02:03:11,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2021-01-07 02:03:11,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 02:03:11,990 INFO L225 Difference]: With dead ends: 22626 [2021-01-07 02:03:11,990 INFO L226 Difference]: Without dead ends: 12340 [2021-01-07 02:03:12,006 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 02:03:12,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12340 states. [2021-01-07 02:03:12,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12340 to 11940. [2021-01-07 02:03:12,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11940 states. [2021-01-07 02:03:12,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11940 states to 11940 states and 16719 transitions. [2021-01-07 02:03:12,652 INFO L78 Accepts]: Start accepts. Automaton has 11940 states and 16719 transitions. Word has length 74 [2021-01-07 02:03:12,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 02:03:12,652 INFO L481 AbstractCegarLoop]: Abstraction has 11940 states and 16719 transitions. [2021-01-07 02:03:12,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 02:03:12,652 INFO L276 IsEmpty]: Start isEmpty. Operand 11940 states and 16719 transitions. [2021-01-07 02:03:12,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-07 02:03:12,661 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 02:03:12,662 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 02:03:12,662 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-07 02:03:12,662 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 02:03:12,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 02:03:12,663 INFO L82 PathProgramCache]: Analyzing trace with hash 572881383, now seen corresponding path program 1 times [2021-01-07 02:03:12,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 02:03:12,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10797263] [2021-01-07 02:03:12,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 02:03:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 02:03:13,513 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-01-07 02:03:13,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10797263] [2021-01-07 02:03:13,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 02:03:13,514 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 02:03:13,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831005936] [2021-01-07 02:03:13,515 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 02:03:13,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 02:03:13,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 02:03:13,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 02:03:13,516 INFO L87 Difference]: Start difference. First operand 11940 states and 16719 transitions. Second operand 4 states. [2021-01-07 02:03:14,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 02:03:14,618 INFO L93 Difference]: Finished difference Result 26638 states and 37251 transitions. [2021-01-07 02:03:14,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 02:03:14,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2021-01-07 02:03:14,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 02:03:14,640 INFO L225 Difference]: With dead ends: 26638 [2021-01-07 02:03:14,640 INFO L226 Difference]: Without dead ends: 14716 [2021-01-07 02:03:14,658 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 02:03:14,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14716 states. [2021-01-07 02:03:15,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14716 to 11940. [2021-01-07 02:03:15,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11940 states. [2021-01-07 02:03:15,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11940 states to 11940 states and 16717 transitions. [2021-01-07 02:03:15,247 INFO L78 Accepts]: Start accepts. Automaton has 11940 states and 16717 transitions. Word has length 74 [2021-01-07 02:03:15,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 02:03:15,248 INFO L481 AbstractCegarLoop]: Abstraction has 11940 states and 16717 transitions. [2021-01-07 02:03:15,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 02:03:15,248 INFO L276 IsEmpty]: Start isEmpty. Operand 11940 states and 16717 transitions. [2021-01-07 02:03:15,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-07 02:03:15,250 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 02:03:15,250 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] [2021-01-07 02:03:15,251 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-07 02:03:15,251 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 02:03:15,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 02:03:15,251 INFO L82 PathProgramCache]: Analyzing trace with hash 245961564, now seen corresponding path program 1 times [2021-01-07 02:03:15,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 02:03:15,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210511712] [2021-01-07 02:03:15,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 02:03:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 02:03:16,069 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 02:03:16,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210511712] [2021-01-07 02:03:16,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 02:03:16,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 02:03:16,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747025542] [2021-01-07 02:03:16,070 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 02:03:16,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 02:03:16,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 02:03:16,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 02:03:16,071 INFO L87 Difference]: Start difference. First operand 11940 states and 16717 transitions. Second operand 4 states. [2021-01-07 02:03:17,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 02:03:17,235 INFO L93 Difference]: Finished difference Result 26638 states and 37247 transitions. [2021-01-07 02:03:17,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 02:03:17,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2021-01-07 02:03:17,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 02:03:17,256 INFO L225 Difference]: With dead ends: 26638 [2021-01-07 02:03:17,257 INFO L226 Difference]: Without dead ends: 14716 [2021-01-07 02:03:17,270 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 02:03:17,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14716 states. [2021-01-07 02:03:17,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14716 to 11940. [2021-01-07 02:03:17,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11940 states. [2021-01-07 02:03:17,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11940 states to 11940 states and 16715 transitions. [2021-01-07 02:03:17,972 INFO L78 Accepts]: Start accepts. Automaton has 11940 states and 16715 transitions. Word has length 75 [2021-01-07 02:03:17,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 02:03:17,973 INFO L481 AbstractCegarLoop]: Abstraction has 11940 states and 16715 transitions. [2021-01-07 02:03:17,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 02:03:17,973 INFO L276 IsEmpty]: Start isEmpty. Operand 11940 states and 16715 transitions. [2021-01-07 02:03:17,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-07 02:03:17,976 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 02:03:17,976 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 02:03:17,976 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-07 02:03:17,976 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 02:03:17,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 02:03:17,981 INFO L82 PathProgramCache]: Analyzing trace with hash -544147174, now seen corresponding path program 1 times [2021-01-07 02:03:17,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 02:03:17,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353004580] [2021-01-07 02:03:17,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 02:03:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 02:03:18,831 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-01-07 02:03:18,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353004580] [2021-01-07 02:03:18,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 02:03:18,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 02:03:18,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258942920] [2021-01-07 02:03:18,832 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 02:03:18,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 02:03:18,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 02:03:18,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 02:03:18,833 INFO L87 Difference]: Start difference. First operand 11940 states and 16715 transitions. Second operand 3 states. [2021-01-07 02:03:22,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 02:03:22,121 INFO L93 Difference]: Finished difference Result 25898 states and 36273 transitions. [2021-01-07 02:03:22,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 02:03:22,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2021-01-07 02:03:22,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 02:03:22,142 INFO L225 Difference]: With dead ends: 25898 [2021-01-07 02:03:22,142 INFO L226 Difference]: Without dead ends: 13976 [2021-01-07 02:03:22,157 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 02:03:22,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13976 states. [2021-01-07 02:03:22,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13976 to 13576. [2021-01-07 02:03:22,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13576 states. [2021-01-07 02:03:22,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13576 states to 13576 states and 18996 transitions. [2021-01-07 02:03:22,791 INFO L78 Accepts]: Start accepts. Automaton has 13576 states and 18996 transitions. Word has length 75 [2021-01-07 02:03:22,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 02:03:22,791 INFO L481 AbstractCegarLoop]: Abstraction has 13576 states and 18996 transitions. [2021-01-07 02:03:22,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 02:03:22,791 INFO L276 IsEmpty]: Start isEmpty. Operand 13576 states and 18996 transitions. [2021-01-07 02:03:22,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-07 02:03:22,793 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 02:03:22,794 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] [2021-01-07 02:03:22,794 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-07 02:03:22,794 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 02:03:22,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 02:03:22,794 INFO L82 PathProgramCache]: Analyzing trace with hash 173357725, now seen corresponding path program 1 times [2021-01-07 02:03:22,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 02:03:22,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566371584] [2021-01-07 02:03:22,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 02:03:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 02:03:23,708 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 02:03:23,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566371584] [2021-01-07 02:03:23,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084126713] [2021-01-07 02:03:23,711 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 02:03:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 02:03:29,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 13227 conjuncts, 7 conjunts are in the unsatisfiable core [2021-01-07 02:03:29,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 02:03:30,085 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 02:03:30,086 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 02:03:30,086 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2021-01-07 02:03:30,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446280349] [2021-01-07 02:03:30,087 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 02:03:30,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 02:03:30,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 02:03:30,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-01-07 02:03:30,088 INFO L87 Difference]: Start difference. First operand 13576 states and 18996 transitions. Second operand 8 states. [2021-01-07 02:03:34,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 02:03:34,899 INFO L93 Difference]: Finished difference Result 40533 states and 56744 transitions. [2021-01-07 02:03:34,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 02:03:34,900 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 75 [2021-01-07 02:03:34,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 02:03:34,966 INFO L225 Difference]: With dead ends: 40533 [2021-01-07 02:03:34,966 INFO L226 Difference]: Without dead ends: 26967 [2021-01-07 02:03:34,990 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-01-07 02:03:35,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26967 states. [2021-01-07 02:03:36,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26967 to 13580. [2021-01-07 02:03:36,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13580 states. [2021-01-07 02:03:36,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13580 states to 13580 states and 18994 transitions. [2021-01-07 02:03:36,224 INFO L78 Accepts]: Start accepts. Automaton has 13580 states and 18994 transitions. Word has length 75 [2021-01-07 02:03:36,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 02:03:36,224 INFO L481 AbstractCegarLoop]: Abstraction has 13580 states and 18994 transitions. [2021-01-07 02:03:36,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 02:03:36,224 INFO L276 IsEmpty]: Start isEmpty. Operand 13580 states and 18994 transitions. [2021-01-07 02:03:36,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-01-07 02:03:36,226 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 02:03:36,226 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 02:03:36,427 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-01-07 02:03:36,428 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 02:03:36,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 02:03:36,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1583219236, now seen corresponding path program 1 times [2021-01-07 02:03:36,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 02:03:36,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426644753] [2021-01-07 02:03:36,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 02:03:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 02:03:37,493 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 02:03:37,494 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426644753] [2021-01-07 02:03:37,494 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 02:03:37,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 02:03:37,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136091896] [2021-01-07 02:03:37,495 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 02:03:37,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 02:03:37,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 02:03:37,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 02:03:37,496 INFO L87 Difference]: Start difference. First operand 13580 states and 18994 transitions. Second operand 3 states. [2021-01-07 02:03:38,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 02:03:38,143 INFO L93 Difference]: Finished difference Result 27150 states and 37981 transitions. [2021-01-07 02:03:38,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 02:03:38,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2021-01-07 02:03:38,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 02:03:38,177 INFO L225 Difference]: With dead ends: 27150 [2021-01-07 02:03:38,177 INFO L226 Difference]: Without dead ends: 13588 [2021-01-07 02:03:38,192 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 02:03:38,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13588 states. [2021-01-07 02:03:39,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13588 to 13588. [2021-01-07 02:03:39,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13588 states. [2021-01-07 02:03:39,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13588 states to 13588 states and 19002 transitions. [2021-01-07 02:03:39,111 INFO L78 Accepts]: Start accepts. Automaton has 13588 states and 19002 transitions. Word has length 86 [2021-01-07 02:03:39,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 02:03:39,112 INFO L481 AbstractCegarLoop]: Abstraction has 13588 states and 19002 transitions. [2021-01-07 02:03:39,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 02:03:39,112 INFO L276 IsEmpty]: Start isEmpty. Operand 13588 states and 19002 transitions. [2021-01-07 02:03:39,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-01-07 02:03:39,115 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 02:03:39,115 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 02:03:39,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-07 02:03:39,115 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 02:03:39,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 02:03:39,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1581372194, now seen corresponding path program 1 times [2021-01-07 02:03:39,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 02:03:39,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454636424] [2021-01-07 02:03:39,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 02:03:39,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 02:03:40,214 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 02:03:40,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454636424] [2021-01-07 02:03:40,214 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 02:03:40,214 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 02:03:40,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681407547] [2021-01-07 02:03:40,215 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 02:03:40,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 02:03:40,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 02:03:40,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 02:03:40,216 INFO L87 Difference]: Start difference. First operand 13588 states and 19002 transitions. Second operand 3 states. [2021-01-07 02:03:43,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 02:03:43,857 INFO L93 Difference]: Finished difference Result 27156 states and 37980 transitions. [2021-01-07 02:03:43,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 02:03:43,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2021-01-07 02:03:43,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 02:03:43,883 INFO L225 Difference]: With dead ends: 27156 [2021-01-07 02:03:43,883 INFO L226 Difference]: Without dead ends: 13586 [2021-01-07 02:03:43,898 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 02:03:43,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13586 states. [2021-01-07 02:03:44,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13586 to 13563. [2021-01-07 02:03:44,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13563 states. [2021-01-07 02:03:44,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13563 states to 13563 states and 18950 transitions. [2021-01-07 02:03:44,878 INFO L78 Accepts]: Start accepts. Automaton has 13563 states and 18950 transitions. Word has length 86 [2021-01-07 02:03:44,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 02:03:44,878 INFO L481 AbstractCegarLoop]: Abstraction has 13563 states and 18950 transitions. [2021-01-07 02:03:44,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 02:03:44,878 INFO L276 IsEmpty]: Start isEmpty. Operand 13563 states and 18950 transitions. [2021-01-07 02:03:44,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-07 02:03:44,880 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 02:03:44,881 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 02:03:44,881 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-07 02:03:44,881 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 02:03:44,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 02:03:44,882 INFO L82 PathProgramCache]: Analyzing trace with hash -678988661, now seen corresponding path program 1 times [2021-01-07 02:03:44,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 02:03:44,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59230673] [2021-01-07 02:03:44,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 02:03:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 02:03:45,624 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 02:03:45,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59230673] [2021-01-07 02:03:45,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 02:03:45,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 02:03:45,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934799787] [2021-01-07 02:03:45,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 02:03:45,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 02:03:45,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 02:03:45,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 02:03:45,626 INFO L87 Difference]: Start difference. First operand 13563 states and 18950 transitions. Second operand 4 states. [2021-01-07 02:03:48,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 02:03:48,038 INFO L93 Difference]: Finished difference Result 66935 states and 93632 transitions. [2021-01-07 02:03:48,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 02:03:48,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2021-01-07 02:03:48,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 02:03:48,123 INFO L225 Difference]: With dead ends: 66935 [2021-01-07 02:03:48,123 INFO L226 Difference]: Without dead ends: 53390 [2021-01-07 02:03:48,151 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 02:03:48,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53390 states. [2021-01-07 02:03:49,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53390 to 13567. [2021-01-07 02:03:49,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13567 states. [2021-01-07 02:03:49,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13567 states to 13567 states and 18954 transitions. [2021-01-07 02:03:49,199 INFO L78 Accepts]: Start accepts. Automaton has 13567 states and 18954 transitions. Word has length 87 [2021-01-07 02:03:49,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 02:03:49,199 INFO L481 AbstractCegarLoop]: Abstraction has 13567 states and 18954 transitions. [2021-01-07 02:03:49,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 02:03:49,199 INFO L276 IsEmpty]: Start isEmpty. Operand 13567 states and 18954 transitions. [2021-01-07 02:03:49,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-01-07 02:03:49,201 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 02:03:49,201 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] [2021-01-07 02:03:49,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-07 02:03:49,202 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 02:03:49,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 02:03:49,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1723322813, now seen corresponding path program 1 times [2021-01-07 02:03:49,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 02:03:49,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007484703] [2021-01-07 02:03:49,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 02:03:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 02:03:49,872 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 02:03:49,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007484703] [2021-01-07 02:03:49,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 02:03:49,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 02:03:49,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531629791] [2021-01-07 02:03:49,877 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 02:03:49,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 02:03:49,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 02:03:49,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 02:03:49,879 INFO L87 Difference]: Start difference. First operand 13567 states and 18954 transitions. Second operand 3 states. [2021-01-07 02:03:54,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 02:03:54,447 INFO L93 Difference]: Finished difference Result 40477 states and 56590 transitions. [2021-01-07 02:03:54,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 02:03:54,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2021-01-07 02:03:54,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 02:03:54,481 INFO L225 Difference]: With dead ends: 40477 [2021-01-07 02:03:54,481 INFO L226 Difference]: Without dead ends: 26928 [2021-01-07 02:03:54,497 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 02:03:54,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26928 states. [2021-01-07 02:03:55,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26928 to 26855. [2021-01-07 02:03:55,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26855 states. [2021-01-07 02:03:56,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26855 states to 26855 states and 37578 transitions. [2021-01-07 02:03:56,035 INFO L78 Accepts]: Start accepts. Automaton has 26855 states and 37578 transitions. Word has length 89 [2021-01-07 02:03:56,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 02:03:56,035 INFO L481 AbstractCegarLoop]: Abstraction has 26855 states and 37578 transitions. [2021-01-07 02:03:56,035 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 02:03:56,035 INFO L276 IsEmpty]: Start isEmpty. Operand 26855 states and 37578 transitions. [2021-01-07 02:03:56,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-07 02:03:56,040 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 02:03:56,041 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, 1, 1] [2021-01-07 02:03:56,041 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-07 02:03:56,041 INFO L429 AbstractCegarLoop]: === Iteration 22 === [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 02:03:56,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 02:03:56,041 INFO L82 PathProgramCache]: Analyzing trace with hash 2048144034, now seen corresponding path program 1 times [2021-01-07 02:03:56,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 02:03:56,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247876672] [2021-01-07 02:03:56,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 02:03:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 02:03:56,692 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 02:03:56,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247876672] [2021-01-07 02:03:56,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 02:03:56,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 02:03:56,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004890511] [2021-01-07 02:03:56,694 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 02:03:56,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 02:03:56,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 02:03:56,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 02:03:56,695 INFO L87 Difference]: Start difference. First operand 26855 states and 37578 transitions. Second operand 4 states. [2021-01-07 02:04:02,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 02:04:02,851 INFO L93 Difference]: Finished difference Result 132621 states and 185794 transitions. [2021-01-07 02:04:02,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 02:04:02,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2021-01-07 02:04:02,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 02:04:03,026 INFO L225 Difference]: With dead ends: 132621 [2021-01-07 02:04:03,027 INFO L226 Difference]: Without dead ends: 105784 [2021-01-07 02:04:03,074 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 02:04:03,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105784 states. [2021-01-07 02:04:05,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105784 to 26771. [2021-01-07 02:04:05,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26771 states. [2021-01-07 02:04:05,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26771 states to 26771 states and 37458 transitions. [2021-01-07 02:04:05,524 INFO L78 Accepts]: Start accepts. Automaton has 26771 states and 37458 transitions. Word has length 92 [2021-01-07 02:04:05,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 02:04:05,524 INFO L481 AbstractCegarLoop]: Abstraction has 26771 states and 37458 transitions. [2021-01-07 02:04:05,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 02:04:05,524 INFO L276 IsEmpty]: Start isEmpty. Operand 26771 states and 37458 transitions. [2021-01-07 02:04:05,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-01-07 02:04:05,530 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 02:04:05,530 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, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 02:04:05,530 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-07 02:04:05,531 INFO L429 AbstractCegarLoop]: === Iteration 23 === [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 02:04:05,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 02:04:05,531 INFO L82 PathProgramCache]: Analyzing trace with hash -188643836, now seen corresponding path program 1 times [2021-01-07 02:04:05,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 02:04:05,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41509574] [2021-01-07 02:04:05,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 02:04:05,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 02:04:06,518 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 02:04:06,519 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41509574] [2021-01-07 02:04:06,519 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793510850] [2021-01-07 02:04:06,519 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 02:04:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 02:04:12,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 13401 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 02:04:12,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 02:04:12,720 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 02:04:12,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 02:04:12,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-01-07 02:04:12,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712398275] [2021-01-07 02:04:12,722 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 02:04:12,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 02:04:12,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 02:04:12,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 02:04:12,723 INFO L87 Difference]: Start difference. First operand 26771 states and 37458 transitions. Second operand 4 states. [2021-01-07 02:04:20,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 02:04:20,202 INFO L93 Difference]: Finished difference Result 80279 states and 112329 transitions. [2021-01-07 02:04:20,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 02:04:20,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2021-01-07 02:04:20,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 02:04:20,315 INFO L225 Difference]: With dead ends: 80279 [2021-01-07 02:04:20,315 INFO L226 Difference]: Without dead ends: 80271 [2021-01-07 02:04:20,334 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 97 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 02:04:20,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80271 states. [2021-01-07 02:04:25,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80271 to 80183. [2021-01-07 02:04:25,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80183 states. [2021-01-07 02:04:26,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80183 states to 80183 states and 112218 transitions. [2021-01-07 02:04:26,040 INFO L78 Accepts]: Start accepts. Automaton has 80183 states and 112218 transitions. Word has length 97 [2021-01-07 02:04:26,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 02:04:26,041 INFO L481 AbstractCegarLoop]: Abstraction has 80183 states and 112218 transitions. [2021-01-07 02:04:26,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 02:04:26,041 INFO L276 IsEmpty]: Start isEmpty. Operand 80183 states and 112218 transitions. [2021-01-07 02:04:26,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-07 02:04:26,049 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 02:04:26,049 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, 1, 1, 1, 1, 1] [2021-01-07 02:04:26,264 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-01-07 02:04:26,265 INFO L429 AbstractCegarLoop]: === Iteration 24 === [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 02:04:26,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 02:04:26,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1901741403, now seen corresponding path program 1 times [2021-01-07 02:04:26,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 02:04:26,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107485529] [2021-01-07 02:04:26,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 02:04:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 02:04:27,254 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 02:04:27,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107485529] [2021-01-07 02:04:27,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 02:04:27,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 02:04:27,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437188702] [2021-01-07 02:04:27,255 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 02:04:27,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 02:04:27,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 02:04:27,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 02:04:27,256 INFO L87 Difference]: Start difference. First operand 80183 states and 112218 transitions. Second operand 4 states. [2021-01-07 02:04:34,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 02:04:34,155 INFO L93 Difference]: Finished difference Result 101388 states and 141492 transitions. [2021-01-07 02:04:34,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 02:04:34,156 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2021-01-07 02:04:34,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 02:04:34,302 INFO L225 Difference]: With dead ends: 101388 [2021-01-07 02:04:34,302 INFO L226 Difference]: Without dead ends: 96398 [2021-01-07 02:04:34,329 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 02:04:34,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96398 states. [2021-01-07 02:04:40,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96398 to 80183. [2021-01-07 02:04:40,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80183 states. [2021-01-07 02:04:40,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80183 states to 80183 states and 112206 transitions. [2021-01-07 02:04:40,439 INFO L78 Accepts]: Start accepts. Automaton has 80183 states and 112206 transitions. Word has length 98 [2021-01-07 02:04:40,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 02:04:40,439 INFO L481 AbstractCegarLoop]: Abstraction has 80183 states and 112206 transitions. [2021-01-07 02:04:40,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 02:04:40,440 INFO L276 IsEmpty]: Start isEmpty. Operand 80183 states and 112206 transitions. [2021-01-07 02:04:40,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-01-07 02:04:40,448 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 02:04:40,449 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 02:04:40,449 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-07 02:04:40,449 INFO L429 AbstractCegarLoop]: === Iteration 25 === [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 02:04:40,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 02:04:40,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1178813530, now seen corresponding path program 1 times [2021-01-07 02:04:40,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 02:04:40,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920403444] [2021-01-07 02:04:40,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 02:04:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 02:04:41,392 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-07 02:04:41,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920403444] [2021-01-07 02:04:41,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012957999] [2021-01-07 02:04:41,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true